A parameterized perspective on packing paths of length two
- 23 May 2009
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 18 (4) , 319-341
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Parameterized Perspective on Packing Paths of Length Two2008
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel SizeSIAM Journal on Computing, 2007
- An approximation algorithm for maximum triangle packingDiscrete Applied Mathematics, 2006
- Approximation algorithms for some vehicle routing problemsDiscrete Applied Mathematics, 2005
- The k-Feature Set problem is W[2]-completeJournal of Computer and System Sciences, 2003
- Approximation algorithms for the test cover problemMathematical Programming, 2003
- Parameterized complexity of finding subgraphs with hereditary propertiesTheoretical Computer Science, 2002
- Parameterized Complexity1999
- An approximation algorithm for maximum packing of 3-edge pathsInformation Processing Letters, 1997
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973