Giacomo Paesani

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 31

Top Topics

Undirected Graph

Top Venues

Theor. Comput. Sci.

Publications

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. 117 (2024)
Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees for Data of Low Rank-Width. AAAI (2024)
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
Explaining Decisions in ML Models: a Parameterized Complexity Analysis. CoRR (2024)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. 1003 (2024)
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR (2024)
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
A General Theoretical Framework for Learning Smallest Interpretable Models. AAAI (2024)
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP (2024)
Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
The Parameterized Complexity of Finding Concise Local Explanations. IJCAI (2023)
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees with Large Domain. IJCAI (2023)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR (2022)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying Subset Feedback Vertex Set for H-Free Graphs. WG (2022)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
-free graphs. Theor. Comput. Sci. 902 (2022)
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the mim-width of hereditary graph classes. J. Graph Theory 99 (1) (2022)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867 (2021)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR (2021)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS (2021)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
Computing Subset Transversals in H-Free Graphs. WG (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes. LATIN (2020)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
Computing Subset Transversals in H-Free Graphs. CoRR (2020)
Matthew Johnson, Giacomo Paesani, Daniël Paulusma
-Free Graphs. Algorithmica 82 (1) (2020)
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the Mim-Width of Hereditary Graph Classes. CoRR (2020)
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the Mim-Width of Hereditary Graph Classes. IPEC (2020)
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82 (10) (2020)
Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT (2019)
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR (2019)
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR (2019)
Matthew Johnson, Giacomo Paesani, Daniël Paulusma
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG (2018)
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS (2018)
Matthew Johnson, Giacomo Paesani, Daniël Paulusma
)-Free Graphs. CoRR (2017)