Follow
Giacomo Paesani
Giacomo Paesani
Research Fellow
Verified email at leeds.ac.uk
Title
Cited by
Cited by
Year
Connected Vertex Cover for (sP1+P5) -Free Graphs
M Johnson, G Paesani, D Paulusma
Algorithmica 82 (1), 20-40, 2020
17*2020
Bounding the mim‐width of hereditary graph classes
N Brettell, J Horsfield, A Munaro, G Paesani, D Paulusma
Journal of Graph Theory 99 (1), 117-151, 2022
152022
On cycle transversals and their connected variants in the absence of a small linear forest
KK Dabrowski, C Feghali, M Johnson, G Paesani, D Paulusma, ...
Algorithmica 82 (10), 2841-2866, 2020
122020
Computing Subset Transversals in H-Free Graphs
N Brettell, M Johnson, G Paesani, D Paulusma
International Workshop on Graph-Theoretic Concepts in Computer Science, 187-199, 2020
82020
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
KK Dabrowski, M Johnson, G Paesani, D Paulusma, V Zamaraev
arXiv preprint arXiv:1910.05254, 2019
72019
Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs
G Paesani, D Paulusma, P Rzążewski
arXiv preprint arXiv:2105.02736, 2021
62021
Steiner trees for hereditary graph classes: A treewidth perspective
HL Bodlaender, N Brettell, M Johnson, G Paesani, D Paulusma, ...
Theoretical Computer Science 867, 30-39, 2021
52021
Steiner trees for hereditary graph classes
HL Bodlaender, N Brettell, M Johnson, G Paesani, D Paulusma, ...
Latin American Symposium on Theoretical Informatics, 613-624, 2021
42021
Bounding the mim-width of hereditary graph classes. CoRR
N Brettell, J Horsfield, A Munaro, G Paesani, D Paulusma
arXiv preprint arXiv:2004.05018, 2020
22020
Independent transversals versus transversals.
KK Dabrowski, M Johnson, G Paesani, D Paulusma, V Zamaraev
Acta Mathematica Universitatis Comenianae. 88 (3), 585-591, 2019
22019
Classifying Subset Feedback Vertex Set for -Free Graphs
G Paesani, D Paulusma, P Rzążewski
arXiv preprint arXiv:2201.00430, 2022
12022
On cycle transversals and their connected variants in the absence of a small linear forest
C Feghali, M Johnson, G Paesani, D Paulusma
International Symposium on Fundamentals of Computation Theory, 258-273, 2019
12019
Graph Transversals for Hereditary Graph Classes: a Complexity Perspective
G Paesani
Durham University, 2021
2021
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
G Paesani, D Paulusma
2019
The system can't perform the operation now. Try again later.
Articles 1–14