Paloma T. Lima

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 67

Top Topics

Subgraph Isomorphism

Parameterized Complexity

Top Venues

Publications

Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
-free Graphs in Polynomial Time. CoRR (2024)
Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR (2024)
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma
-free Graphs in Quasi-polynomial Time. SODA (2024)
Lars Jaffke, Paloma T. Lima
On the maximum number of edges in planar graphs of bounded degree and matching number. Discret. Math. 346 (8) (2023)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
Treewidth Is NP-Complete on Cubic Graphs. IPEC (2023)
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. 939 (2023)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the vertex cover number via edge contractions. J. Comput. Syst. Sci. 136 (2023)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR (2023)
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
A tight quasi-polynomial bound for Global Label Min-Cut. SODA (2023)
Lars Jaffke, Paloma T. Lima, Roohani Sharma
Structural Parameterizations of b-Coloring. ISAAC (2023)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. CoRR (2022)
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. 66 (4) (2022)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale
Reducing the Vertex Cover Number via Edge Contractions. MFCS (2022)
Lars Jaffke, Paloma T. Lima, Roohani Sharma
b-Coloring Parameterized by Pathwidth is XNLP-complete. CoRR (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming graphs with no large creatures and skinny ladders. CoRR (2022)
Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza
Taming Graphs with No Large Creatures and Skinny Ladders. ESA (2022)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR (2022)
Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza
A tight quasi-polynomial bound for Global Label Min-Cut. CoRR (2022)
Jakob Dyrseth, Paloma T. Lima
On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs. ISAAC (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC (2022)
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
Structural Parameterizations of Clique Coloring. Algorithmica 84 (2) (2022)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Well-partitioned chordal graphs. Discret. Math. 345 (10) (2022)
Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. Algorithmica 84 (12) (2022)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the domination number of graphs via edge contractions and vertex deletions. Discret. Math. 344 (1) (2021)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing graph transversals via edge contractions. J. Comput. Syst. Sci. 120 (2021)
Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov
b-Coloring Parameterized by Clique-Width. STACS (2021)
Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
Algorithms for the rainbow vertex coloring problem on graph classes. Theor. Comput. Sci. 887 (2021)
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
Using edge contractions to reduce the semitotal domination number. CoRR (2021)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Three Problems on Well-Partitioned Chordal Graphs. CIAC (2021)
Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
Finding connected secluded subgraphs. J. Comput. Syst. Sci. 113 (2020)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82 (7) (2020)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG (2020)
Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov
b-Coloring Parameterized by Clique-Width. CoRR (2020)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing graph transversals via edge contractions. CoRR (2020)
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Graph Square Roots of Small Distance from Degree One Graphs. LATIN (2020)
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Graph Square Roots of Small Distance from Degree One Graphs. CoRR (2020)
Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. LATIN (2020)
Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
Algorithms for the rainbow vertex coloring problem on graph classes. CoRR (2020)
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
Structural Parameterizations of Clique Coloring. CoRR (2020)
Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza
Reducing Graph Transversals via Edge Contractions. MFCS (2020)
Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima
Transversals of longest paths. Discret. Math. 343 (3) (2020)
Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
Well-partitioned chordal graphs: obstruction set and disjoint paths. CoRR (2020)
Márcia R. Cerioli, Paloma T. Lima
Intersection of longest paths in graph classes. Discret. Appl. Math. 281 (2020)
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
Structural Parameterizations of Clique Coloring. MFCS (2020)
Lars Jaffke, Paloma T. Lima
-chromatic number of graphs. Theor. Comput. Sci. 815 (2020)
Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. MFCS (2020)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
On the Parameterized Complexity of k-Edge Colouring. CoRR (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the domination number of graphs via edge contractions. CoRR (2019)
Lars Jaffke, Paloma T. Lima
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. MFCS (2019)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
-free graphs. Inf. Process. Lett. 146 (2019)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica 81 (7) (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ISAAC (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the Domination Number of Graphs via Edge Contractions. MFCS (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Blocking dominating sets for $H$-free graphs via edge contractions. CoRR (2019)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. CoRR (2018)
Lars Jaffke, Paloma T. Lima
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. CoRR (2018)
Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS (2018)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. SWAT (2018)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
Classifying k-Edge Colouring for H-free Graphs. CoRR (2018)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. CoRR (2017)
Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima
Transversals of Longest Paths. Electron. Notes Discret. Math. 62 (2017)
Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima
Transversals of Longest Paths. CoRR (2017)
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. WG (2017)
Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
Finding Connected Secluded Subgraphs. CoRR (2017)
Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre
Finding Connected Secluded Subgraphs. IPEC (2017)
Márcia R. Cerioli, Paloma T. Lima
Intersection of Longest Paths in Graph Classes. Electron. Notes Discret. Math. 55 (2016)