Giacomo Paesani
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
15
Venues
8
Active years
2018–2025
Best venue rank
A*
Where they publish
Papers
15 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | FCT | m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs. | Tiziana Calamoneri, Federico Cor, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani |
| 2025 | FCT | Finding d-Cuts in Probe H-Free Graphs. | Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2024 | AAAI | Learning Small Decision Trees for Data of Low Rank-Width. | Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2024 | AAAI | A General Theoretical Framework for Learning Smallest Interpretable Models. | Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider |
| 2024 | ICALP | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. | Robert Ganian, Haiko Mller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki |
| 2024 | KR | Explaining Decisions in ML Models: A Parameterized Complexity Analysis. | Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider |
| 2023 | IJCAI | Learning Small Decision Trees with Large Domain. | Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2023 | IJCAI | The Parameterized Complexity of Finding Concise Local Explanations. | Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2022 | WG | Classifying Subset Feedback Vertex Set for H-Free Graphs. | Giacomo Paesani, Danil Paulusma, Pawel Rzazewski |
| 2021 | MFCS | Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. | Giacomo Paesani, Danil Paulusma, Pawel Rzazewski |
| 2020 | LATIN | Steiner Trees for Hereditary Graph Classes. | Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma, Erik Jan van Leeuwen |
| 2020 | WG | Computing Subset Transversals in H-Free Graphs. | Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2019 | FCT | On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. | Carl Feghali, Matthew Johnson, Giacomo Paesani, Danil Paulusma |
| 2018 | MFCS | On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. | Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Danil Paulusma, Viktor Zamaraev |
| 2018 | WG | Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. | Matthew Johnson, Giacomo Paesani, Danil Paulusma |