Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision Last revision Both sides next revision | ||
|
staff:kriege [2019-07-02 17:28] |
staff:kriege [2020-07-17 11:42] Nils Kriege [Publications] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| ==== Nils Kriege ==== | ==== 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 | | | Phone: | +49 231 755-7737 | | ||
| | Fax: | +49 231 755 7740 | | | Fax: | +49 231 755 7740 | | ||
| Line 17: | Line 22: | ||
| ===== Teaching (in German) ===== | ===== Teaching (in German) ===== | ||
| == Lehrveranstaltung == | == 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** | * **Sommersemester 2019** | ||
| * [[teaching:dap2_ss19_praktikum|Programmierpraktikum]] zu [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2019/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]] | * [[teaching:dap2_ss19_praktikum|Programmierpraktikum]] zu [[http://ls2-www.cs.tu-dortmund.de/lehre/sommer2019/dap2/|Datenstrukturen, Algorithmen und Programmierung 2]] | ||
| Line 65: | Line 74: | ||
| == Betreute studentische Arbeiten == | == 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. | * **Frederik Stehli**: //Approximation des Optimal Assignment Kernels durch explizite Merkmalsvektoren//, Bachelorarbeit, 2019. | ||
| * **Dmytro Semenchenko**: //Approximating the Graph Edit Distance via Deep Learning//, Bachelorarbeit, 2019. | * **Dmytro Semenchenko**: //Approximating the Graph Edit Distance via Deep Learning//, Bachelorarbeit, 2019. | ||
| Line 97: | Line 109: | ||
| === Preprints === | === Preprints === | ||
| - | * **[[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/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/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''. | + | === Journal Articles === |
| - | * **[[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''. | + | * **Classifying Dissemination Processes in Temporal Graphs**\\ Lutz Oettershagen, Nils M. Kriege, Christopher Morris, and Petra Mutzel \\ Big Data, 2020, accepted for publication. |
| - | * **[[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''. | + | * **[[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. | ||
| - | === 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. | * **[[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. | ||
| Line 122: | Line 135: | ||
| === 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://grlplus.github.io/papers/79.pdf|TUDataset: A collection of benchmark datasets for learning with graphs]]** ([[https://github.com/chrsmrrs/tudataset|Source code]]) \\ Christopher Morris, Nils M. Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, Marion Neumann \\ ICML 2020 Workshop on Graph Representation Learning and Beyond (GRL+), 2020 |
| + | |||
| + | * **[[https://openreview.net/forum?id=HyeJf1HKvS|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. | ||
| + | |||
| + | * **[[https://doi.org/10.1137/1.9781611976236.56|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]]** \\ 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. | ||
| Line 166: | Line 187: | ||
| * **[[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.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 === | === Book Chapters === | ||