The following pages link to Algorithms - ESA 2003 (Q5897248):
Displaying 9 items.
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Diameter and treewidth in minor-closed graph families (Q1578412) (← links)
- Diameter and treewidth in minor-closed graph families, revisited (Q1762990) (← links)
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) (← links)
- Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
- Local tree-width, excluded minors, and approximation algorithms (Q2494422) (← links)
- Locating and total dominating sets in trees (Q2495911) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Bidimensional Parameters and Local Treewidth (Q5317565) (← links)
