Pages that link to "Item:Q2379999"
From MaRDI portal
The following pages link to Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999):
Displaying 13 items.
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← 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)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Partial Kernelization for Rank Aggregation: Theory and Experiments (Q3058689) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
