Felicia Lucke

According to our database, Felicia Lucke authored at least 18 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Optimal b-Colourings and Fall Colourings in H-Free Graphs.

Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David F. Manlove, Fabricio Mendoza, Daniël Paulusma

CoRR, March, 2026

Steiner Forest for <i>H</i>-Subgraph-Free Graphs.

Tala Eagling-Vose, David C. Kutner, Felicia Lucke, Dániel Marx, Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen

CoRR, February, 2026

2025

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification.

Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Daniël Paulusma

CoRR, December, 2025

Finding Minimum Matching Cuts in <i>H</i>-free Graphs and Graphs of Bounded Radius and Diameter.

Felicia Lucke, Joseph Marchand, Jannik Olbrich

CoRR, February, 2025

Matching cut and variants on bipartite graphs of bounded radius and diameter.

Felicia Lucke

Theor. Comput. Sci., 2025

Finding d-Cuts in Claw-Free Graphs.

Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024

Reducing Graph Parameters by Contractions and Deletions.

Felicia Lucke, Felix Mann

Algorithmica, March, 2024

On blockers and transversals of maximum independent sets in co-comparability graphs.

Felicia Lucke, Bernard Ries

Discret. Appl. Math., 2024

Finding <i>d</i>-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and <i>H</i>-Free Graphs.

Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith

CoRR, 2024

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs.

Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

2023

Maximizing Matching Cuts.

Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries

CoRR, 2023

Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.

Felicia Lucke, Daniël Paulusma, Bernard Ries

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Matching Cuts in Graphs of High Girth and H-Free Graphs.

Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

On the complexity of matching cut for graphs of bounded radius and <i>H</i>-free graphs.

Felicia Lucke, Daniël Paulusma, Bernard Ries

Theor. Comput. Sci., 2022

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.

Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries

CoRR, 2022

On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs.

Felicia Lucke, Daniël Paulusma, Bernard Ries

CoRR, 2022

Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number.

Felicia Lucke, Felix Mann

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Finding Matching Cuts in H-Free Graphs.

Felicia Lucke, Daniël Paulusma, Bernard Ries

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022