Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Previous revision
staff:kriege [2018-05-29 09:50]
staff:kriege [2018-07-14 07:35]
Line 90: Line 90:
  
 === Preprints === === Preprints ===
-  * **[[https://​arxiv.org/​abs/​1805.00821|Largest Weight Common Subtree Embeddings with Distance Penalties]]** \\ Andre Droschinsky,​ Nils M. Kriege, Petra Mutzel, ''​arXiv:​1805.00821''​. 
- 
   * **[[https://​doi.org/​10.7287/​peerj.preprints.26612v1|Protein Complex Similarity based on Weisfeiler-Lehman labeling]]** \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ PeerJ Preprints, vol. 6, e26612v1, 2018.   * **[[https://​doi.org/​10.7287/​peerj.preprints.26612v1|Protein Complex Similarity based on Weisfeiler-Lehman labeling]]** \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ PeerJ Preprints, vol. 6, e26612v1, 2018.
  
Line 111: Line 109:
  
 === Refereed Conference Proceedings === === Refereed Conference Proceedings ===
-  * **A Property Testing Framework for the Theoretical Expressivity of Graph Kernels** \\ Nils M. Kriege, Christopher Morris, Anja Rey, Christian Sohler \\ International Joint Conference on Artificial Intelligence and European Conference on Artificial Intelligence (IJCAI-ECAI) 2018, accepted.+  * **Largest Weight Common Subtree Embeddings with Distance Penalties** (Preprint [[https://​arxiv.org/​abs/​1805.00821|arXiv:​1805.00821]]) \\ Andre Droschinsky,​ Nils M. Kriege, Petra Mutzel \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, accepted. 
 + 
 +  * **[[https://​doi.org/​10.24963/​ijcai.2018/​325|A Property Testing Framework for the Theoretical Expressivity of Graph Kernels]]** \\ Nils M. Kriege, Christopher Morris, Anja Rey, Christian Sohler \\ International Joint Conference on Artificial Intelligence and European Conference on Artificial Intelligence (IJCAI-ECAI) 2018, 2348-2354.
  
   * **A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs** (Preprint [[https://​arxiv.org/​abs/​1803.10983|arXiv:​1803.10983]]) \\ Christine Dahn, Nils M. Kriege, Petra Mutzel \\ International Workshop on Combinatorial Algorithms (IWOCA) 2018, accepted.   * **A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs** (Preprint [[https://​arxiv.org/​abs/​1803.10983|arXiv:​1803.10983]]) \\ Christine Dahn, Nils M. Kriege, Petra Mutzel \\ International Workshop on Combinatorial Algorithms (IWOCA) 2018, accepted.
 
Last modified: 2020-07-20 10:01 by Nils Kriege
DokuWikiRSS-Feed