Pages that link to "Item:Q5756684"

The following pages link to Improved Parameterized Upper Bounds for Vertex Cover (Q5756684):

Displaying 37 items.

• Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• Parameterized proof complexity (Q451111) (← links)
• Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
• Finding vertex-surjective graph homomorphisms (Q715053) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• Parameterized algorithm for eternal vertex cover (Q765521) (← links)
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
• On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• Exponential-time approximation of weighted set cover (Q989538) (← links)
• On parameterized exponential time complexity (Q1029333) (← links)
• Parameterized learnability of juntas (Q1034613) (← links)
• Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
• Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
• Fixed-parameter evolutionary algorithms and the vertex cover problem (Q1949737) (← links)
• Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
• Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
• On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
• Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
• Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
• Iterative compression and exact algorithms (Q2268862) (← links)
• Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
• Solving \#SAT using vertex covers (Q2464035) (← links)
• Vertex cover: Further observations and further improvements (Q2775891) (← links)
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
• Proper Interval Vertex Deletion (Q3058706) (← links)
• (Q3455032) (← links)
• Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
• New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
• Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
• The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
• Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
• Parameterized Algorithms for Generalized Domination (Q5505650) (← links)
• Safe sets and in-dominating sets in digraphs (Q6153473) (← links)