E. D. Demaine, Playing games with algorithms: Algorithmic combinatorial game theory, Proc. 26th MFCS, pp.18-32

. Springer, Available at http://arxiv.org/abs/cs, p.106019, 2001.

R. G. Downey and M. R. Fellows, Fundamentals of parameterized complexity, 2012.
DOI : 10.1007/978-1-4471-5559-1

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.
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

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