The following pages link to Andrea Munaro (Q335347):
Displaying 22 items.
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- On contact graphs of paths on a grid (Q1725765) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Bounded clique cover of some sparse graphs (Q2359963) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
- Non-empty intersection of longest paths in \(H\)-free graphs (Q2692169) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Sublinear Longest Path Transversals (Q5009325) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Sublinear Longest Path Transversals (Q6340147) (← links)
- Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star (Q6522235) (← links)
- Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs (Q6523856) (← links)
- Polynomial-time approximation schemes for independent packing problems on fractionally tree-independence-number-fragile graphs (Q6620524) (← links)
- Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms (Q6762959) (← links)
