Paloma T. Lima

According to our database, Paloma T. Lima authored at least 38 papers between 2016 and 2024.

Collaborative distances:

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

2024

Tree decompositions meet induced matchings: beyond Max Weight Independent Set.

Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel

CoRR, 2024

Odd Cycle Transversal on P₅-free Graphs in Polynomial Time.

Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma

CoRR, 2024

Odd Cycle Transversal on <i>P</i>₅-free Graphs in Quasi-polynomial Time.

Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

On the maximum number of edges in planar graphs of bounded degree and matching number.

Lars Jaffke, Paloma T. Lima

Discret. Math., August, 2023

Using edge contractions to reduce the semitotal domination number.

Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries

Theor. Comput. Sci., 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

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ý

CoRR, 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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 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ý

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Structural Parameterizations of b-Coloring.

Lars Jaffke, Paloma T. Lima, Roohani Sharma

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

2022

Graph Square Roots of Small Distance from Degree One Graphs.

Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos

Theory Comput. Syst., 2022

Well-partitioned chordal graphs.

Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima

Discret. Math., 2022

b-Coloring Parameterized by Pathwidth is XNLP-complete.

Lars Jaffke, Paloma T. Lima, Roohani Sharma

CoRR, 2022

Structural Parameterizations of Clique Coloring.

Lars Jaffke, Paloma T. Lima, Geevarghese Philip

Algorithmica, 2022

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

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure.

Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs.

Jakob Dyrseth, Paloma T. Lima

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

Taming Graphs with No Large Creatures and Skinny Ladders.

Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

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

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

Reducing the domination number of graphs via edge contractions and vertex deletions.

Esther Galby, Paloma T. Lima, Bernard Ries

Discret. Math., 2021

b-Coloring Parameterized by Clique-Width.

Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Three Problems on Well-Partitioned Chordal Graphs.

Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

A complexity dichotomy for critical values of the <i>b</i>-chromatic number of graphs.

Lars Jaffke, Paloma T. Lima

Theor. Comput. Sci., 2020

Finding connected secluded subgraphs.

Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre

J. Comput. Syst. Sci., 2020

Parameterized Aspects of Strong Subgraph Closure.

Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos

Algorithmica, 2020

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths.

Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima

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

2019

Classifying <i>k</i>-edge colouring for <i>H</i>-free graphs.

Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

Inf. Process. Lett., 2019

On the Parameterized Complexity of k-Edge Colouring.

Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

CoRR, 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

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs.

Lars Jaffke, Paloma T. Lima

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Reducing the Domination Number of Graphs via Edge Contractions.

Esther Galby, Paloma T. Lima, Bernard Ries

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Blocking Dominating Sets for H-Free Graphs via Edge Contractions.

Esther Galby, Paloma T. Lima, Bernard Ries

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Classifying k-Edge Colouring for H-free Graphs.

Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

CoRR, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.

Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Transversals of Longest Paths.

Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima

Electron. Notes Discret. Math., 2017

2016

Intersection of Longest Paths in Graph Classes.

Márcia R. Cerioli, Paloma T. Lima

Electron. Notes Discret. Math., 2016