This is an old revision of the document!
Table of Contents
Andre Droschinsky
| Room: | 242 |
| Phone: | +49 231 755-7741 |
| Fax: | +49 231 755 7740 |
| E-Mail: | vorname.nachname tu-dortmund.de |
| Office hours: | by appointment via e-mail |
Research Interests
- Enumeration algorithms on graphs
- Maximum common subgraph problems
- Reachability queries
- My Erdős number is at most 4 (via Petra Mutzel → Peter Eades → Michel-Marie Deza → P. Erdős)
Teaching (in German)
Lehrveranstaltungen
- Sommersemester 2018
- Wintersemester 2017/18
- Sommersemester 2017
- Wintersemester 2016/17
- Sommersemester 2016
- Wintersemester 2015/16
- Sommersemester 2015
- Wintersemester 2014/15
Betreute studentische Arbeiten
- Robert Kramer: Algorithmen für gerichtetes Matching in Graphen, Bachelorarbeit, 2016
- Dennis Misera: Berechnung gewichtsmaximaler 2-zuammenhängender gemeinsamer Subgraphen von außenplanaren Graphen, Bachelorarbeit, 2017
- Martin Rentz: Approximative Algorithmen für das Assignment-Problem mit Hilfe von hierarchischem Clustering, Bachelorarbeit, 2017
- Kevin Nikiel: Effiziente Algorithmen für größte gemeinsame Teilgraphen zwischen Molekülen unter Berücksichtigung von Bioisosteren, Masterarbeit, 2017
- Hermann Foot: Evaluierung von Algorithmen zur Berechnung gerichteter Matchings, Bachelorarbeit, 2017
- Fabian Eckey: Implementierung und Evaluation eines Algorithmus zur Berechnung eines kostenminimalen Matchings vorgegebener Kardinalität in unausgeglichenen gewichteten bipartiten Graphen, Bachelorarbeit, 2018
- Erik Thordsen: Ein neuer Algorithmus zur Lösung des Maximum Matching Problems auf nicht-bipartiten Graphen, Masterarbeit, 2018
Journal Articles
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Preprint arXiv:1805.10754)
Nils M. Kriege, Andre Droschinsky, Petra Mutzel
Journal of Graph Algorithms and Applications (JGAA), accepted for publication.
Refereed Conference Proceedings
- Largest Weight Common Subtree Embeddings with Distance Penalties
Andre Droschinsky, Nils Kriege, Petra Mutzel
International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, 54:1-54:15.
- A New Subgraph Crossover for Cartesian Genetic Programming
Roman Kalkreuth, Günter Rudolph, Andre Droschinsky
20th European Conference on Genetic Programming (EuroGP) 2017
- Finding Largest Common Substructures of Molecules in Quadratic Time
Andre Droschinsky, Nils Kriege, Petra Mutzel
43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM-FOCS) 2017
Animated presentation slides
- Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
International Symposium on Mathematical Foundations of Computer Science (MFCS) 2016, 33:1-33:14.
Animated presentation slides
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay
Andre Droschinsky, Bernhard Heinemann, Nils Kriege, Petra Mutzel
The 25th International Symposium on Algorithms and Computation (ISAAC) 2014, LNCS 8889, pp. 81–93, 2014 (BIBTEX)
Technical Reports
- Effiziente Enumerationsalgorithmen für Common Subtree Probleme
Andre Droschinsky
in: Algorithm Engineering Reports, TR14-1-002, Fakultät für Informatik, TU Dortmund, 2014.