Pages that link to "Item:Q708228"

The following pages link to Improved upper bounds for vertex cover (Q708228):

Displaying 50 items.

• A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
• An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
• Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number (Q2150579) (← links)
• Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
• Winner determination algorithms for graph games with matching structures (Q2169988) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
• Parameterized algorithms for book embedding problems (Q2206870) (← links)
• Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• Backdoors to tractable answer set programming (Q2341833) (← links)
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
• Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
• New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
• Faster exact algorithms for some terminal set problems (Q2361353) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
• Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
• Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
• Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
• Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
• Vertex cover: Further observations and further improvements (Q2775891) (← links)
• On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
• A Parameterized Algorithm for Bounded-Degree Vertex Deletion (Q2817850) (← links)
• The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851) (← links)
• Strong Backdoors for Default Logic (Q2818000) (← links)
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
• Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
• Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• Parameterized Power Vertex Cover (Q3181050) (← links)
• A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
• Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
• A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
• (Q3455032) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
• (Q5009486) (← links)
• Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
• An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem (Q5038340) (← links)
• Decremental Optimization of Dominating Sets Under the Reconfiguration Framework (Q5041181) (← links)
• Parameterized Algorithms for Queue Layouts (Q5050001) (← links)