Felicia Lucke

1. On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs
   2022/04/14 by Felicia Lucke, Lucke, Felicia, Daniël Paulusma +3 · 2 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory
2. Finding Matching Cuts in H-Free Graphs
   2022/07/14 by Felicia Lucke, Lucke, Felicia, Daniël Paulusma +3 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
3. Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
   2024/04/17 by Felicia Lucke, Lucke, Felicia, Ali Momeni +5 · 2 citations
   Computer Science · Engineering · #Computational Geometry and Mesh Generation #Advanced Graph Theory Research #Optimization and Packing Problems