Differences
This shows you the differences between two versions of the page.
|
staff:droschinsky [2019-03-27 14:47] |
staff:droschinsky [2019-08-14 14:28] |
||
|---|---|---|---|
| Line 64: | Line 64: | ||
| * **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 70: | ||
| ==== Refereed Conference Proceedings ==== | ==== Refereed Conference Proceedings ==== | ||
| + | * ** 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://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. | ||