Differences

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

--- staff:kriege [2018-07-14 07:35]
+++ staff:kriege [2020-07-09 12:23]
Nils Kriege [Publications]
@@ Line 3: / Line 3: @@
 ==== Nils Kriege ====
-| Room: | 237 |
+<WRAP round 30% important>
+I have moved to the \\
+[[https://univie.ac.at|University of Vienna]]
+</WRAP>
+| Room: | 233 |
 | Phone: | +49 231 755-7737 |
 | Fax: | +49 231 755 7740 |
@@ Line 17: / Line 22: @@
 ===== Teaching (in German) =====
 == Lehrveranstaltung ==
+  * **Wintersemester 2019/20**
+    * Vorlesung [[teaching:aud-ws2019|Algorithmen und Datenstrukturen]]
+    * Proseminar [[teaching:proseminar-ads-ws2019|Algorithmic Data Science]]
+    * [[teaching:praesentationskurs-ws2019|Präsentationstechniken für Proseminare]]
+  * **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**
+    * Übung zu [[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ws/rvs/index.html|Rechnernetze und verteilte Systeme]]
   * **Sommersemester 2018**
     * [[teaching:dap2_ss18_praktikum|Programmierpraktikum]] zu [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2018/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]]
@@ Line 60: / Line 74: @@
 == Betreute studentische Arbeiten ==
+  * **Martin Rentz**: //Adaptive Color Refinement for Learning Graph Features//, Masterarbeit, 2020.
+  * **Marvin Büsscher**: //Klassische und numerische Verfahren zur Lösung von Assignment-Problemen//, Masterarbeit, 2020.
+  * **Franka Bause**: //Efficient Approximate k-Nearest-Neighbor-Search In Large Graph Databases//, Masterarbeit, 2020.
+  * **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.
   * **Robert Gehde**: //Erweiterung von Pharmakophor-basierten Fingerprints mittels Randomisierung//, Bachelorarbeit, 2018.
@@ Line 90: / Line 109: @@
 === 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/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''.
-  * **[[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|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** \\ Nils M. Kriege, Andre Droschinsky, Petra Mutzel, ''arXiv:1805.10754''.
+  * **Classifying Dissemination Processes in Temporal Graphs**\\ Lutz Oettershagen, Nils M. Kriege, Christopher Morris, and Petra Mutzel \\ Big Data, 2020, accepted for publication.
+  * **[[http://dx.doi.org/10.7155/jgaa.00523|Maximum Cut Parameterized by Crossing Number]]** (Preprint [[https://arxiv.org/abs/1903.06061|arXiv:1903.06061]]) \\ Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover \\ Journal of Graph Algorithms and Applications (JGAA), vol. 24, no. 3, 155-170, 2020.
+  * **[[https://doi.org/10.1007/s41109-019-0195-3|A Survey on Graph Kernels]]** (Preprint [[https://arxiv.org/abs/1903.11835|arXiv:1903.11835]]) \\ Nils M. Kriege, Fredrik D. Johansson, Christopher Morris \\ Applied Network Science, Machine learning with graphs, 5:6, 2020.
+  * **[[https://doi.org/10.1007/s10618-019-00652-0|A unifying view of explicit and implicit feature maps of graph kernels]]** (Preprint [[https://arxiv.org/abs/1703.00676|arXiv:1703.00676]]) \\ Nils M. Kriege, Marion Neumann, Christopher Morris, Kristian Kersting, Petra Mutzel \\ Data Mining and Knowledge Discovery, 33, 1505-1547, 2019.
+  * **[[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.
-=== 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.
@@ Line 109: / Line 135: @@
 === Refereed Conference Proceedings ===
-  * **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.
+  * **Deep Graph Matching Consensus** (Preprint [[https://arxiv.org/abs/2001.09621|arXiv:2001.09621]], [[https://github.com/rusty1s/deep-graph-matching-consensus|Source code]]) \\ Matthias Fey, Jan E. Lenssen, Christopher Morris, Jonathan Masci, Nils M. Kriege \\ International Conference on Learning Representations (ICLR) 2020, accepted for publication.
+  * **Temporal Graph Kernels for Classifying Dissemination Processes** (Preprint [[https://arxiv.org/abs/1911.05496|arXiv:1911.05496]])\\ Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel \\ SIAM International Conference on Data Mining (SDM) 2020, accepted for publication.
+  * **[[https://doi.org/10.1109/ICDM.2019.00045|Computing Optimal Assignments in Linear Time for Approximate Graph Matching]]** (Preprint [[https://arxiv.org/abs/1901.10356|arXiv:1901.10356]], [[https://github.com/nlskrg/linear_time_assignments_for_graph_matching|Source code]]) \\ Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson \\ International Conference on Data Mining (ICDM) 2019, 349-358.
+  * **[[https://doi.org/10.1007/978-3-030-32047-8_27|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, 308-322.
+  * **[[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.
   * **[[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.
+  * **[[https://doi.org/10.1007/978-3-319-94667-2_12|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, 141-152.
-  * **Recognizing Cuneiform Signs Using Graph Based Methods** (Preprint [[https://arxiv.org/abs/1802.05908|arXiv:1802.05908]]) \\ Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert \\ International Workshop on Cost-Sensitive Learning (COST), SIAM International Conference on Data Mining (SDM) 2018, accepted.
+  * **[[http://proceedings.mlr.press/v88/kriege18a.html|Recognizing Cuneiform Signs Using Graph Based Methods]]** (Preprint [[https://arxiv.org/abs/1802.05908|arXiv:1802.05908]]) \\ Nils M. Kriege, Matthias Fey, Denis Fisseler, Petra Mutzel, Frank Weichert \\ International Workshop on Cost-Sensitive Learning (COST), SIAM International Conference on Data Mining (SDM) 2018, 31-44.
   * **[[https://doi.org/10.1007/978-3-319-71273-4_37|Recent Advances in Kernel-Based Graph Classification]]** \\ Nils M. Kriege, Christopher Morris \\ European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) 2017, 388-392.
@@ Line 149: / Line 185: @@
   * **[[http://dx.doi.org/10.5220/0003836806260635|Scaffold Hunter - Visual Analysis of Chemical Compound Databases]]** \\ Karsten Klein, Nils Kriege, Petra Mutzel \\ International Conference on Information Visualization Theory and Applications (IVAPP) 2012, 626-635, **Best Paper Award**.
-  * **[[http://dx.doi.org/10.1109/ICDE.2011.5767909|CT-Index: Fingerprint-based Graph Indexing Combining Cycles and Trees]]** ([[https://ls11-www.cs.uni-dortmund.de/people/kriege/software/ctindex.zip|Software]])\\ Karsten Klein, Nils Kriege, Petra Mutzel \\ in: Proceedings of the 27th International Conference on Data Engineering (ICDE) 2011, Hannover, Germany, 1115-1126.
+  * **[[http://dx.doi.org/10.1109/ICDE.2011.5767909|CT-Index: Fingerprint-based Graph Indexing Combining Cycles and Trees]]** ([[https://ls11-www.cs.tu-dortmund.de/people/kriege/software/ctindex.zip|Software]])\\ Karsten Klein, Nils Kriege, Petra Mutzel \\ in: Proceedings of the 27th International Conference on Data Engineering (ICDE) 2011, Hannover, Germany, 1115-1126.
+=== Book Chapters ===
+  * **[[https://doi.org/10.1016/B978-0-12-809633-8.20195-7|Chemical similarity and substructure searches]]** \\ Nils M. Kriege, Lina Humbeck, and Oliver Koch \\ Encyclopedia of Bioinformatics and Computational Biology, Academic Press, Oxford, 2019, 640-649.
 === Posters ===
@@ Line 163: / Line 202: @@
 === Technical Reports ===
-  * **[[http://ls11-www.cs.tu-dortmund.de/_media/techreports/tr13-03.pdf|SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search]]** \\ Nils Kriege, Petra Mutzel, Till Schäfer \\ in: Algorithm Engineering Reports, TR13-1-003, Fakultät für Informatik, TU Dortmund, 2013.
+  * **[[http://ls11-www.cs.tu-dortmund.de/_media/techreports/tr13-03.pdf|SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search]]** \\ Nils Kriege, Petra Mutzel, Till Schäfer \\ Algorithm Engineering Reports, TR13-1-003, Fakultät für Informatik, TU Dortmund, 2013.
+  * **[[http://dx.doi.org/10.17877/DE290R-8897|ChemBioSpace Explorer: PG504 Endbericht]]** \\ Adalbert Gorecki, Anke Arndt, Arbia Ben Ahmed, Andre Wiesniewski, Cengizhan Yücel, Gebhard Schrader, Henning Wagner, Michael Rex, Nils Kriege, Philipp Büderbender, Sergej Rakov, Vanessa Bembenek \\  Fakultät für Informatik, TU Dortmund, 2008.
 ===  Theses ===

Chair 11

Teaching

Research Groups

Differences