The following pages link to Giacomo Paesani (Q1627180):
Displayed 18 items.
- Steiner trees for hereditary graph classes (Q2081657) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- (Q5005166) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5915592) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918592) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5919358) (← links)
- Classifying subset feedback vertex set for \(H\)-free graphs (Q6039438) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs (Q6113370) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest (Q6323047) (← links)
- On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal (Q6327025) (← links)
- Computing Subset Transversals in $H$-Free Graphs (Q6341605) (← links)