Pages that link to "Item:Q2408556"
From MaRDI portal
The following pages link to Parameterized algorithms for graph partitioning problems (Q2408556):
Displaying 8 items.
- \((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)
- 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)
- (Q2945206) (redirect page) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
