Pages that link to "Item:Q414887"

The following pages link to A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887):

Displaying 19 items.

• Exact algorithms for dominating set (Q411862) (← links)
• A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
• A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
• A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← 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)
• Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
• Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
• On the Number of Minimal Separators in Graphs (Q2827806) (← links)
• A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
• New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)
• $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
• Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
• Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
• Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
• Faster graph coloring in polynomial space (Q5925619) (← links)