Differences

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

Link to this comparison view

staff:oettershagen [2019-10-07 10:01] (current)
Line 1: Line 1:
 +====== Lutz Oettershagen ======
 +| Room:   | 233 |
 +| Phone: ​ | +49 231 755-7704 |
 +| Fax:    | +49 231 755-7740 |
 +| E-Mail: | lutz.oettershagen{{:​staff:​at.gif|}}tu-dortmund.de|
 +
 +<WRAP important 30%>
 +This page is outdated!
 +
 +I moved to **[[https://​ca.cs.uni-bonn.de/​doku.php?​id=oettershagen|University of Bonn]]** .
 +</​WRAP>​
 +===== Publications =====
 +
 +
 +======= Refereed Conference Articles =======
 +  * **On the Enumeration of Bicriteria Temporal Paths** ​ (Preprint ''​[[https://​arxiv.org/​abs/​1812.02507|arXiv:​1812.02507]]''​) \\ [[staff:​mutzel|Petra Mutzel]], Lutz Oettershagen. \\ // [[http://​www.f.waseda.jp/​watada/​TAMC2019/​|Theory and Applications of Models of Computation (TAMC) 2019]].//
 +
 +
 +  * **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]].//
 +
 +/*  * **[[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.
 +  * **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.
 +
 +/*
 +=== Journal Articles ===
 +=== Refereed Conference Proceedings ===
 +=== Posters ===
 +=== Technical Reports ===
 +*/
 +
 +===== Teaching (in German) =====
 +======= Lehrveranstaltungen =======  ​
 +  * **Sommersemester 2019**
 +    * [[https://​moodle.tu-dortmund.de/​course/​view.php?​id=15827|Softwaretechnik]] (Übung)
 +    * [[https://​ls11-www.cs.tu-dortmund.de/​staff/​mutzel/​prosemgraphalg|Proseminar Graphalgorithmen]]
 +
 +  * **Wintersemester 2018/2019 **
 +    * [[https://​ls11-www.cs.tu-dortmund.de/​teaching/​ep1819uebung|Einführung in die Programmierung (Übung)]]
 +
 +  * **Sommersemester 2018**
 +    * [[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)**
 +    * Einführung in die Programmierung (Praktikum)
 +
 +  * **Sommersemester 2017**
 +    * Effiziente Algorithmen (Übung)
 +
 +
  
 
Last modified: 2019-10-07 10:01 (external edit)
DokuWikiRSS-Feed