Felicia Lucke

Assistant and PhD Student

T: +41 26 300 8320

Address: Bd de Pérolles 90, 1700 Fribourg

Office: C 309



Short bio

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. I also did an internship of 6 months and my bachelor's thesis at Daimler AG. Since October 2020 I started my PhD at the University of Fribourg under supervision of Prof. Bernard Ries.


My research interests:

  • Computational Complexity
  • Structural Graph Theory
  • Algorithmic Graph Theory


Teaching activities




  • Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number, F. Lucke, F. Mann, IWOCA 2022, LNCS 13270, 412-424, 2022 (preprint available on arxiv)
  • On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs, F. Lucke, D. Paulusma, B. Ries,  Theoretical Computer Science 936 (2022) 33-42  Open Access
  • Finding Matching Cuts in H-Free Graphs, F. Lucke, D. Paulusma, B. Ries, Leibniz International Proceedings in Informatics 248 22:1 - 22:16 (2022), 33rd International Symposium on Algorithms and Computation (ISAAC 2022) Open Access
  • Reducing Graph Parameters by Contractions and Deletions, F. Lucke, F. Mann, to appear in Algorithmica  Open Access
  • Finding Matching Cuts in H-Free GraphsF. Lucke, D. Paulusma, B. Ries, to appear in Algorithmica (journal version) Open Access
  • Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius, F. Lucke, D. Paulsma, B. Ries, Leibniz International Proceedings in Informatics 272 64:1 - 63:15 (2023), 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) Open Access
  • Matching Cuts in Graphs of high Girth and H-Free Graphs, C. Feghali, F. Lucke, D. Paulusma, B. Ries, accepted at ISAAC 2023 (available on arxiv)