Transversals of Longest Paths. - Márcia R. Cerioli; Cristina G. Fernandes; Renzo Gómez; Juan Gutiérrez 001; Paloma T. Lima (Electron. Notes Discret. Math., 2017)

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. - Pinar Heggernes; Davis Issac; Juho Lauri; Paloma T. Lima; Erik Jan van Leeuwen (MFCS, 2018)

Classifying k-Edge Colouring for H-free Graphs. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (CoRR, 2018)

Blocking Dominating Sets for H-Free Graphs via Edge Contractions. - Esther Galby; Paloma T. Lima; Bernard Ries (ISAAC, 2019)

Reducing the Domination Number of Graphs via Edge Contractions. - Esther Galby; Paloma T. Lima; Bernard Ries (MFCS, 2019)

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. - Lars Jaffke; Paloma T. Lima (MFCS, 2019)

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. - Petr A. Golovach; Pinar Heggernes; Dieter Kratsch; Paloma T. Lima; Daniël Paulusma (Algorithmica, 2019)

On the Parameterized Complexity of k-Edge Colouring. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (CoRR, 2019)

Classifying k-edge colouring for H-free graphs. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (Inf. Process. Lett., 2019)

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. - Jungho Ahn; Lars Jaffke; O-joung Kwon; Paloma T. Lima (WG, 2020)

Parameterized Aspects of Strong Subgraph Closure. - Petr A. Golovach; Pinar Heggernes; Athanasios L. Konstantinidis; Paloma T. Lima; Charis Papadopoulos (Algorithmica, 2020)

Intersection of longest paths in graph classes. - Márcia R. Cerioli; Paloma T. Lima (Discret. Appl. Math., 2020)

Finding connected secluded subgraphs. - Petr A. Golovach; Pinar Heggernes; Paloma T. Lima; Pedro Montealegre 001 (J. Comput. Syst. Sci., 2020)

A complexity dichotomy for critical values of the b-chromatic number of graphs. - Lars Jaffke; Paloma T. Lima (Theor. Comput. Sci., 2020)

Three Problems on Well-Partitioned Chordal Graphs. - Jungho Ahn; Lars Jaffke; O-joung Kwon; Paloma T. Lima (CIAC, 2021)

Reducing the domination number of graphs via edge contractions and vertex deletions. - Esther Galby; Paloma T. Lima; Bernard Ries (Discret. Math., 2021)

Reducing graph transversals via edge contractions. - Paloma T. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Uéverton S. Souza (J. Comput. Syst. Sci., 2021)

Algorithms for the rainbow vertex coloring problem on graph classes. - Paloma T. Lima; Erik Jan van Leeuwen; Marieke van der Wegen (Theor. Comput. Sci., 2021)

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. - Jean R. S. Blair; Pinar Heggernes; Paloma T. Lima; Daniel Lokshtanov (Algorithmica, 2022)

Structural Parameterizations of Clique Coloring. - Lars Jaffke; Paloma T. Lima; Geevarghese Philip (Algorithmica, 2022)

b-Coloring Parameterized by Pathwidth is XNLP-complete. - Lars Jaffke; Paloma T. Lima; Roohani Sharma (CoRR, 2022)

Well-partitioned chordal graphs. - Jungho Ahn; Lars Jaffke; O-joung Kwon; Paloma T. Lima (Discret. Math., 2022)

Graph Square Roots of Small Distance from Degree One Graphs. - Petr A. Golovach; Paloma T. Lima; Charis Papadopoulos (Theory Comput. Syst., 2022)

Structural Parameterizations of b-Coloring. - Lars Jaffke; Paloma T. Lima; Roohani Sharma (ISAAC, 2023)

Treewidth Is NP-Complete on Cubic Graphs. - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (IPEC, 2023)

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. - Meike Hatzel; Lars Jaffke; Paloma T. Lima; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Manuel Sorge (SODA, 2023)

A tight quasi-polynomial bound for Global Label Min-Cut. - Lars Jaffke; Paloma T. Lima; Tomás Masarík; Marcin Pilipczuk; Uéverton S. Souza (SODA, 2023)

Treewidth is NP-Complete on Cubic Graphs (and related results). - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (CoRR, 2023)

Reducing the vertex cover number via edge contractions. - Paloma T. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Uéverton S. Souza; Prafullkumar Tale (J. Comput. Syst. Sci., 2023)

Using edge contractions to reduce the semitotal domination number. - Esther Galby; Paloma T. Lima; Felix Mann; Bernard Ries (Theor. Comput. Sci., 2023)

On the maximum number of edges in planar graphs of bounded degree and matching number. - Lars Jaffke; Paloma T. Lima (Discret. Math., 2023)

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. - Paloma T. Lima; Martin Milanic; Peter Mursic; Karolina Okrasa; Pawel Rzazewski; Kenny Storgel (ESA, 2024)

Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma (SODA, 2024)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (CoRR, 2024)

Taming Graphs with No Large Creatures and Skinny Ladders. - Jakub Gajarský; Lars Jaffke; Paloma T. Lima; Jana Masaríková; Marcin Pilipczuk; Pawel Rzazewski; Uéverton S. Souza (SIAM J. Discret. Math., 2024)

b-Coloring Parameterized by Clique-Width. - Lars Jaffke; Paloma T. Lima; Daniel Lokshtanov (Theory Comput. Syst., 2024)

Longest Path Transversals in Claw-Free and P5-Free Graphs. - Paloma T. Lima; Amir Nikabadi (CIAC (1), 2025)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (ACM Trans. Algorithms, 2025)

A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees. - Lars Jaffke; Paloma T. Lima; Wojciech Nadara; Emmanuel Sam (CoRR, 2025)

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. - Hans L. Bodlaender; Carla Groenland; Hugo Jacob 001; Lars Jaffke; Paloma T. Lima (Algorithmica, 2025)

Maximum list r-colorable induced subgraphs in kP3-free graphs. - Esther Galby; Paloma T. Lima; Andrea Munaro; Amir Nikabadi (CoRR, 2025)

On the complexity of rainbow vertex colouring diametral path graphs. - Jakob Dyrseth; Paloma Thomé de Lima (J. Comput. Syst. Sci., 2026)