default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaloma T. Lima
Person information
- affiliation: IT University of Copenhagen, Computer Science Department, Denmark
- affiliation (PhD 2019): University of Bergen, Department of Informatics, Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j20]Lars Jaffke
, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. Theory Comput. Syst. 68(4): 1049-1081 (2024)- 2023
- [j19]Lars Jaffke, Paloma T. Lima:
On the maximum number of edges in planar graphs of bounded degree and matching number. Discret. Math. 346(8): 113431 (2023) - [j18]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: 63-87 (2023) - [j17]Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries:
Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. 939: 140-160 (2023) - 2022
- [j16]Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. Algorithmica 84(2): 273-303 (2022) - [j15]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): 3587-3602 (2022) - [j14]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-partitioned chordal graphs. Discret. Math. 345(10): 112985 (2022) - [j13]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. 66(4): 821-846 (2022) - 2021
- [j12]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the domination number of graphs via edge contractions and vertex deletions. Discret. Math. 344(1): 112169 (2021) - [j11]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: 62-74 (2021) - [j10]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: 122-142 (2021) - 2020
- [j9]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82(7): 2006-2038 (2020) - [j8]Márcia R. Cerioli, Paloma T. Lima:
Intersection of longest paths in graph classes. Discret. Appl. Math. 281: 96-105 (2020) - [j7]Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of longest paths. Discret. Math. 343(3): 111717 (2020) - [j6]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding connected secluded subgraphs. J. Comput. Syst. Sci. 113: 101-124 (2020) - [j5]Lars Jaffke, Paloma T. Lima:
A complexity dichotomy for critical values of the b-chromatic number of graphs. Theor. Comput. Sci. 815: 182-196 (2020) - 2019
- [j4]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): 2795-2828 (2019) - [j3]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
Classifying k-edge colouring for H-free graphs. Inf. Process. Lett. 146: 39-43 (2019) - 2017
- [j2]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: 135-140 (2017) - 2016
- [j1]Márcia R. Cerioli, Paloma T. Lima:
Intersection of Longest Paths in Graph Classes. Electron. Notes Discret. Math. 55: 139-142 (2016)
Conference and Workshop Papers
- 2024
- [c25]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. ESA 2024: 85:1-85:17 - [c24]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. SODA 2024: 5276-5290 - 2023
- [c23]Lars Jaffke, Paloma T. Lima, Roohani Sharma:
Structural Parameterizations of b-Coloring. ISAAC 2023: 40:1-40:14 - [c22]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: 7:1-7:13 - [c21]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: 290-303 - [c20]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: 3229-3244 - 2022
- [c19]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: 58:1-58:8 - [c18]Jakob Dyrseth, Paloma T. Lima:
On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs. ISAAC 2022: 43:1-43:13 - [c17]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: 8:1-8:18 - [c16]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: 69:1-69:14 - 2021
- [c15]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Three Problems on Well-Partitioned Chordal Graphs. CIAC 2021: 23-36 - [c14]Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. STACS 2021: 43:1-43:15 - 2020
- [c13]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. LATIN 2020: 116-128 - [c12]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: 600-612 - [c11]Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. MFCS 2020: 49:1-49:15 - [c10]Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen:
Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. MFCS 2020: 63:1-63:13 - [c9]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza:
Reducing Graph Transversals via Edge Contractions. MFCS 2020: 64:1-64:15 - [c8]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG 2020: 148-160 - 2019
- [c7]Esther Galby, Paloma T. Lima, Bernard Ries:
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ISAAC 2019: 21:1-21:14 - [c6]Lars Jaffke, Paloma T. Lima:
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. MFCS 2019: 34:1-34:13 - [c5]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the Domination Number of Graphs via Edge Contractions. MFCS 2019: 41:1-41:13 - 2018
- [c4]Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen:
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS 2018: 83:1-83:13 - [c3]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. SWAT 2018: 23:1-23:13 - 2017
- [c2]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. IPEC 2017: 18:1-18:13 - [c1]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: 275-288
Informal and Other Publications
- 2024
- [i24]Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma:
Odd Cycle Transversal on P5-free Graphs in Polynomial Time. CoRR abs/2402.11465 (2024) - [i23]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR abs/2402.15834 (2024) - 2023
- [i22]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 abs/2301.10031 (2023) - 2022
- [i21]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 abs/2202.03322 (2022) - [i20]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 abs/2205.01191 (2022) - [i19]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 abs/2207.07425 (2022) - [i18]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 abs/2207.07426 (2022) - [i17]Lars Jaffke, Paloma T. Lima, Roohani Sharma:
b-Coloring Parameterized by Pathwidth is XNLP-complete. CoRR abs/2209.07772 (2022) - 2021
- [i16]Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries:
Using edge contractions to reduce the semitotal domination number. CoRR abs/2107.03755 (2021) - 2020
- [i15]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-partitioned chordal graphs: obstruction set and disjoint paths. CoRR abs/2002.10859 (2020) - [i14]Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen:
Algorithms for the rainbow vertex coloring problem on graph classes. CoRR abs/2003.03108 (2020) - [i13]Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. CoRR abs/2003.04254 (2020) - [i12]Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza:
Reducing graph transversals via edge contractions. CoRR abs/2005.01460 (2020) - [i11]Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. CoRR abs/2005.04733 (2020) - [i10]Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos:
Graph Square Roots of Small Distance from Degree One Graphs. CoRR abs/2010.05733 (2020) - 2019
- [i9]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
On the Parameterized Complexity of k-Edge Colouring. CoRR abs/1901.01861 (2019) - [i8]Esther Galby, Paloma T. Lima, Bernard Ries:
Reducing the domination number of graphs via edge contractions. CoRR abs/1903.01800 (2019) - [i7]Esther Galby, Paloma T. Lima, Bernard Ries:
Blocking dominating sets for $H$-free graphs via edge contractions. CoRR abs/1906.12297 (2019) - 2018
- [i6]Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. CoRR abs/1802.10386 (2018) - [i5]Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries:
Classifying k-Edge Colouring for H-free Graphs. CoRR abs/1810.04379 (2018) - [i4]Lars Jaffke, Paloma T. Lima:
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. CoRR abs/1811.03966 (2018) - 2017
- [i3]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 abs/1703.05102 (2017) - [i2]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. CoRR abs/1710.10979 (2017) - [i1]Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez, Juan Gutiérrez, Paloma T. Lima:
Transversals of Longest Paths. CoRR abs/1712.07086 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
