Giacomo Paesani

42 papers A* 6B 10Journal 24Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A General Theoretical Framework for Learning Smallest Interpretable Models.
Artif. Intell.
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2025 J jnl
Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I).
CoRR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2025 J jnl
Finding
CoRR
Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2025 B conf
Finding d-Cuts in Probe H-Free Graphs.
FCT
Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2025 J jnl
The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs.
CoRR
Tiziana Calamoneri, Federico Corò, Giacomo Paesani
2025 B conf
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs.
FCT
Tiziana Calamoneri, Federico Corò, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani
2025 J jnl
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs.
CoRR
Tiziana Calamoneri, Federico Corò, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani
2024 A* conf
A General Theoretical Framework for Learning Smallest Interpretable Models.
AAAI
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 A* conf
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding.
ICALP
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024 J jnl
A Tight Subexponential-time Algorithm for Two-Page Book Embedding.
CoRR
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024 J jnl
Classifying subset feedback vertex set for H-free graphs.
Theor. Comput. Sci.
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2024 A* conf
Explaining Decisions in ML Models: A Parameterized Complexity Analysis.
KR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 J jnl
Explaining Decisions in ML Models: a Parameterized Complexity Analysis.
CoRR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 A* conf
Learning Small Decision Trees for Data of Low Rank-Width.
AAAI
Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2024 J jnl
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.
Eur. J. Comb.
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2024 — conf
Toward a Unified Graph-Based Representation of Medical Data for Precision Oncology Medicine.
CIBB
Davide Belluomo, Tiziana Calamoneri, Giacomo Paesani, Ivano Salvo
2024 J jnl
Toward a Unified Graph-Based Representation of Medical Data for Precision Oncology Medicine.
CoRR
Davide Belluomo, Tiziana Calamoneri, Giacomo Paesani, Ivano Salvo
2023 A* conf
Learning Small Decision Trees with Large Domain.
IJCAI
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2023 A* conf
The Parameterized Complexity of Finding Concise Local Explanations.
IJCAI
Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2022 J jnl
Bounding the mim-width of hereditary graph classes.
J. Graph Theory
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
2022 B conf
Classifying Subset Feedback Vertex Set for H-Free Graphs.
WG
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022 J jnl
Classifying Subset Feedback Vertex Set for H-Free Graphs.
CoRR
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2022 J jnl
Computing subset transversals in
Theor. Comput. Sci.
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2022 J jnl
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs.
SIAM J. Discret. Math.
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2021 B conf
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs.
MFCS
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2021 J jnl
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs.
CoRR
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2021 — —
Graph transversals for hereditary graph classes : a complexity perspective
Giacomo Paesani
2021 J jnl
Steiner trees for hereditary graph classes: A treewidth perspective.
Theor. Comput. Sci.
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020 B conf
Bounding the Mim-Width of Hereditary Graph Classes.
IPEC
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
2020 J jnl
Bounding the Mim-Width of Hereditary Graph Classes.
CoRR
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
2020 B conf
Computing Subset Transversals in H-Free Graphs.
WG
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020 J jnl
Computing Subset Transversals in H-Free Graphs.
CoRR
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020 J jnl
Connected Vertex Cover for (sP
Algorithmica
Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020 J jnl
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.
Algorithmica
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2020 B conf
Steiner Trees for Hereditary Graph Classes.
LATIN
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020 J jnl
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective.
CoRR
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2019 B conf
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.
FCT
Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2019 J jnl
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.
CoRR
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2019 J jnl
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal.
CoRR
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2018 B conf
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs.
WG
Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2018 B conf
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal.
MFCS
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2017 J jnl
Connected Vertex Cover for (sP
CoRR
Matthew Johnson, Giacomo Paesani, Daniël Paulusma