Giacomo Paesani

activity

20172026

most citedOn the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

1 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.AI2025

Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I)

Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki +1

This paper presents a comprehensive theoretical investigation into the parameterized complexity of explanation problems in various machine learning (ML) models. Contrary to the pre…

cs.DS2025

Finding $d$ -Cuts in Probe $H$ -Free Graphs

Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson +2

For an integer $d \geq 1$ , the $d$ -Cut problem is that of deciding whether a graph has an edge cut in which each vertex is adjacent to at most $d$ vertices on the opposite side of t…

Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I)

Finding d-Cuts in Probe H-Free Graphs

Finding $d$ -Cuts in Probe $H$ -Free Graphs