Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:dahn [2018-11-06 09:59] |
staff:dahn [2018-11-29 15:54] |
||
---|---|---|---|
Line 20: | Line 20: | ||
* **Sprechstunde:** montags 14-15 Uhr | * **Sprechstunde:** montags 14-15 Uhr | ||
- | * Die Sprechstunde am 5.11.18 fällt aus. | ||
=== aktuelle Lehrveranstaltungen === | === aktuelle Lehrveranstaltungen === | ||
Line 35: | Line 34: | ||
* **Wintersemester 2017/18** | * **Wintersemester 2017/18** | ||
* [[http://www.cs.tu-dortmund.de/nps/de/Studium/HelpCenter/PLT_MafI1/index.html|MafI1 PowerLerntage]] zu Mathematik für Informatiker 1 | * [[http://www.cs.tu-dortmund.de/nps/de/Studium/HelpCenter/PLT_MafI1/index.html|MafI1 PowerLerntage]] zu Mathematik für Informatiker 1 | ||
+ | */ | ||
=== betreute Abschlussarbeiten === | === betreute Abschlussarbeiten === | ||
Line 44: | Line 43: | ||
/* | /* | ||
=== Journal Articles === | === Journal Articles === | ||
+ | * Joachim Biskup, Christine Dahn, Katharina Diekmann, Ralf Menzel, Dirk Schalge, Lena Wiese. //[[https://www.sciencedirect.com/science/article/pii/S0169023X18301551|Publishing inference-proof relational data: An implementation and experiments has just been published in Data and Knowledge Engineering]]//.\\ Data & Knowledge Engineering (2018). In Press, Accepted Manuscript, Available online 22 November 2018.\\ | ||
*/ | */ | ||
Line 57: | Line 56: | ||
=== Preprints === | === Preprints === | ||
- | * Christine Dahn, Nils M. Kriege, Petra Mutzel. //[[https://arxiv.org/abs/1803.10983|A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs]]//. CoRR [[http://arxiv.org/abs/1803.10983|abs/1803.10983]] (2018). | + | * Christine Dahn, Nils M. Kriege, Petra Mutzel. //[[https://arxiv.org/abs/1803.10983|A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs]]//.\\ CoRR [[http://arxiv.org/abs/1803.10983|abs/1803.10983]] (2018). |
=== Theses === | === Theses === | ||
* Christine Dahn, //Entwicklung eines MAX-CUT-Algorithmus für fast-planare Graphen//. Master Thesis, TU Dortmund (September 2017). | * Christine Dahn, //Entwicklung eines MAX-CUT-Algorithmus für fast-planare Graphen//. Master Thesis, TU Dortmund (September 2017). | ||
- | * Christine Dahn, //Graphdatenbanken: Das Containment-Problem für C2RPQs//. Bachelor Thesis, TU Dortmund (October 2013). | + | * Christine Dahn, //Graphdatenbanken: Das Containment-Problem für C2RPQs//. Bachelor Thesis, TU Dortmund (Oktober 2013). |
===== Conferences/Meetings/Workshops Attended ===== | ===== Conferences/Meetings/Workshops Attended ===== |