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 [2021-03-10 13:35] (current) Helmut Henning [Christine Dahn] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| ==== Christine Dahn ==== | ==== Christine Dahn ==== | ||
| - | | Room: | OH14 / 234 | | + | | Room: | | |
| - | | Phone: | +49 231 755 7705 | | + | | Phone: | | |
| - | | Fax: | +49 231 755 7740 | | + | | Fax: | | |
| - | | E-Mail: | christine.dahn{{:staff:at.gif|}}cs.tu-dortmund.de| | + | | E-Mail: | christine.dahn{{:staff:at.gif|}}cs.uni-bonn.de| |
| + | **Ab dem 1. Oktober 2019 wechsel ich an die Uni Bonn. Meine [[https://ca.cs.uni-bonn.de/doku.php?id=people:dahn|neue Webseite]] finden sie [[https://ca.cs.uni-bonn.de/doku.php?id=people:dahn|hier]].** | ||
| + | |||
| + | **Starting Oktober 1st 2019 I will be at the University Bonn. My [[https://ca.cs.uni-bonn.de/doku.php?id=people:dahn|new webpage]] is linked [[https://ca.cs.uni-bonn.de/doku.php?id=people:dahn|here]].** | ||
| ===== Research Interests ===== | ===== Research Interests ===== | ||
| * 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:** nach Vereinbarung (nicht in KW 33, 35, 36, 38) | ||
| === aktuelle Lehrveranstaltungen === | === aktuelle Lehrveranstaltungen === | ||
| - | * **Sommersemester 2018** | + | * **Sommersemester 2019** |
| - | * [[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=14966|Übung und Tutorium zu Mathematik für Informatik 2]] ([[http://ls4-www.cs.tu-dortmund.de/cms/de/lehre/2019_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/staff/mutzel/prosemgraphalg|Proseminar Graph-Algorithmen]] |
| /* | /* | ||
| + | * **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]]) | ||
| + | * [[http://www.cs.tu-dortmund.de/nps/de/Studium/HelpCenter/PLT_MafI1/index.html| Mafi 1 PowerLerntage]] | ||
| + | |||
| === 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 |
| + | * **Sven Brümmer:** //Ansätze für paralleles Max-Cut//, 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 === | ||
| + | /* | ||
| + | * Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling. //[[https://arxiv.org/abs/1812.03074|Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs]]//.\\ Theoretical Computer Science [[http://arxiv.org/abs/1812.03074|abs/1812.03074]] (2019). | ||
| + | */ | ||
| + | * Joachim Biskup, Christine Dahn, Katharina Diekmann, Ralf Menzel, Dirk Schalge, Lena Wiese. //[[https://authors.elsevier.com/a/1Ys4a,3rzWhQ5l|Publishing inference-proof relational data: An implementation and experiments has just been published in Data and Knowledge Engineering]]//.\\ Data & Knowledge Engineering, Volume 120, March 2019, Pages 1-44 (2019).\\ | ||
| + | |||
| === 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 === | ||
| */ | */ | ||
| + | |||
| + | === Preprints === | ||
| + | * Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover. //[[https://arxiv.org/abs/1903.06061|Maximum Cut Parameterized by Crossing Number]]//.\\ CoRR [[http://arxiv.org/abs/1903.06061|abs/1903.06061]] (2019). | ||
| + | * Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling. //[[https://arxiv.org/abs/1812.03074|Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs]]//.\\ CoRR [[http://arxiv.org/abs/1812.03074|abs/1812.03074]] (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 === | ||
| - | * **Entwicklung eines MAX-CUT-Algorithmus für fast-planare Graphen** \\ Christine Dahn \\ Master Thesis, TU Dortmund, September 2017. | + | * Christine Dahn, //Entwicklung eines MAX-CUT-Algorithmus für fast-planare Graphen//. Master Thesis, TU Dortmund (September 2017). |
| - | * **Graphdatenbanken: Das Containment-Problem für C2RPQs** \\ Christine Dahn \\ 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 ===== | ||
| + | * 01-06 September 2019, Schloss Dagstuhl, Germany: **[[https://www.dagstuhl.de/de/programm/kalender/evhp/?semnr=19363|GI-Dagstuhl Seminar - Algorithms for Big Data]]** | ||
| - | * 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) | + | * 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) | + | * 16-19 July 2018, Singapore, Singapore: **[[http://www.comp.nus.edu.sg/~iwoca18/|International Workshop on Combinatorial Algorithms (IWOCA 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)]]** | + | |
| + | * 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)]]** | ||
| ===== Lehre-Archiv (Teaching-History) ===== | ===== Lehre-Archiv (Teaching-History) ===== | ||
| Line 65: | Line 86: | ||
| */ | */ | ||
| === Workshops === | === Workshops === | ||
| + | |||
| + | * **Wintersemester 2018/19** | ||
| + | * [[http://www.cs.tu-dortmund.de/nps/de/Studium/HelpCenter/PLT_MafI1/index.html| Mafi 1 PowerLerntage]] zu Mathematik für Informatik 1 | ||
| * **Wintersemester 2017/18** | * **Wintersemester 2017/18** | ||
| Line 73: | Line 97: | ||
| * **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 103: | ||
| === Lehrveranstaltungen === | === 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** | ||
| + | * [[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** | ||