Felicia Lucke

felicia.lucke@unifr.ch
+41 26 300 8320
https://orcid.org/0000-0002-9860-2928

Diploma Assistant / Assistant paid with third-party funding, Department of Informatics

PER 21 bu. C309
Bd de Pérolles 90
1700 Fribourg

PER 21, C309

+41 26 300 8320

Biography

I hold a bachelor and master degree from the University of Ulm in Germany. During my studies I participated in the International Collegiate Programming Contest where I obtained a gold medal in the German Collegiate Programming Contest and a bronze medal in the Northwestern Europe Regional Contest. In October 2020 I started my PhD at the University of Fribourg under supervision of Prof. Bernard Ries.

I am interested in structural and algorithmic graph theory.

Research and publications

Publications

12 publications

Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius
Theoretical Computer Science (2024) | Journal article

On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs
Discrete Applied Mathematics (2024) | Journal article

Reducing Graph Parameters by Contractions and Deletions
Algorithmica (2024) | Journal article

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
Lucke, Felicia and Momeni, Ali and Paulusma, Daniël and Smith, Siani, WG 2024: arXiv (2024) | Conference

Finding Matching Cuts in H-Free Graphs
Algorithmica (2023) | Journal article

Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
Lucke, Felicia and Paulusma, Daniël and Ries, Bernard, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023): Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023) | Conference

Matching Cuts in Graphs of High Girth and H-Free Graphs
Feghali, Carl and Lucke, Felicia and Paulusma, Daniel and Ries, Bernard, (2023) | Preprint

Matching Cuts in Graphs of High Girth and H-Free Graphs
Feghali, Carl and Lucke, Felicia and Paulusma, Daniël and Ries, Bernard, The 34th International Symposium on Algorithms and Computation (ISAAC 2023): Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023) | Conference

Maximizing Matching Cuts
Le, Van Bang and Lucke, Felicia and Paulusma, Daniël and Ries, Bernard, (2023) | Preprint

On the complexity of matching cut for graphs of bounded radius and H-free graphs
Theoretical Computer Science (2022) | Journal article

Finding Matching Cuts in H-Free Graphs
Lucke, Felicia and Paulusma, Daniël and Ries, Bernard, The 33rd International Symposium on Algorithms and Computation (ISAAC 2022): Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022) | Conference

Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number
Felicia Lucke and Felix Mann, Lecture Notes in Computer Science: Springer International Publishing (2022) | Conference

Teaching and courses

Show in course program