| 2026 | WG | Optimal b-Colourings and Fall Colourings in H-Free Graphs. | Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David F. Manlove, Fabricio Mendoza-Granada, Danil Paulusma |
| 2026 | WG | Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification. | Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Danil Paulusma |
| 2025 | ISAAC | Finding d-Cuts in Claw-Free Graphs. | Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, Danil Paulusma, Siani Smith |
| 2024 | WG | Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs. | Felicia Lucke, Ali Momeni, Danil Paulusma, Siani Smith |
| 2023 | ISAAC | Matching Cuts in Graphs of High Girth and H-Free Graphs. | Carl Feghali, Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2023 | MFCS | Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. | Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2022 | ISAAC | Finding Matching Cuts in H-Free Graphs. | Felicia Lucke, Danil Paulusma, Bernard Ries |
| 2022 | IWOCA | Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. | Felicia Lucke, Felix Mann |