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:19] |
staff:dahn [2018-08-09 17:10] |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| * 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) ===== | ||
| Line 33: | Line 33: | ||
| */ | */ | ||
| ===== 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 === | ||
| + | |||
| + | */ | ||
| === 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/Workshops 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 Jun 2018, Cottbus/Lübbenau, Germany: **[[https://www.wg2018.b-tu.de/|44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018)]]** (student) | + | === Theses === |
| + | * 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). | ||
| - | * 16-19 Jul 2018, Singapore, Singapore: **[[http://www.comp.nus.edu.sg/~iwoca18/|International Workshop on Combinatorial Algorithms (IWOCA 2018)]]** (participant) | + | ===== 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 Aug 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) ===== | ||