Get started
Author

Paloma T. Lima

Observed names: Lima, P., Lima, Paloma, Lima, Paloma T., Paloma Lima, Paloma T. De Lima, Paloma T. de Lima, Paloma T. Lima, de Lima, Paloma, de Lima, Paloma T.
Observed institutions: Universidade Federal do Rio de Janeiro, University of Fribourg, Universidade Federal Fluminense, National Institute of Informatics, University of Bergen, University of Warsaw, Universidade Federal de Goiás, IT University of Copenhagen, Norwegian School of Economics
ORCID: 0000-0001-9304-4536
Observed ORCID: 0000-0001-9304-4536
OpenAlex ID: A5091558578
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
2024 · Hans L. Bodlaender, Carla Groenland, et al. · Algorithmica · 28
PDF
Intersection of longest paths in graph classes
2019 · Márcia R. Cerioli, Paloma T. Lima · Discrete Applied Mathematics · 20
PDF
Well-partitioned chordal graphs
2022 · Jungho Ahn, Lars Jaffke, et al. · Discrete Mathematics · 18
PDF
Reducing the domination number of graphs via edge contractions and vertex deletions
2020 · Esther Galby, Paloma T. Lima, et al. · Discrete Mathematics · 16
PDF
Finding connected secluded subgraphs
2020 · Petr A. Golovach, Pinar Heggernes, et al. · Journal of Computer and System Sciences · 16
PDF
Transversals of longest paths
2019 · Márcia R. Cerioli, Cristina G. Fernandes, et al. · Discrete Mathematics · 15
Parameterized Aspects of Strong Subgraph Closure
2020 · Petr A. Golovach, Pinar Heggernes, et al. · Algorithmica · 12
PDF
A tight quasi-polynomial bound for Global Label Min-Cut
2023 · Lars Jaffke, Paloma T. Lima, et al. · Society for Industrial and Applied Mathematics eBooks · 10
b-Coloring Parameterized by Clique-Width
2023 · Lars Jaffke, Paloma T. Lima, et al. · Theory of Computing Systems · 9
PDF
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs
2018 · Heggernes, Pinar, Issac, Davis, et al. · Leibniz international proceedings in informatics · 9
PDF
Using edge contractions to reduce the semitotal domination number
2022 · Esther Galby, Paloma T. Lima, et al. · Theoretical Computer Science · 8
PDF
Algorithms for the rainbow vertex coloring problem on graph classes
2021 · Paloma T. Lima, Erik Jan van Leeuwen, et al. · Theoretical Computer Science · 8
PDF
Classifying k-edge colouring for H-free graphs
2019 · Esther Galby, Paloma T. Lima, et al. · Information Processing Letters · 8
On the Parameterized Complexity of $k$-Edge Colouring
2019 · Galby, Esther, Lima, Paloma T., et al. · arXiv (Cornell University) · 8
PDF
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
2023 · Meike Hatzel, Lars Jaffke, et al. · Society for Industrial and Applied Mathematics eBooks · 7
Treewidth Is NP-Complete on Cubic Graphs
2023 · Bodlaender, Hans L., Bonnet, Édouard, et al. · IT University Of Copenhagen (IT University of Copenhagen) · 7
Tree decompositions meet induced matchings: beyond Max Weight Independent Set
2026 · Paloma T. de Lima, Martin Milanič, et al. · Journal of Computer and System Sciences · 6
Reducing graph transversals via edge contractions
2021 · Paloma T. Lima, Vinicius F. dos Santos, et al. · Journal of Computer and System Sciences · 6
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths
2020 · Jungho Ahn, Lars Jaffke, et al. · Lecture notes in computer science · 6
PDF
Reducing the Domination Number of Graphs via Edge Contractions
2019 · Galby, Esther, Lima, Paloma T., et al. · arXiv (Cornell University) · 6
PDF
Intersection of Longest Paths in Graph Classes
2016 · Márcia R. Cerioli, Paloma Lima · Electronic Notes in Discrete Mathematics · 6
Blocking Dominating Sets for H-Free Graphs via Edge Contractions
2019 · Galby, Esther, Lima, Paloma T., et al. · arXiv (Cornell University) · 5
PDF
A Tight Quasi-Polynomial Bound for Global Label Min-Cut
2026 · Lars Jaffke, Paloma T. de Lima, et al. · ACM Transactions on Algorithms · 4
PDF
Taming Graphs with No Large Creatures and Skinny Ladders
2024 · Jakub Gajarský, Lars Jaffke, et al. · SIAM Journal on Discrete Mathematics · 4
PDF
Odd Cycle Transversal on P 5 -free Graphs in Polynomial Time
2024 · Akanksha Agrawal, Paloma T. Lima, et al. · ACM Transactions on Algorithms · 4
PDF
Works count: 64
Citation count: 298
H-index: 9
I10-index: 8
Year
Topic
Type