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-12-05 15:12]
Nils Kriege [Publications]
staff:kriege [2019-03-19 08:53] (current)
Nils Kriege [Publications]
Line 92: Line 92:
  
 === Preprints === === Preprints ===
 +  * **[[https://​arxiv.org/​abs/​1903.06061|Maximum Cut Parameterized by Crossing Number]]** \\ Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke,​ Nils M. Kriege, Petra Mutzel, Alexander Nover, ''​arXiv:​1903.06061''​.
 +
 +  * **[[https://​arxiv.org/​abs/​1901.10356|Computing Optimal Assignments in Linear Time for Graph Matching]]** \\ Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson, ''​arXiv:​1901.10356''​.
 +
 +  * **[[https://​arxiv.org/​abs/​1812.03074|Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs]]** \\ Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling, ''​arXiv:​1812.03074''​.
 +
   * **[[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.
  
   * **[[https://​arxiv.org/​abs/​1703.00676|A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels]]** \\ Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel, ''​arXiv:​1703.00676''​.   * **[[https://​arxiv.org/​abs/​1703.00676|A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels]]** \\ Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel, ''​arXiv:​1703.00676''​.
- 
-  * **[[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 === === Journal Articles ===
-  * **A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs** (Preprint [[https://​arxiv.org/​abs/​1805.10754|arXiv:​1805.10754]]) \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel \\ Journal of Graph Algorithms and Applications (JGAA), ​accepted for publication.+  * **[[https://​doi.org/​10.1007/​s00453-019-00552-1|A general purpose algorithm for counting simple cycles and simple paths of any length]]** (Preprint [[https://​arxiv.org/​abs/​1612.05531|arXiv:​1612.05531]]) \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson \\ Algorithmica,​ 2019. 
 + 
 +  * **[[http://​dx.doi.org/​10.7155/​jgaa.00480|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** (Preprint [[https://​arxiv.org/​abs/​1805.10754|arXiv:​1805.10754]]) \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel \\ Journal of Graph Algorithms and Applications (JGAA), ​vol. 22, no. 4, 607-616, 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.   * **[[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 111: Line 117:
  
 === Refereed Conference Proceedings === === Refereed Conference Proceedings ===
 +  * **Deep Weisfeiler-Lehman Assignment Kernels via Multiple Kernel Learning** \\ Nils M. Kriege \\ European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN) 2019, accepted for publication.
 +
   * **[[http://​dx.doi.org/​10.4230/​LIPIcs.MFCS.2018.54|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, 54:1-54:15.   * **[[http://​dx.doi.org/​10.4230/​LIPIcs.MFCS.2018.54|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, 54:1-54:15.
  
 
Last modified: 2018-12-05 15:12 by Nils Kriege
DokuWikiRSS-Feed