Pages that link to "Item:Q4074668"

The following pages link to Vertex packings: Structural properties and algorithms (Q4074668):

Displaying 50 items.

• Graph separators: A parameterized view (Q1877710) (← links)
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
• Parametric formulation of the general integer linear programming problem (Q1919968) (← links)
• Critical independent sets and König-Egerváry graphs (Q1926061) (← links)
• Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
• A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
• Fixed-parameter evolutionary algorithms and the vertex cover problem (Q1949737) (← links)
• Pseudo-Hamiltonian-connected graphs (Q1971217) (← links)
• Relaxing the strong triadic closure problem for edge strength inference (Q1987174) (← links)
• The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP (Q2011611) (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
• On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
• The general graph matching game: approximate core (Q2078093) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Dynamic node packing (Q2097666) (← links)
• Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
• On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
• Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
• New results relating independence and matchings (Q2151222) (← links)
• Reoptimization of parameterized problems (Q2170282) (← links)
• Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
• The optimal statistical median of a convex set of arrays (Q2271158) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
• Integrality gap of the vertex cover linear programming relaxation (Q2294318) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• Tractability of König edge deletion problems (Q2333799) (← links)
• A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
• A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
• Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
• Finding near-optimal independent sets at scale (Q2401330) (← links)
• Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
• Additive stabilizers for unstable graphs (Q2419360) (← links)
• Vertex cover in conflict graphs (Q2424881) (← links)
• Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
• Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
• Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
• A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
• Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
• Berge's theorem for the maximum charge problem (Q2506824) (← links)
• Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
• A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• On unicyclic graphs with uniquely restricted maximum matchings (Q2637732) (← links)
• Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• Complementation in T-perfect graphs (Q2672429) (← links)
• \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
• Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)