Pages that link to "Item:Q2775891"

The following pages link to Vertex Cover: Further Observations and Further Improvements (Q2775891):

Displaying 50 items.

• On a generalization of Nemhauser and Trotter's local optimization theorem (Q340561) (← links)
• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
• Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
• Lower bounds on kernelization (Q456702) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
• Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
• Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
• A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
• A linear kernel for a planar connected dominating set (Q534569) (← links)
• On the planarization of wireless sensor networks (Q548669) (← links)
• Separator-based data reduction for signed graph balancing (Q613659) (← links)
• Stability preserving transformations of graphs (Q646718) (← links)
• A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
• Improved upper bounds for vertex cover (Q708228) (← links)
• Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
• Dynamic parameterized problems (Q722546) (← links)
• An improved kernel size for rotation distance in binary trees (Q763531) (← links)
• An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
• Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
• Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
• Refined memorization for vertex cover (Q835007) (← links)
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
• Strong computational lower bounds via parameterized complexity (Q856413) (← links)
• On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
• An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
• On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
• Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
• Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
• Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955) (← links)
• Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
• Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
• A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
• A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
• Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
• Computing small partial coverings (Q1007552) (← links)
• On two techniques of combining branching and treewidth (Q1022343) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
• Algorithms for optimal outlier removal (Q1026234) (← links)
• On parameterized exponential time complexity (Q1029333) (← links)
• Struction revisited (Q1414580) (← links)
• A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
• A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
• On the existence of subexponential parameterized algorithms (Q1877709) (← links)
• Graph separators: A parameterized view (Q1877710) (← links)