E. D. Demaine, Playing games with algorithms: Algorithmic combinatorial game theory, Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science (MFCS '01), volume 2136 of LNCS, pp.18-32, 2001.
DOI : 10.1017/cbo9780511807251.002
URL : http://arxiv.org/abs/cs/0106019

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized complexity . Undergraduate Texts in Computer Science, 2013.

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

L. Ferrari, P. Sankar, and J. Sklansky, Minimal rectangular partitions of digitized blobs, Computer Vision, Graphics, and Image Processing, pp.58-71, 1984.

F. V. Fomin and D. Kratsch, Exact exponential algorithms, 2010.
DOI : 10.1007/978-3-642-16533-7
URL : https://hal.archives-ouvertes.fr/hal-00085561

E. Friedman, Spiral galaxies puzzles are NP-complete, 2002.

R. A. Hearn and E. D. Demaine, Games, puzzles, and computation, AK Peters, 2009.

R. Kannan, Minkowski's Convex Body Theorem and Integer Programming, Mathematics of Operations Research, vol.12, issue.3, pp.415-440, 1987.
DOI : 10.1287/moor.12.3.415
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=2568&context=compsci

W. Mulzer and G. Rote, Minimum-weight triangulation is NP-hard, Journal of the ACM, vol.55, issue.2, 2008.
DOI : 10.1145/1346330.1346336
URL : http://arxiv.org/abs/cs/0601002

N. Robertson, D. P. Sanders, P. D. Seymour, and R. Thomas, The Four-Colour Theorem, Journal of Combinatorial Theory, Series B, vol.70, issue.1, pp.2-44, 1997.
DOI : 10.1006/jctb.1997.1750