Pages that link to "Item:Q2354313"

The following pages link to The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313):

Displaying 18 items.

• The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
• The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
• A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
• Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
• On the maximum weight minimal separator (Q2333804) (← links)
• Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
• The vertex separator problem: algorithms and computations (Q2487851) (← links)
• Algorithms and formulations for the minimum cut separator problem (Q2861519) (← links)
• On the Maximum Weight Minimal Separator (Q2988830) (← links)
• (Q4961733) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• (Q5090422) (← links)
• Parameterized Complexity of Safe Set (Q5119377) (← links)
• (Q5325265) (← links)
• A Separation Algorithm for <i>b</i>-Matching Degree-Sequence Polyhedra (Q5704115) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)