Pages that link to "Item:Q2196605"
From MaRDI portal
The following pages link to On the tractability of optimization problems on \(H\)-graphs (Q2196605):
Displaying 17 items.
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- (Q5009468) (← links)
- (Q5092403) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Recognizing Proper Tree-Graphs (Q6089652) (← links)
- (Q6089669) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
