Pages that link to "Item:Q2343085"

The following pages link to Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085):

Displaying 10 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)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
• On the parameterized complexity of the Maximum Exposure Problem (Q2680233) (← links)
• Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
• Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
• Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
• Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
• FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)