Differences
This shows you the differences between two versions of the page.
staff:oettershagen [2018-04-09 09:49] |
staff:oettershagen [2018-12-07 15:54] |
||
---|---|---|---|
Line 8: | Line 8: | ||
===== Publications ===== | ===== Publications ===== | ||
- | === Preprints === | + | ======= Preprints ======= |
- | /* * **The Crossing Number of Seq-Shellable Drawings of Complete Graphs** (Preprint ''[[https://arxiv.org/abs/1803.07515|arXiv:1803.07515]]'') \\ [[staff:mutzel|Petra Mutzel]], Lutz Oettershagen.*/ | + | * **[[https://arxiv.org/abs/1805.06780|On the Enumeration of Bicriteria Temporal Paths]]** \\ [[staff:mutzel|Petra Mutzel]], Lutz Oettershagen, ''arXiv:1812.02507''.\\ |
- | * **[[https://arxiv.org/abs/1803.07515|The Crossing Number of Seq-Shellable Drawings of Complete Graphs]]** \\ [[staff:mutzel|Petra Mutzel]], Lutz Oettershagen. | + | |
+ | ======= Refereed Conference Articles ======= | ||
+ | * **The Crossing Number of Semi-Pair-Seq-Shellable Drawings of Complete Graphs** (Preprint ''[[https://arxiv.org/abs/1805.06780|arXiv:1805.06780]]'') \\ [[staff:mutzel|Petra Mutzel]], Lutz Oettershagen. \\ // [[http://www.cs.umanitoba.ca/~cccg2018/|Canadian Conference on Computational Geometry (CCCG) 2018]].// | ||
- | === Theses === | + | /* * **[[https://arxiv.org/abs/1803.07515|The Crossing Number of Semi-Pair-Seq-Shellable Drawings of Complete Graphs]]** \\ [[staff:mutzel|Petra Mutzel]], Lutz Oettershagen. */ |
+ | |||
+ | * **The Crossing Number of Seq-Shellable Drawings of Complete Graphs** (Preprint ''[[https://arxiv.org/abs/1803.07515|arXiv:1803.07515]]'') \\ [[staff:mutzel|Petra Mutzel]], Lutz Oettershagen. \\ // [[https://www.comp.nus.edu.sg/~iwoca18/|International Workshop on Combinatorial Algorithms (IWOCA) 2018]].// | ||
+ | |||
+ | /* * **[[https://arxiv.org/abs/1803.07515|The Crossing Number of Seq-Shellable Drawings of Complete Graphs]]** \\ [[staff:mutzel|Petra Mutzel]], Lutz Oettershagen. */ | ||
+ | |||
+ | |||
+ | /* === Preprints === */ | ||
+ | |||
+ | ======= Theses ======= | ||
* **On the Crossing Number of Almost Bishellable Drawings of Complete Graps** \\ Master Thesis, TU Dortmund, December 2017. | * **On the Crossing Number of Almost Bishellable Drawings of Complete Graps** \\ Master Thesis, TU Dortmund, December 2017. | ||
* **Konzeption und Realisierung einer prototypischen EFA-Komponente zur Abbildung von EFA Metadaten auf Event Logs unter Verwendung des XES Standards** \\ Bachelor Thesis, TU Dortmund and Fraunhofer-Institut für Software-und Systemtechnik ISST, May 2014. | * **Konzeption und Realisierung einer prototypischen EFA-Komponente zur Abbildung von EFA Metadaten auf Event Logs unter Verwendung des XES Standards** \\ Bachelor Thesis, TU Dortmund and Fraunhofer-Institut für Software-und Systemtechnik ISST, May 2014. | ||
Line 24: | Line 34: | ||
*/ | */ | ||
- | ==== Teaching (in German) ==== | + | ===== Teaching (in German) ===== |
- | == Lehrveranstaltungen == | + | ======= Lehrveranstaltungen ======= |
+ | |||
+ | * **Wintersemester 2018/2019 ** | ||
+ | * [[https://ls11-www.cs.tu-dortmund.de/teaching/ep1819uebung|Einführung in die Programmierung (Übung)]] | ||
* **Sommersemester 2018** | * **Sommersemester 2018** | ||
* [[https://ls1-www.cs.tu-dortmund.de/de/lehrveranstaltungen-logidac/grundbegriffe-der-theoretischen-informatik|Grundbegriffe der Theoretischen Informatik]] (Übung) | * [[https://ls1-www.cs.tu-dortmund.de/de/lehrveranstaltungen-logidac/grundbegriffe-der-theoretischen-informatik|Grundbegriffe der Theoretischen Informatik]] (Übung) | ||
+ | * [[https://ls11-www.cs.tu-dortmund.de/teaching/seminarae-ss2018|Seminar Algorithm Engineering]] | ||
* **Wintersemester 2017/2018 (ab Januar)** | * **Wintersemester 2017/2018 (ab Januar)** |