Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Previous revision | ||
staff:dahn [2018-07-06 15:13] |
staff:dahn [2018-11-29 15:54] |
||
---|---|---|---|
Line 12: | Line 12: | ||
* graph algorithms | * graph algorithms | ||
* 1-planar graphs | * 1-planar graphs | ||
+ | * maximum cut on k-planar graphs | ||
* problems related to the crossing number | * problems related to the crossing number | ||
* fixed-parameter tractability | * fixed-parameter tractability | ||
+ | My ORCID ID is [[ https://orcid.org/0000-0003-0609-176X| 0000-0003-0609-176X]] | ||
===== Lehre (Teaching) ===== | ===== Lehre (Teaching) ===== | ||
+ | |||
+ | * **Sprechstunde:** montags 14-15 Uhr | ||
=== aktuelle Lehrveranstaltungen === | === aktuelle Lehrveranstaltungen === | ||
+ | * **Wintersemester 2018/19** | ||
+ | * [[https://moodle.tu-dortmund.de/course/view.php?id=13350|Übung zu Mathematik für Informatiker 1]] ([[http://ls5-www.cs.tu-dortmund.de/cms/de/lehre/lehrveranstaltungen/ws2018-19/Mathematik_f__r_Informatiker_1/index.shtml|Link zur Vorlesungswebsite]]) | ||
+ | |||
+ | /* | ||
* **Sommersemester 2018** | * **Sommersemester 2018** | ||
* [[https://moodle.tu-dortmund.de/course/view.php?id=11094|Übung zu Mathematik für Informatiker 2]] ([[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ss/mathe2/index.html|Link zur Vorlesungswebsite]]) | * [[https://moodle.tu-dortmund.de/course/view.php?id=11094|Übung zu Mathematik für Informatiker 2]] ([[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ss/mathe2/index.html|Link zur Vorlesungswebsite]]) | ||
* [[https://ls11-www.cs.tu-dortmund.de/teaching/seminarae-ss2018|Seminar Algorithm Engineering]] | * [[https://ls11-www.cs.tu-dortmund.de/teaching/seminarae-ss2018|Seminar Algorithm Engineering]] | ||
- | /* | ||
=== aktuelle Workshops === | === aktuelle Workshops === | ||
* **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 === | ||
+ | * **Julian Schilling:** //Parameterized Max-Cut on 1-planar Graphs//, Masterarbeit /* , 2019 | ||
*/ | */ | ||
===== Publications ===== | ===== Publications ===== | ||
- | |||
- | === Preprints === | ||
- | * **[[https://arxiv.org/abs/1803.10983|A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs]]**\\ Christine Dahn, Nils M. Kriege, Petra Mutzel; arXiv:1803.10983. | ||
/* | /* | ||
=== 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.\\ | ||
+ | */ | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
+ | * Christine Dahn, Nils M. Kriege, Petra Mutzel. //[[https://link.springer.com/chapter/10.1007%2F978-3-319-94667-2_12|A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs]]//.\\ In: Iliopoulos C., Leong H., Sung WK. (eds) Combinatorial Algorithms. IWOCA 2018. Lecture Notes in Computer Science, vol 10979. Springer, Cham (2018).\\ | ||
+ | /* | ||
=== Posters === | === Posters === | ||
=== Technical Reports === | === Technical Reports === | ||
*/ | */ | ||
- | === Theses === | ||
- | * **Entwicklung eines MAX-CUT-Algorithmus für fast-planare Graphen** \\ Christine Dahn \\ Master Thesis, TU Dortmund, September 2017. | ||
- | * **Graphdatenbanken: Das Containment-Problem für C2RPQs** \\ Christine Dahn \\ Bachelor Thesis, TU Dortmund, October 2013. | ||
- | ===== Conferences/Meetings Attended ===== | + | === 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). | ||
- | * 27-29 June 2018, Cottbus/Lübbenau, Germany: **[[https://www.wg2018.b-tu.de/|44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018)]]** | + | === Theses === |
- | + | * Christine Dahn, //Entwicklung eines MAX-CUT-Algorithmus für fast-planare Graphen//. Master Thesis, TU Dortmund (September 2017). | |
- | * 16-19 July 2018, Singapore, Singapore: **[[http://www.comp.nus.edu.sg/~iwoca18/|International Workshop on Combinatorial Algorithms (IWOCA 2018)]]** | + | * Christine Dahn, //Graphdatenbanken: Das Containment-Problem für C2RPQs//. Bachelor Thesis, TU Dortmund (Oktober 2013). |
+ | ===== Conferences/Meetings/Workshops Attended ===== | ||
* 21-24 August 2018, Chemnitz, Germany: **[[https://www.tu-chemnitz.de/mathematik/discrete/frico2018/index.php|22nd Workshop on Future Research in Combinatorial Optimization (FRICO 2018)]]** | * 21-24 August 2018, Chemnitz, Germany: **[[https://www.tu-chemnitz.de/mathematik/discrete/frico2018/index.php|22nd Workshop on Future Research in Combinatorial Optimization (FRICO 2018)]]** | ||
+ | * 16-19 July 2018, Singapore, Singapore: **[[http://www.comp.nus.edu.sg/~iwoca18/|International Workshop on Combinatorial Algorithms (IWOCA 2018)]]** (participant) | ||
+ | |||
+ | * 27-29 June 2018, Cottbus/Lübbenau, Germany: **[[https://www.wg2018.b-tu.de/|44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018)]]** (student) | ||
===== Lehre-Archiv (Teaching-History) ===== | ===== Lehre-Archiv (Teaching-History) ===== | ||
Line 73: | Line 83: | ||
* **Wintersemester 2013/14** | * **Wintersemester 2013/14** | ||
- | * Mathe-Power-Lerntage zu Mathematik für Informatik 1 | + | * Mathe-Power-Lerntage zu Mathematik für Informatik 1 ([[http://landarzar.net/wp-content/uploads/2013/07/HOWTOProof.pdf|Hinweise zum Mathematik lernen]]) |
* **Sommersemester 2012** | * **Sommersemester 2012** | ||
Line 79: | Line 89: | ||
=== Lehrveranstaltungen === | === Lehrveranstaltungen === | ||
+ | |||
+ | * **Sommersemester 2018** | ||
+ | * [[https://moodle.tu-dortmund.de/course/view.php?id=11094|Übung zu Mathematik für Informatiker 2]] ([[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2018_ss/mathe2/index.html|Link zur Vorlesungswebsite]]) | ||
+ | * [[https://ls11-www.cs.tu-dortmund.de/teaching/seminarae-ss2018|Seminar Algorithm Engineering]] | ||
* **Wintersemester 2013/14** | * **Wintersemester 2013/14** |