The following pages link to Algorithms - ESA 2003 (Q5897270):
Displaying 13 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- Euler Digraphs (Q3120436) (← links)
- Planar Digraphs (Q3120437) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- (Q5136255) (← links)