Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
staff:droschinsky [2019-03-27 14:47]
Andre Droschinsky [Teaching (in German)]
staff:droschinsky [2019-10-10 12:25] (current)
Andre Droschinsky [Refereed Conference Proceedings]
Line 9: Line 9:
  
 ==== Research Interests ==== ==== Research Interests ====
-  * Enumeration algorithms on graphs 
   * Maximum common subgraph problems   * Maximum common subgraph problems
 +  * Matching problems
 +  * Enumeration algorithms on graphs
   * Reachability queries   * Reachability queries
   * My Erdős number is at most 4 (via Petra Mutzel -> Peter Eades ->  Michel-Marie Deza -> P. Erdős)   * My Erdős number is at most 4 (via Petra Mutzel -> Peter Eades ->  Michel-Marie Deza -> P. Erdős)
Line 16: Line 17:
 ==== Teaching (in German) ==== ==== Teaching (in German) ====
 == Lehrveranstaltungen == == Lehrveranstaltungen ==
 +
 +  * Wintersemester 2019/20
 +    * [[:​teaching:​aud-uebung-ws2019 | Algorithmen und Datenstrukturen (Übung)]]
 +
   * Sommersemester 2019   * Sommersemester 2019
     * [[:​staff:​droschinsky:​ea-ueb-2019 | Effiziente Algorithmen (Übung)]]     * [[:​staff:​droschinsky:​ea-ueb-2019 | Effiziente Algorithmen (Übung)]]
Line 64: Line 69:
   * **Erik Thordsen**: //Ein neuer Algorithmus zur Lösung des Maximum Matching Problems auf nicht-bipartiten Graphen//, Masterarbeit,​ 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   * **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 ==== ==== Journal Articles ====
  
Line 70: Line 75:
  
 ==== Refereed Conference Proceedings ==== ==== 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.   * **[[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.
  
 
Last modified: 2019-03-27 14:47 by Andre Droschinsky
DokuWikiRSS-Feed