Pages that link to "Item:Q5189527"

The following pages link to A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms (Q5189527):

Displaying 14 items.

• A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
• A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
• Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
• Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
• Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
• Bounds for the Twin-Width of Graphs (Q5043639) (← links)
• (Q5090992) (← links)
• Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
• The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
• Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)