Intersection of longest paths in graph classes MR Cerioli, PT Lima
Discrete Applied Mathematics 281, 96-105, 2020
22 * 2020 Reducing the domination number of graphs via edge contractions and vertex deletions E Galby, PT Lima, B Ries
Discrete Mathematics 344 (1), 112169, 2021
17 * 2021 XNLP-completeness for parameterized problems on graphs with a linear structure HL Bodlaender, C Groenland, H Jacob, L Jaffke, PT Lima
arXiv preprint arXiv:2201.13119, 2022
15 2022 Rainbow vertex coloring bipartite graphs and chordal graphs P Heggernes, D Issac, J Lauri, PT Lima, EJ van Leeuwen
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
15 2018 Parameterized aspects of strong subgraph closure PA Golovach, P Heggernes, AL Konstantinidis, PT Lima, C Papadopoulos
Algorithmica 82 (7), 2006-2038, 2020
13 2020 Transversals of longest paths MR Cerioli, CG Fernandes, R Gómez, J Gutiérrez, PT Lima
Discrete Mathematics 343 (3), 111717, 2020
13 2020 Algorithms for the rainbow vertex coloring problem on graph classes PT Lima, EJ van Leeuwen, M van der Wegen
Theoretical Computer Science 887, 122-142, 2021
11 2021 Finding connected secluded subgraphs PA Golovach, P Heggernes, PT Lima, P Montealegre
Journal of Computer and System Sciences 113, 101-124, 2020
10 2020 Classifying k-edge colouring for H-free graphs E Galby, PT Lima, D Paulusma, B Ries
Information Processing Letters 146, 39-43, 2019
9 2019 Well-partitioned chordal graphs J Ahn, L Jaffke, O Kwon, PT Lima
Discrete Mathematics 345 (10), 112985, 2022
8 2022 b -Coloring Parameterized by Clique-WidthL Jaffke, PT Lima, D Lokshtanov
Theory of Computing Systems, 1-33, 2023
7 2023 Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation M Hatzel, L Jaffke, PT Lima, T Masařík, M Pilipczuk, R Sharma, M Sorge
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
6 2023 Well-partitioned chordal graphs: obstruction set and disjoint paths J Ahn, L Jaffke, O Kwon, PT Lima
International Workshop on Graph-Theoretic Concepts in Computer Science, 148-160, 2020
6 2020 A tight quasi-polynomial bound for Global Label Min-Cut L Jaffke, PT Lima, T Masařík, M Pilipczuk, US Souza
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
5 2023 Taming graphs with no large creatures and skinny ladders J Gajarský, L Jaffke, PT Lima, J Novotná, M Pilipczuk, P Rzążewski, ...
arXiv preprint arXiv:2205.01191, 2022
5 2022 Reducing graph transversals via edge contractions PT Lima, VF dos Santos, I Sau, US Souza
Journal of Computer and System Sciences 120, 62-74, 2021
5 2021 Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 PA Golovach, P Heggernes, D Kratsch, PT Lima, D Paulusma
Algorithmica 81 (7), 2795-2828, 2019
5 2019 On the maximum number of edges in chordal graphs of bounded degree and matching number JRS Blair, P Heggernes, PT Lima, D Lokshtanov
Algorithmica 84 (12), 3587-3602, 2022
4 2022 On the Parameterized Complexity of -Edge Colouring E Galby, PT Lima, D Paulusma, B Ries
arXiv preprint arXiv:1901.01861, 2019
4 2019 Treewidth is NP-complete on cubic graphs (and related results) HL Bodlaender, É Bonnet, L Jaffke, D Knop, PT Lima, M Milanič, ...
arXiv preprint arXiv:2301.10031, 2023
3 2023