Felicia Lucke

29 papers B 5C 1Journal 23
YearRankTypeTitle / Venue / Authors
2026 J jnl
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs.
Algorithmica
Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2026 J jnl
Optimal b-Colourings and Fall Colourings in H-Free Graphs.
CoRR
Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David F. Manlove, Fabricio Mendoza, Daniël Paulusma
2026 J jnl
Steiner Forest for
CoRR
Tala Eagling-Vose, David C. Kutner, Felicia Lucke, Dániel Marx, Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
2025 J jnl
Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification.
CoRR
Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Daniël Paulusma
2025 J jnl
Finding Minimum Matching Cuts in
CoRR
Felicia Lucke, Joseph Marchand, Jannik Olbrich
2025 B conf
Finding d-Cuts in Claw-Free Graphs.
ISAAC
Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2025 J jnl
Finding d-Cuts in Claw-free Graphs.
CoRR
Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Daniël Paulusma, Siani Smith
2025 J jnl
Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter.
CoRR
Felicia Lucke
2025 J jnl
Matching Cuts in Graphs of High Girth and H-Free Graphs.
Algorithmica
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2025 J jnl
Matching cut and variants on bipartite graphs of bounded radius and diameter.
Theor. Comput. Sci.
Felicia Lucke
2024 J jnl
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius.
Theor. Comput. Sci.
Felicia Lucke, Daniël Paulusma, Bernard Ries
2024 J jnl
Finding
CoRR
Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024 B conf
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs.
WG
Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
2024 J jnl
On blockers and transversals of maximum independent sets in co-comparability graphs.
Discret. Appl. Math.
Felicia Lucke, Bernard Ries
2024 J jnl
Reducing Graph Parameters by Contractions and Deletions.
Algorithmica
Felicia Lucke, Felix Mann
2023 B conf
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.
MFCS
Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.
CoRR
Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
Finding Matching Cuts in H-Free Graphs.
Algorithmica
Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 B conf
Matching Cuts in Graphs of High Girth and H-Free Graphs.
ISAAC
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
Maximizing Matching Cuts.
CoRR
Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs.
CoRR
Felicia Lucke, Bernard Ries
2022 B conf
Finding Matching Cuts in H-Free Graphs.
ISAAC
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
Finding Matching Cuts in H-Free Graphs.
CoRR
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.
CoRR
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs.
CoRR
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
On the complexity of matching cut for graphs of bounded radius and
Theor. Comput. Sci.
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
Reducing Graph Parameters by Contractions and Deletions.
CoRR
Felicia Lucke, Felix Mann
2022 C conf
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number.
IWOCA
Felicia Lucke, Felix Mann
2022 J jnl
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number.
CoRR
Felicia Lucke, Felix Mann