User Tools

Site Tools


people:dahn

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
people:dahn [2020/06/04 16:10]
christine.dahn [Lehre (Teaching)]
people:dahn [2021/04/21 15:22] (current)
christine.dahn [Lehre (Teaching)]
Line 1: Line 1:
 ===== Christine Dahn ===== ===== Christine Dahn =====
  
-| Room: | 2.078a, Endenicher Allee 19A + 
-| Phone: | +49 (228) 73-60653 |+| Room: | 2.078a | 
 +| Phone: | +49 (228) 73-60653 ​|
 | E-Mail: | cdahn{{:​at.gif?​12|}}cs.uni-bonn.de | | E-Mail: | cdahn{{:​at.gif?​12|}}cs.uni-bonn.de |
-My page at [[https://​ls11-www.cs.tu-dortmund.de/​staff/​dahn|TU Dortmund]].+ 
 +* Due to covid-19 I currently work from home. So you won't reach me under the listed phone number. If you want to contact me, please write me an email. 
 + 
 +My old page at [[https://​ls11-www.cs.tu-dortmund.de/​staff/​dahn|TU Dortmund]].
  
 {{ :​people:​dahn.jpg?​150|}} ​ {{ :​people:​dahn.jpg?​150|}} ​
Line 14: Line 18:
   * graph algorithms   * graph algorithms
   * 1-planar graphs   * 1-planar graphs
 +  * tree-width
  
  
Line 23: Line 28:
 === aktuelle Lehrveranstaltungen === === aktuelle Lehrveranstaltungen ===
  
 +  * **Sommersemester 2021** ​
 +    * [[teaching:​ss21:​lab-ca|Lab Computational Analytics]]
 +
 +
 +=== vergangene Lehrveranstaltungen ===
 +
 +  * **Wintersemester 2020/​21** ​
 +    * [[teaching:​ws2021:​aa|Advanced Algorithms (Tutorial)]]
  
   * **Sommersemester 2020** ​   * **Sommersemester 2020** ​
-    * [[https://​ca.cs.uni-bonn.de/​doku.php?​id=teaching:​ss20:​pg-ae|Projektgruppe:​ Algorithm Engineering]]+    * [[teaching:​ss20:​pg-ae|Projektgruppe:​ Algorithm Engineering]]
  
   * **Wintersemester 2019/​20** ​   * **Wintersemester 2019/​20** ​
-    * Logik und diskrete Strukturen+    * [[http://​tcs.cs.uni-bonn.de/​doku.php?​id=teaching:​ws1920:​vl-luds|Logik und diskrete Strukturen ​(Übung)]]
   ​   ​
  
 === betreute Abschlussarbeiten === === betreute Abschlussarbeiten ===
-  * **Julian Schilling:** //Parameterized ​Max-Cut ​on 1-planar Graphs//, MasterarbeitTU Dortmund, 2019.  +  * **Vincent Schönbach:** //Realisierung und Evaluierung eines parametrisierten ​Max-Cut ​Algorithmus für Graphen mit k Kreuzungen ​//, BachelorarbeitUniversität Bonn (aktuell)  ​ 
-  * **Sven Brümmer:** //Ansätze für paralleles Max-Cut//, Masterarbeit,​ TU Dortmund2019 +  * **Sven Brümmer:** //Ansätze für paralleles Max-Cut//, Masterarbeit,​ TU Dortmund ​(2019  
 +  * **Julian Schilling:​** //​Parameterized Max-Cut on 1-planar Graphs//, Masterarbeit,​ TU Dortmund (2019)
  
 ===== Publications ===== ===== Publications =====
Line 41: Line 55:
  
 === Journal Articles === === Journal Articles ===
 +
 +  * Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling: //​[[https://​www.sciencedirect.com/​science/​article/​abs/​pii/​S0304397520306721 | Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs]]//​.\\ Theoretical Computer Science 852: 172-184 (2021)
   * Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke,​ Nils M. Kriege, Petra Mutzel, Alexander Nover://​[[http://​jgaa.info/​getPaper?​id=523|Maximum Cut Parameterized by Crossing Number]]//​.\\ Journal of Graph Algorithms and Applications 24(3): 155-170 (2020)   * Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke,​ Nils M. Kriege, Petra Mutzel, Alexander Nover://​[[http://​jgaa.info/​getPaper?​id=523|Maximum Cut Parameterized by Crossing Number]]//​.\\ Journal of Graph Algorithms and Applications 24(3): 155-170 (2020)
-  * 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).+  * 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).\\+  * 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)\\
  
 === Preprints === === 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). +  * 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, 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).+  * 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 (Oktober 2013).+  * Christine Dahn, //​Graphdatenbanken:​ Das Containment-Problem für C2RPQs//. Bachelor Thesis, TU Dortmund (Oktober 2013)
  
 ===== Conferences/​Meetings/​Workshops Attended ===== ===== Conferences/​Meetings/​Workshops Attended =====
people/dahn.1591279850.txt.gz · Last modified: 2020/06/04 16:10 by christine.dahn

Page Tools