PAESANI, GIACOMO
PAESANI, GIACOMO
DIPARTIMENTO DI INFORMATICA
A General Theoretical Framework for Learning Smallest Interpretable Models
2024 Ordyniak, Sebastian; Paesani, Giacomo; Rychlicki, Mateusz; Szeider, Stefan
A Tight Subexponential-time Algorithm for Two-Page Book Embedding
2024 Ganian, R; Mueller, H; Ordyniak, S; Paesani, G; Rychlicki, M
Bounding the mim-width of hereditary graph classes
2020 Brettell, N.; Horsfield, J.; Munaro, A.; Paesani, G.; Paulusma, D.
Bounding the mim-width of hereditary graph classes
2022 Brettell, N.; Horsfield, J.; Munaro, A.; Paesani, G.; Paulusma, D.
Classifying Subset Feedback Vertex Set for H-Free Graphs
2023 Paesani, G; Paulusma, D; Rzazewski, P
Classifying Subset Feedback Vertex Set for H-Free Graphs
2022 Paesani, G.; Paulusma, D.; Rzazewski, P.
Computing Subset Transversals in H-Free Graphs
2020 Brettell, N.; Johnson, M.; Paesani, G.; Paulusma, D.
Computing subset transversals in H-free graphs
2022 Brettell, N.; Johnson, M.; Paesani, G.; Paulusma, D.
Connected vertex cover for (sP1+ P5) -Free graphs
2018 Johnson, M.; Paesani, G.; Paulusma, D.
Connected Vertex Cover for (sP1+ P5) -Free Graphs
2020 Johnson, M.; Paesani, G.; Paulusma, D.
Explaining Decisions in ML Models: A Parameterized Complexity Analysis
2024 Ordyniak, Sebastian; Paesani, Giacomo; Rychlicki, Mateusz; Szeider, Stefan
FEEDBACK VERTEX SET AND EVEN CYCLE TRANSVERSAL FOR H -FREE GRAPHS: FINDING LARGE BLOCK GRAPHS
2022 Paesani, G.; Paulusma, D.; Rzazewski, P.
Feedback Vertex Set and even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs
2021 Paesani, G.; Paulusma, D.; Rzewski, P.
Feedback Vertex Set and even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs
2021 Paesani, G.; Paulusma, D.; Rzewski, P.
Finding d-Cuts in Probe H-Free Graphs
2025 Dabrowski, Konrad K.; Eagling-Vose, Tala; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
Finding d-Cuts in Probe H-Free Graphs
2025 Dabrowski, Konrad K.; Eagling-Vose, Tala; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
Independent transversals versus transversals
2019 Dabrowski, K. K.; Johnson, M.; Paesani, G.; Paulusma, D.; Zamaraev, V.
Learning Small Decision Trees for Data of Low Rank-Width
2024 Dabrowski, Konrad K.; Eiben, Eduard; Ordyniak, Sebastian; Paesani, Giacomo; Szeider, Stefan
Learning Small Decision Trees with Large Domain
2023 Eiben, E.; Ordyniak, S.; Paesani, G.; Szeider, S.
Learning Small Decision Trees with Large Domain
2023 Eiben, E.; Ordyniak, S.; Paesani, G.; Szeider, S.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| A General Theoretical Framework for Learning Smallest Interpretable Models | 2024 | Ordyniak, Sebastian; Paesani, Giacomo; Rychlicki, Mateusz; Szeider, Stefan | |
| A Tight Subexponential-time Algorithm for Two-Page Book Embedding | 2024 | Ganian, R; Mueller, H; Ordyniak, S; Paesani, G; Rychlicki, M | |
| Bounding the mim-width of hereditary graph classes | 2020 | Brettell, N.; Horsfield, J.; Munaro, A.; Paesani, G.; Paulusma, D. | |
| Bounding the mim-width of hereditary graph classes | 2022 | Brettell, N.; Horsfield, J.; Munaro, A.; Paesani, G.; Paulusma, D. | |
| Classifying Subset Feedback Vertex Set for H-Free Graphs | 2023 | Paesani, G; Paulusma, D; Rzazewski, P | |
| Classifying Subset Feedback Vertex Set for H-Free Graphs | 2022 | Paesani, G.; Paulusma, D.; Rzazewski, P. | |
| Computing Subset Transversals in H-Free Graphs | 2020 | Brettell, N.; Johnson, M.; Paesani, G.; Paulusma, D. | |
| Computing subset transversals in H-free graphs | 2022 | Brettell, N.; Johnson, M.; Paesani, G.; Paulusma, D. | |
| Connected vertex cover for (sP1+ P5) -Free graphs | 2018 | Johnson, M.; Paesani, G.; Paulusma, D. | |
| Connected Vertex Cover for (sP1+ P5) -Free Graphs | 2020 | Johnson, M.; Paesani, G.; Paulusma, D. | |
| Explaining Decisions in ML Models: A Parameterized Complexity Analysis | 2024 | Ordyniak, Sebastian; Paesani, Giacomo; Rychlicki, Mateusz; Szeider, Stefan | |
| FEEDBACK VERTEX SET AND EVEN CYCLE TRANSVERSAL FOR H -FREE GRAPHS: FINDING LARGE BLOCK GRAPHS | 2022 | Paesani, G.; Paulusma, D.; Rzazewski, P. | |
| Feedback Vertex Set and even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs | 2021 | Paesani, G.; Paulusma, D.; Rzewski, P. | |
| Feedback Vertex Set and even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs | 2021 | Paesani, G.; Paulusma, D.; Rzewski, P. | |
| Finding d-Cuts in Probe H-Free Graphs | 2025 | Dabrowski, Konrad K.; Eagling-Vose, Tala; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël | |
| Finding d-Cuts in Probe H-Free Graphs | 2025 | Dabrowski, Konrad K.; Eagling-Vose, Tala; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël | |
| Independent transversals versus transversals | 2019 | Dabrowski, K. K.; Johnson, M.; Paesani, G.; Paulusma, D.; Zamaraev, V. | |
| Learning Small Decision Trees for Data of Low Rank-Width | 2024 | Dabrowski, Konrad K.; Eiben, Eduard; Ordyniak, Sebastian; Paesani, Giacomo; Szeider, Stefan | |
| Learning Small Decision Trees with Large Domain | 2023 | Eiben, E.; Ordyniak, S.; Paesani, G.; Szeider, S. | |
| Learning Small Decision Trees with Large Domain | 2023 | Eiben, E.; Ordyniak, S.; Paesani, G.; Szeider, S. |