Connected Vertex Cover for (sP1+P5)-Free Graphs. - Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (CoRR, 2017)

Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. - Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (WG, 2018)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (FCT, 2019)

Steiner Trees for Hereditary Graph Classes. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (LATIN, 2020)

Computing Subset Transversals in H-Free Graphs. - Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (WG, 2020)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (Algorithmica, 2020)

Connected Vertex Cover for (sP1+P5)-Free Graphs. - Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (Algorithmica, 2020)

Steiner trees for hereditary graph classes: A treewidth perspective. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (Theor. Comput. Sci., 2021)

Graph transversals for hereditary graph classes : a complexity perspective - Giacomo Paesani (2021)

Bounding the mim-width of hereditary graph classes. - Nick Brettell; Jake Horsfield; Andrea Munaro; Giacomo Paesani; Daniël Paulusma (J. Graph Theory, 2022)

Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. - Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (SIAM J. Discret. Math., 2022)

Computing subset transversals in H-free graphs. - Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (Theor. Comput. Sci., 2022)

Learning Small Decision Trees with Large Domain. - Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (IJCAI, 2023)

The Parameterized Complexity of Finding Concise Local Explanations. - Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (IJCAI, 2023)

Learning Small Decision Trees for Data of Low Rank-Width. - Konrad K. Dabrowski; Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (AAAI, 2024)

A General Theoretical Framework for Learning Smallest Interpretable Models. - Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki; Stefan Szeider (AAAI, 2024)

Toward a Unified Graph-Based Representation of Medical Data for Precision Oncology Medicine. - Davide Belluomo; Tiziana Calamoneri; Giacomo Paesani; Ivano Salvo (CIBB, 2024)

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. - Robert Ganian; Haiko Müller; Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki (ICALP, 2024)

Explaining Decisions in ML Models: A Parameterized Complexity Analysis. - Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki; Stefan Szeider (KR, 2024)

Classifying subset feedback vertex set for H-free graphs. - Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (Theor. Comput. Sci., 2024)

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. - Konrad K. Dabrowski; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Viktor Zamaraev (Eur. J. Comb., 2024)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs. - Tiziana Calamoneri; Federico Corò; Giacomo Paesani (CoRR, 2025)

Finding d-Cuts in Probe H-Free Graphs. - Konrad K. Dabrowski; Tala Eagling-Vose; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (CoRR, 2025)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs. - Tiziana Calamoneri; Federico Corò; Neeldhara Misra; Saraswati Girish Nanoti; Giacomo Paesani (CoRR, 2025)