Differences
This shows you the differences between two versions of the page.
| — |
staff:droschinsky [2019-10-10 12:25] (current) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ==== Andre Droschinsky ==== | ||
| + | |||
| + | |||
| + | | Room: | 242 | | ||
| + | | Phone: | +49 231 755-7741 | | ||
| + | | Fax: | +49 231 755 7740 | | ||
| + | | E-Mail: | vorname.nachname{{:staff:at.gif|}}tu-dortmund.de| | ||
| + | | Office hours: | by appointment via e-mail | | ||
| + | |||
| + | ==== Research Interests ==== | ||
| + | * Maximum common subgraph problems | ||
| + | * Matching problems | ||
| + | * Enumeration algorithms on graphs | ||
| + | * 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 == | ||
| + | |||
| + | * Wintersemester 2019/20 | ||
| + | * [[:teaching:aud-uebung-ws2019 | Algorithmen und Datenstrukturen (Übung)]] | ||
| + | |||
| + | * Sommersemester 2019 | ||
| + | * [[:staff:droschinsky:ea-ueb-2019 | Effiziente Algorithmen (Übung)]] | ||
| + | * [[:staff:mutzel:prosemgraphalg | Proseminar Graph-Algorithmen ]] | ||
| + | |||
| + | * Wintersemester 2018/19 | ||
| + | * [[:teaching:ep1819uebung | Einführung in die Programmierung (Übung)]] | ||
| + | |||
| + | * Sommersemester 2018 | ||
| + | * [[:staff:droschinsky:ea-ueb-2018 | Effiziente Algorithmen (Übung)]] | ||
| + | * [[:teaching:seminarae-ss2018 | Seminar Algorithm Engineering]] | ||
| + | |||
| + | * Wintersemester 2017/18 | ||
| + | * [[:teaching:ep1718uebung | Einführung in die Programmierung (Übung)]] | ||
| + | * [[:teaching:seminarae-ws2017 | Seminar Algorithm Engineering]] | ||
| + | |||
| + | * Sommersemester 2017 | ||
| + | * [[:staff:droschinsky:ea-ueb-2017 | Effiziente Algorithmen (Übung)]] | ||
| + | * [[:teaching:seminarae-ss2017 | Seminar Algorithm Engineering]] | ||
| + | |||
| + | * Wintersemester 2016/17 | ||
| + | * [[:staff:mutzel:aud-uebung-1617 | Algorithmen und Datenstrukturen (Übung)]] | ||
| + | * [[:staff:mutzel:prosemunplugged | Proseminar Algorithms Unplugged]] | ||
| + | |||
| + | * Sommersemester 2016 | ||
| + | * [[:staff:droschinsky:ea-ueb-2016 | Effiziente Algorithmen (Übung)]] | ||
| + | * [[:teaching:seminarae-ss2016 | Seminar Algorithm Engineering]] | ||
| + | |||
| + | * Wintersemester 2015/16 | ||
| + | * [[:teaching:ep1516uebung | Einführung in die Programmierung (Übung)]] | ||
| + | * [[:teaching:seminarae-ws2015 | Seminar Algorithm Engineering]] | ||
| + | |||
| + | * Sommersemester 2015 | ||
| + | * [[:staff:droschinsky:ea-ueb-2015 | Effiziente Algorithmen (Übung)]] | ||
| + | * [[:teaching:seminarae-ss2015 | Seminar Algorithm Engineering]] | ||
| + | |||
| + | * Wintersemester 2014/15 | ||
| + | * [[:staff:mutzel:aud-uebung-1415 | Algorithmen und Datenstrukturen (Übung)]] | ||
| + | * [[:teaching:seminarae-ws2014 | Seminar Algorithm Engineering]] | ||
| + | |||
| + | == 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 | ||
| + | * **Anisa Kusumadewi**: //Popularität In Bipartiten Matchings Unter Beidseitigen Präferenzen//, Bachelorarbeit, 2019 | ||
| + | * **Christian Bohr**: //Effiziente Matching-Algorithmen für Big-Data-Graphen im Datenstrom-Modell//, Masterarbeit, 2019 | ||
| + | ==== Journal Articles ==== | ||
| + | |||
| + | * **[[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), accepted for publication. | ||
| + | |||
| + | ==== Refereed Conference Proceedings ==== | ||
| + | * ** Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach ** \\ // Erik Thordsen, Andre Droschinsky, and Petra Mutzel // \\ SIAM Symposium on Algorithm Engineering and Experiments (ALENEX20), 2020, to appear | ||
| + | |||
| + | * ** On the Time Complexity of Simple Cartesian Genetic Programming ** \\ // Roman Kalkreuth and Andre Droschinsky // \\ Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019), 2019, Vienna (Austria) \\ **Best Poster Nomination** | ||
| + | |||
| + | * ** [[http://jgaa.info/accepted/2018/480.pdf|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]] ** \\ // Nils Kriege, Andre Droschinsky, Petra Mutzel // \\ Journal of Graph Algorithms and Applications, 2018 | ||
| + | |||
| + | * **[[http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9636|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. | ||
| + | |||
| + | * **[[https://link.springer.com/chapter/10.1007/978-3-319-55696-3_19|A New Subgraph Crossover for Cartesian Genetic Programming]]** \\ //Roman Kalkreuth, Günter Rudolph, Andre Droschinsky// \\ 20th European Conference on Genetic Programming (EuroGP) 2017 | ||
| + | |||
| + | * **[[http://link.springer.com/chapter/10.1007/978-3-319-51963-0_24|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 \\ {{ :staff:droschinsky:slides_sofsem.pdf | Animated presentation slides}} | ||
| + | |||
| + | * **[[http://drops.dagstuhl.de/opus/volltexte/2016/6447/|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. \\ {{ :staff:droschinsky:slides_-_mfcs.pdf | Animated presentation slides}} | ||
| + | |||
| + | |||
| + | * **[[http://link.springer.com/chapter/10.1007%2F978-3-319-13075-0_7|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 ([[http://link.springer.com/export-citation/chapter/10.1007/978-3-319-13075-0_7.bib|BIBTEX]]) | ||
| + | |||
| + | === Technical Reports === | ||
| + | * **[[https://ls11-www.cs.uni-dortmund.de/_media/techreports/tr14-02.pdf|Effiziente Enumerationsalgorithmen für Common Subtree Probleme]]** \\ //Andre Droschinsky// \\ in: Algorithm Engineering Reports, TR14-1-002, Fakultät für Informatik, TU Dortmund, 2014. | ||
| + | |||