A quadratic kernel for 3-set packing, International Conference on Theory and Applications of Models of Computation, pp.81-87, 2009. ,
Complexity and approximation: Combinatorial optimization problems and their approximability properties, 2012. ,
DOI : 10.1007/978-3-642-58412-1
On some tighter inapproximability results, International Colloquium on Automata, Languages, and Programming, pp.200-209, 1999. ,
Kernelization lower bounds by cross-composition, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.277-305, 2014. ,
A Min-Max Theorem on Feedback Vertex Sets, Mathematics of Operations Research, vol.27, issue.2, pp.361-371, 2002. ,
DOI : 10.1287/moor.27.2.361.328
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments, Combinatorics, Probability and Computing, vol.16, issue.01, pp.1-4, 2007. ,
DOI : 10.1017/S0963548306007887
URL : https://hal.archives-ouvertes.fr/lirmm-00140321
Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp.509-518, 2013. ,
DOI : 10.1109/FOCS.2013.61
URL : http://arxiv.org/abs/1304.1424
Kernelization of Packing Problems, Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, p.12, 2012. ,
DOI : 10.1137/1.9781611973099.6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.4445
Fundamentals of parameterized complexity, 2013. ,
The Vertex-Disjoint Triangles Problem, International Workshop on Graph- Theoretic Concepts in Computer Science, pp.26-37, 1998. ,
DOI : 10.1137/0212040
Weak Compositions and Their Applications to Polynomial Lower Bounds for Kernelization, Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pp.104-113, 2012. ,
DOI : 10.1137/1.9781611973099.9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.7757
Sparsification upper and lower bounds for graph problems and not-all-equal sat, Algorithmica, pp.1-26, 2015. ,
How to rank with few errors, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.95-103, 2007. ,
DOI : 10.1145/1250790.1250806
A 7/3-approximation for feedback vertex sets in tournaments, 24th Annual European Symposium on Algorithms , ESA 2016, pp.1-6714, 2016. ,
A Problem Kernelization for Graph Packing, International Conference on Current Trends in Theory and Practice of Computer Science, pp.401-412, 2009. ,
DOI : 10.1007/978-3-540-79228-4_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.6537
Properties of vertex packing and independence system polyhedra, Mathematical Programming, vol.6, issue.1, pp.48-61, 1974. ,
Optimization, approximation, and complexity classes, Journal of computer and system sciences, vol.43, issue.3, pp.425-440, 1991. ,