Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:kriege [2018-11-27 15:48] |
staff:kriege [2019-07-04 14:28] |
||
---|---|---|---|
Line 17: | Line 17: | ||
===== Teaching (in German) ===== | ===== Teaching (in German) ===== | ||
== Lehrveranstaltung == | == Lehrveranstaltung == | ||
+ | * **Wintersemester 2019/20** | ||
+ | * Proseminar [[teaching:proseminar-ads-ws2019|Algorithmic Data Science]] | ||
+ | * **Sommersemester 2019** | ||
+ | * [[teaching:dap2_ss19_praktikum|Programmierpraktikum]] zu [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2019/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]] | ||
+ | * Proseminar [[staff:mutzel:prosemgraphalg|Graphalgorithmen]] | ||
* **Wintersemester 2018/19** | * **Wintersemester 2018/19** | ||
* Übung zu [[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ws/rvs/index.html|Rechnernetze und verteilte Systeme]] | * Übung zu [[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ws/rvs/index.html|Rechnernetze und verteilte Systeme]] | ||
Line 62: | Line 67: | ||
== Betreute studentische Arbeiten == | == Betreute studentische Arbeiten == | ||
+ | * **Frederik Stehli**: //Approximation des Optimal Assignment Kernels durch explizite Merkmalsvektoren//, Bachelorarbeit, 2019. | ||
+ | * **Dmytro Semenchenko**: //Approximating the Graph Edit Distance via Deep Learning//, Bachelorarbeit, 2019. | ||
* **Mohamad Reza Nirumand Alankesh**: //Extending SplineCNN by Structural Graph Features for Cheminformatics//, Bachelorarbeit, 2018. | * **Mohamad Reza Nirumand Alankesh**: //Extending SplineCNN by Structural Graph Features for Cheminformatics//, Bachelorarbeit, 2018. | ||
* **Robert Gehde**: //Erweiterung von Pharmakophor-basierten Fingerprints mittels Randomisierung//, Bachelorarbeit, 2018. | * **Robert Gehde**: //Erweiterung von Pharmakophor-basierten Fingerprints mittels Randomisierung//, Bachelorarbeit, 2018. | ||
Line 92: | Line 99: | ||
=== Preprints === | === Preprints === | ||
- | * **[[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/1903.11835|A Survey on Graph Kernels]]** \\ Nils M. Kriege, Fredrik D. Johansson, Christopher Morris, ''arXiv:1903.11835''. |
- | * **[[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/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/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/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/1805.10754|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** \\ Nils M. Kriege, Andre Droschinsky, Petra Mutzel, ''arXiv:1805.10754''. | + | * **[[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/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''. | ||
=== Journal Articles === | === Journal Articles === | ||
+ | * **[[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, vol. 81, no. 7, 2716-2737, 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 124: | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
+ | * **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. | ||
+ | |||
* **[[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. | ||