Giacomo Paesani

According to our database, Giacomo Paesani authored at least 20 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev

Eur. J. Comb., March, 2024

Classifying subset feedback vertex set for H-free graphs.

Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski

Theor. Comput. Sci., 2024

Explaining Decisions in ML Models: a Parameterized Complexity Analysis.

Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider

CoRR, 2024

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding.

Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

A General Theoretical Framework for Learning Smallest Interpretable Models.

Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Learning Small Decision Trees for Data of Low Rank-Width.

Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

The Parameterized Complexity of Finding Concise Local Explanations.

Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Learning Small Decision Trees with Large Domain.

Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Computing subset transversals in <i>H</i>-free graphs.

Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Theor. Comput. Sci., 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

Bounding the mim-width of hereditary graph classes.

Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma

J. Graph Theory, 2022

2021

Graph transversals for hereditary graph classes : a complexity perspective

Giacomo Paesani

PhD thesis, 2021

Steiner trees for hereditary graph classes: A treewidth perspective.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Theor. Comput. Sci., 2021

2020

Connected Vertex Cover for (sP_1+P₅₎-Free Graphs.

Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Algorithmica, 2020

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.

Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski

Algorithmica, 2020

Computing Subset Transversals in H-Free Graphs.

Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Steiner Trees for Hereditary Graph Classes.

Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.

Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018

Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs.

Matthew Johnson, Giacomo Paesani, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Connected Vertex Cover for (sP₁+P₅)-Free Graphs.

Matthew Johnson, Giacomo Paesani, Daniël Paulusma

CoRR, 2017