I. Adler, Directed tree-width examples, Journal of Combinatorial Theory, Series B, vol.97, issue.5, pp.718-725, 2007.
DOI : 10.1016/j.jctb.2006.12.006
URL : http://doi.org/10.1016/j.jctb.2006.12.006

J. Barát, Directed Path-width and Monotonicity in Digraph Searching, Graphs and Combinatorics, vol.22, issue.2, pp.161-172, 2006.
DOI : 10.1007/s00373-005-0627-y

D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, and J. Obdrzálek, The dag-width of directed graphs, Journal of Combinatorial Theory, Series B, vol.102, issue.4, pp.900-923, 2012.
DOI : 10.1016/j.jctb.2012.04.004

D. Bienstock and P. Seymour, Monotonicity in graph searching, Journal of Algorithms, vol.12, issue.2, pp.239-245, 1991.
DOI : 10.1016/0196-6774(91)90003-H
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.7326

N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse, Tradeoffs in process strategy games with application in the WDM reconfiguration problem, Theoretical Computer Science, vol.412, issue.35, pp.4675-4687, 2011.
DOI : 10.1016/j.tcs.2011.05.002
URL : https://hal.archives-ouvertes.fr/inria-00495443

D. Coudert, F. Huc, and D. Mazauric, A Distributed Algorithm for Computing the Node Search Number in Trees, Algorithmica, vol.47, issue.1, pp.158-190, 2012.
DOI : 10.1007/s00453-011-9524-3
URL : https://hal.archives-ouvertes.fr/inria-00587819

D. Coudert and J. Sereni, Characterization of graphs and digraphs with small process numbers, Discrete Applied Mathematics, vol.159, issue.11, pp.1094-1109, 2011.
DOI : 10.1016/j.dam.2011.03.010

F. Fomin and D. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040
URL : http://doi.org/10.1016/j.tcs.2008.02.040

R. Ganian, P. Hlinený, J. Kneis, D. Meister, J. Obdrzálek et al., Are there any good digraph width measures?, 5th Int. Symp. on Parameterized and Exact Computation, pp.135-146, 2010.
DOI : 10.1007/978-3-642-17493-3_14
URL : http://arxiv.org/abs/1004.1485

P. Hunter, Losing the +1: Directed path-width games are monotone, 2006.

P. Hunter and S. Kreutzer, Digraph measures: Kelly decompositions, games, and orderings, Theoretical Computer Science, vol.399, issue.3, pp.206-219, 2008.
DOI : 10.1016/j.tcs.2008.02.038
URL : http://doi.org/10.1016/j.tcs.2008.02.038

T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed Tree-Width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001.
DOI : 10.1006/jctb.2000.2031
URL : http://doi.org/10.1006/jctb.2000.2031

M. Kirousis and C. Papadimitriou, Searching and pebbling, Theoretical Computer Science, vol.47, pp.205-218, 1986.
DOI : 10.1016/0304-3975(86)90146-5
URL : http://doi.org/10.1016/0304-3975(86)90146-5

S. Kreutzer and S. Ordyniak, Digraph decompositions and monotonicity in digraph searching, CoRR abs/0802, p.2228, 2008.

N. Nisse and R. P. Soares, On the Monotonicity of Process Number
URL : https://hal.archives-ouvertes.fr/hal-00745587

P. D. Seymour and R. Thomas, Graph Searching and a Min-Max Theorem for Tree-Width, Journal of Combinatorial Theory, Series B, vol.58, issue.1, pp.22-33, 1993.
DOI : 10.1006/jctb.1993.1027
URL : http://doi.org/10.1006/jctb.1993.1027

B. Yang and Y. Cao, On the Monotonicity of Weak Searching, pp.52-61, 2008.
DOI : 10.1007/978-3-540-69733-6_6