Pages that link to "Item:Q5428823"
From MaRDI portal
The following pages link to Parameterized Approximability of the Disjoint Cycle Problem (Q5428823):
Displaying 15 items.
- Finding a subdivision of a digraph (Q476873) (← links)
- Parameterized approximation of dominating set problems (Q975529) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- On the Cycle Augmentation Problem: hardness and approximation algorithms (Q2193089) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles (Q2315580) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Euler Digraphs (Q3120436) (← links)
- Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
- Parameterized Algorithms for List K-Cycle (Q4636569) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond (Q6083603) (← links)
