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 | 16* | 2021 |

Parameterized aspects of strong subgraph closure PA Golovach, P Heggernes, AL Konstantinidis, PT Lima, C Papadopoulos Algorithmica 82 (7), 2006-2038, 2020 | 14 | 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 |

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 | 13 | 2018 |

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 | 10 | 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 | 9 | 2022 |

Finding connected secluded subgraphs PA Golovach, P Heggernes, PT Lima, P Montealegre Journal of Computer and System Sciences 113, 101-124, 2020 | 9 | 2020 |

Classifying k-edge colouring for H-free graphs E Galby, PT Lima, D Paulusma, B Ries Information Processing Letters 146, 39-43, 2019 | 8 | 2019 |

*b*-Coloring Parameterized by Clique-WidthL Jaffke, PT Lima, D Lokshtanov Theory of Computing Systems, 1-33, 2023 | 7 | 2023 |

Well-partitioned chordal graphs J Ahn, L Jaffke, O Kwon, PT Lima Discrete Mathematics 345 (10), 112985, 2022 | 7 | 2022 |

Well-partitioned chordal graphs: obstruction set and disjoint paths J Ahn, L Jaffke, O Kwon, PT Lima Graph-Theoretic Concepts in Computer Science: 46th International Workshop …, 2020 | 6 | 2020 |

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 | 6 | 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 | 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 |

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 | 4 | 2023 |

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 |

A complexity dichotomy for critical values of the b-chromatic number of graphs L Jaffke, PT Lima Theoretical Computer Science 815, 182-196, 2020 | 3 | 2020 |

On the Parameterized Complexity of -Edge Colouring E Galby, PT Lima, D Paulusma, B Ries arXiv preprint arXiv:1901.01861, 2019 | 3 | 2019 |