Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
staff:kriege [2019-08-08 10:13] |
staff:kriege [2019-08-20 08:15] |
||
|---|---|---|---|
| Line 103: | Line 103: | ||
| * **[[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/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://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''. | ||
| Line 125: | Line 123: | ||
| === Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
| + | * **Computing Optimal Assignments in Linear Time for Approximate Graph Matching** (Preprint [[https://arxiv.org/abs/1901.10356|arXiv:1901.10356]]) \\ Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson \\ International Conference on Data Mining (ICDM) 2019, accepted for publication. | ||
| + | |||
| * **Protein Complex Similarity based on Weisfeiler-Lehman labeling** ([[https://doi.org/10.7287/peerj.preprints.26612v1|PeerJ Preprints, vol. 6, e26612v1]]) \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ International Conference on Similarity Search and Applications (SISAP) 2019, accepted for publication. | * **Protein Complex Similarity based on Weisfeiler-Lehman labeling** ([[https://doi.org/10.7287/peerj.preprints.26612v1|PeerJ Preprints, vol. 6, e26612v1]]) \\ Bianca K. Stöcker, Till Schäfer, Petra Mutzel, Johannes Köster, Nils Kriege, Sven Rahmann \\ International Conference on Similarity Search and Applications (SISAP) 2019, accepted for publication. | ||
| - | * **[[https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2019-60.pdf|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. | + | * **[[https://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2019-60.pdf|Deep Weisfeiler-Lehman Assignment Kernels via Multiple Kernel Learning]]** (Preprint [[https://arxiv.org/abs/1908.06661|arXiv:1908.06661]]) \\ Nils M. Kriege \\ European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN) 2019. |
| * **[[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. | ||