The following pages link to STACS 2004 (Q5309687):
Displaying 10 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- Branchwidth of chordal graphs (Q967314) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- New upper bounds on the decomposability of planar graphs (Q3376690) (← links)
- (Q5009489) (← links)
