Structure in Approximation Classes, SIAM Journal on Computing, vol.28, issue.5, pp.1759-1782, 1999. ,
DOI : 10.1137/S0097539796304220
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
Approximation Algorithms for the Wafer to Wafer Integration Problem, Approximation and Online Algorithms (WAOA), pp.286-297, 2013. ,
DOI : 10.1007/978-3-642-38016-7_23
URL : https://hal.archives-ouvertes.fr/lirmm-00805063
Multi-dimensional vector assignment problems, Discrete Optimization, vol.14, pp.111-125, 2014. ,
DOI : 10.1016/j.disopt.2014.08.005
On the complexity of approximating kdimensional matching, Approximation, Randomization, and Combinatorial Optimization .. Algorithms and Techniques, pp.83-97, 2003. ,
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility, Algorithms?ESA 2013, pp.647-658, 2013. ,
DOI : 10.1007/978-3-642-40450-4_55
Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research, vol.8, issue.4, pp.538-548, 1983. ,
DOI : 10.1287/moor.8.4.538
Invitation to fixed-parameter algorithms, 2006. ,
DOI : 10.1093/acprof:oso/9780198566076.001.0001
Maximizing the functional yield of wafer-towafer 3-d integration, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp.1357-1362, 2009. ,
The design of approximation algorithms, 2011. ,
DOI : 10.1017/CBO9780511921735
Linear degree extractors and the inapproximability of max clique and chromatic number, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.681-690, 2006. ,
DOI : 10.1145/1132516.1132612