Recherche et publications

• Publications
  10 publications

  2024 2023 2022

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

  Finding Matching Cuts in H-Free Graphs
  Algorithmica (2023) | 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) | Conférence

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

  On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs
  Lucke, Felicia and Ries, Bernard, (2023) | Prépublication

  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) | Conférence

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

  On the complexity of matching cut for graphs of bounded radius and H-free graphs
  Theoretical Computer Science (2022) | 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) | Conférence

  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) | Conférence

Enseignement et cours

Afficher dans le programme des cours