Pages that link to "Item:Q4242660"

The following pages link to Parameterizing above Guaranteed Values: MaxSat and MaxCut (Q4242660):

Displaying 42 items.

• A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
• Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
• Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
• Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
• Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
• On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
• Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
• Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
• A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
• Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
• Parameterizing MAX SNP Problems Above Guaranteed Values (Q3499722) (← links)
• Minimum Leaf Out-Branching Problems (Q3511432) (← links)
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
• A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865) (← links)
• The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
• Exact Algorithms for MAX-SAT (Q4916231) (← links)
• Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
• (Q4993600) (← links)
• Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
• (Q5075790) (← links)
• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
• Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
• (Q5092402) (← links)
• Going Far from Degeneracy (Q5130907) (← links)
• Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
• Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
• APPROXIMATE BLOCK SORTING (Q5291300) (← links)
• MAX SAT approximation beyond the limits of polynomial-time approximation (Q5957907) (← links)
• Detours in directed graphs (Q6113279) (← links)
• Complexity of maximum cut on interval graphs (Q6174803) (← links)
• On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
• Long directed detours: reduction to 2-disjoint paths (Q6551717) (← links)
• The shortest path reconfiguration problem based on relaxation of reconfiguration rules (Q6575398) (← links)