Computational Analytics

* I work mostly from home. If you don't reach me under the listed phone number, please write me an email.

My old page at TU Dortmund.

• maximum cut (on graphs with few crossings)
• fixed-parameter tractability
• problems related to the crossing number
• graph algorithms
• 1-planar graphs
• tree-width

My ORCID code is 0000-0003-0609-176X.

• Sprechstunde: nach Vereinbarung

• Sommersemester 2022
  • Projektgruppe: Algorithm Engineering

• Wintersemester 2021/22
  • Algorithmen und Berechnungskomplexität I (Übung)

• Sommersemester 2021
  • Lab Computational Analytics

• Wintersemester 2020/21
  • Advanced Algorithms (Tutorial)

• Sommersemester 2020
  • Projektgruppe: Algorithm Engineering

• Wintersemester 2019/20
  • Logik und diskrete Strukturen (Übung)

• Tamer Metin: Realisierung und Evaluierung eines Max-Cut Algorithmus für Graphen mit beschränkter Baumweite, Bachelorarbeit, Universität Bonn (2021)
• Vincent Schönbach: Realisierung und Evaluierung eines parametrisierten Max-Cut Algorithmus für Graphen mit k Kreuzungen, Bachelorarbeit, Universität Bonn (2021)
• 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)

Also see DBLP for a complete up to date list. My ORCID code is 0000-0003-0609-176X.

• Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling: 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: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. 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)

• Christine Dahn, Nils M. Kriege, Petra Mutzel. 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)
  

• Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, Alexander Nover. Maximum Cut Parameterized by Crossing Number.
  CoRR abs/1903.06061 (2019)
• Christine Dahn, Nils M. Kriege, Petra Mutzel, Julian Schilling. Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs.
  CoRR abs/1812.03074 (2018)
• Christine Dahn, Nils M. Kriege, Petra Mutzel. A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.
  CoRR abs/1803.10983 (2018)

• 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)

• 01-06 September 2019, Schloss Dagstuhl, Germany: GI-Dagstuhl Seminar - Algorithms for Big Data

• 21-24 August 2018, Chemnitz, Germany: 22nd Workshop on Future Research in Combinatorial Optimization (FRICO 2018)

• 16-19 July 2018, Singapore, Singapore: International Workshop on Combinatorial Algorithms (IWOCA 2018)

• 27-29 June 2018, Cottbus/Lübbenau, Germany: 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018)