Pages that link to "Item:Q2408556"

The following pages link to Parameterized algorithms for graph partitioning problems (Q2408556):

Displaying 17 items.

• On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
• A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
• A linear time algorithm for graph partition problems (Q1198016) (← links)
• \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel (Q1799226) (← links)
• Parameterized complexity of multi-node hubs (Q2084737) (← links)
• Parameterized algorithms for Graph Burning problem (Q2301751) (← links)
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• On the parameterized complexity of the Maximum Exposure Problem (Q2680233) (← links)
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
• (Q2945206) (redirect page) (← links)
• (Q3575418) (← links)
• Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
• Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters (Q5111220) (← links)
• A strong formulation for the graph partition problem (Q6068542) (← links)
• Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
• FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)