Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
staff:kriege [2018-05-12 00:27]
Nils Kriege [Publications]
staff:kriege [2018-07-14 07:35] (current)
Nils Kriege [Publications]
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 98: Line 96:
   * **[[https://​arxiv.org/​abs/​1612.05531|A general purpose algorithm for counting simple cycles and simple paths of any length]]** \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson, ''​arXiv:​1612.05531''​.   * **[[https://​arxiv.org/​abs/​1612.05531|A general purpose algorithm for counting simple cycles and simple paths of any length]]** \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson, ''​arXiv:​1612.05531''​.
  
-=== Journal Articles === +  ​* **[[https://​arxiv.org/​abs/​1805.10754|note on block-and-bridge preserving ​maximum common subgraph ​algorithms ​for outerplanar graphs]]** \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel, ​''​arXiv:​1805.10754''​.
-  ​* **Erratum to: A polynomial-time maximum common subgraph ​algorithm ​for outerplanar graphs ​and its application to chemoinformatics** \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel ​\\ Annals of Mathematics and Artificial Intelligence2018, under review.+
  
 +
 +=== Journal Articles ===
   * **[[https://​doi.org/​10.1016/​j.ejc.2017.07.012|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** (Preprint [[http://​arxiv.org/​abs/​1708.02772|arXiv:​1708.02772]]) \\ Nils Kriege, Florian Kurpicz, Petra Mutzel \\ European Journal on Combinatorics (EJC), vol. 68, 79-95, 2018.   * **[[https://​doi.org/​10.1016/​j.ejc.2017.07.012|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** (Preprint [[http://​arxiv.org/​abs/​1708.02772|arXiv:​1708.02772]]) \\ Nils Kriege, Florian Kurpicz, Petra Mutzel \\ European Journal on Combinatorics (EJC), vol. 68, 79-95, 2018.
  
Line 110: 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: 2018-05-12 00:27 by Nils Kriege
DokuWikiRSS-Feed