Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Previous revision
staff:kriege [2018-05-12 00:27]
staff:kriege [2018-12-19 15:32]
Line 17: Line 17:
 ===== Teaching (in German) ===== ===== Teaching (in German) =====
 == Lehrveranstaltung == == Lehrveranstaltung ==
 +  * **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**   * **Sommersemester 2018**
     * [[teaching:​dap2_ss18_praktikum|Programmierpraktikum]] zu [[http://​ls2-www.cs.tu-dortmund.de/​lehre/​sommer2018/​dap2/​|Datenstrukturen,​ Algorithmen und Programmierung 2]]     * [[teaching:​dap2_ss18_praktikum|Programmierpraktikum]] zu [[http://​ls2-www.cs.tu-dortmund.de/​lehre/​sommer2018/​dap2/​|Datenstrukturen,​ Algorithmen und Programmierung 2]]
Line 90: Line 92:
  
 === Preprints === === Preprints ===
-  * **[[https://​arxiv.org/​abs/​1805.00821|Largest Weight Common Subtree Embeddings with Distance Penalties]]** \\ Andre Droschinsky, Nils M. Kriege, Petra Mutzel, ''​arXiv:​1805.00821''​.+  * **[[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.
Line 97: Line 99:
  
   * **[[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/​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 ===
-  * **Erratum to: A polynomial-time maximum common subgraph ​algorithm ​for outerplanar graphs ​and its application to chemoinformatics** \\ Nils M. Kriege, Andre Droschinsky,​ Petra Mutzel \\ Annals ​of Mathematics ​and Artificial Intelligence2018under review.+  * **[[http://​dx.doi.org/​10.7155/​jgaa.00480|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. 22no. 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 110: Line 113:
  
 === Refereed Conference Proceedings === === Refereed Conference Proceedings ===
-  * **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, accepted.+  * **[[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.
  
-  * **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.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.
  
-  * **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.+  * **[[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. 
 + 
 +  * **[[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.   * **[[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 154:
  
   * **[[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.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.
 +
 +=== 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 === === Posters ===
Line 162: Line 170:
  
 === Technical Reports === === 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 === ===  Theses ===
 
Last modified: 2020-07-20 10:01 by Nils Kriege
DokuWikiRSS-Feed