| Intersection of longest paths in graph classes MR Cerioli, PT Lima Discrete Applied Mathematics 281, 96-105, 2020 | 25* | 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 | 21* | 2021 |
| XNLP-completeness for parameterized problems on graphs with a linear structure HL Bodlaender, C Groenland, H Jacob, L Jaffke, PT Lima Algorithmica, 1-42, 2024 | 19 | 2024 |
| Parameterized aspects of strong subgraph closure PA Golovach, P Heggernes, AL Konstantinidis, PT Lima, C Papadopoulos Algorithmica 82 (7), 2006-2038, 2020 | 17 | 2020 |
| 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 | 16 | 2018 |
| Transversals of longest paths MR Cerioli, CG Fernandes, R Gómez, J Gutiérrez, PT Lima Discrete Mathematics 343 (3), 111717, 2020 | 15 | 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 | 13 | 2021 |
| Well-partitioned chordal graphs J Ahn, L Jaffke, O Kwon, PT Lima Discrete Mathematics 345 (10), 112985, 2022 | 11 | 2022 |
| Finding connected secluded subgraphs PA Golovach, P Heggernes, PT Lima, P Montealegre Journal of Computer and System Sciences 113, 101-124, 2020 | 11 | 2020 |
| Classifying k-edge colouring for H-free graphs E Galby, PT Lima, D Paulusma, B Ries Information Processing Letters 146, 39-43, 2019 | 10 | 2019 |
| 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 | 9 | 2023 |
| b-Coloring Parameterized by Clique-Width L Jaffke, PT Lima, D Lokshtanov Theory of Computing Systems 68 (4), 1049-1081, 2024 | 8 | 2024 |
| Tree decompositions meet induced matchings: beyond Max Weight Independent Set PT Lima, M Milanič, P Muršič, K Okrasa, P Rzążewski, K Štorgel arXiv preprint arXiv:2402.15834, 2024 | 8 | 2024 |
| 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 | 8 | 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 | 7 | 2023 |
| Taming graphs with no large creatures and skinny ladders J Gajarský, L Jaffke, PT de Lima, J Masaříková, M Pilipczuk, P Rzążewski, ... SIAM Journal on Discrete Mathematics 38 (4), 3140-3149, 2024 | 6 | 2024 |
| 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 | 6 | 2022 |
| 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 |
| 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 |
