C. Bäckström and I. Klein, Parallel non-binary planning in polynomial time, Proceedings IJCAI'1991, pp.268-273, 1991.

C. Bäckström and B. Nebel, PLANNING, Computational Intelligence, vol.7, issue.3, pp.625-655, 1995.
DOI : 10.1016/0004-3702(94)90005-1

R. I. Brafman and C. Domshlak, Structure and Complexity in Planning with Unary Operators, Journal of Artificial Intelligence Research, vol.18, pp.315-349, 2003.

R. I. Brafman and C. Domshlak, Factored Planning: How, When, and When Not, Proceedings of the 21st National Conference on AI, 2006.

T. Bylander, The computational complexity of propositional STRIPS planning, Artificial Intelligence, vol.69, issue.1-2, pp.165-204, 1994.
DOI : 10.1016/0004-3702(94)90081-7

H. Chen and O. Giménez, Causal graphs and structurally restricted planning, Proceedings of the 18th International Conference on Automated Planning and Scheduling, 2008.
DOI : 10.1016/j.jcss.2009.10.013

M. C. Cooper, F. Maris, and P. Régnier, Solving Temporally-Cyclic Planning Problems, 2010 17th International Symposium on Temporal Representation and Reasoning, pp.113-120, 2010.
DOI : 10.1109/TIME.2010.19

W. Cushing, S. Kambhampati, . Mausam, and D. S. Weld, When is Temporal Planning Really Temporal?, Proceedings of 20 th International Joint Conference on Artificial Intelligence, pp.1852-1859, 2007.

D. Mcdermott, PDDL, The Planning Domain Definition Language, 1998.

C. Domshlak and Y. Dinitz, Multi-agent off-line coordination: Structure and complexity, Proceedings of 6th European Conference on Planning, 2001.

K. Erol, D. S. Nau, and V. S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, Artificial Intelligence, vol.76, issue.1-2, pp.75-88, 1995.
DOI : 10.1016/0004-3702(94)00080-K

M. Fox and D. Long, PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains, Journal of Artificial Intelligence Research, vol.20, pp.61-124, 2003.

A. Gerevini and M. Cristani, On Finding a Solution in Temporal Constraint Satisfaction Problems, Proceedings of 15 th International Joint Conference on Artificial Intelligence, pp.1460-1465, 1997.

M. Ghallab, D. S. Nau, and P. Traverso, Automated Planning: Theory and Practice, 2004.

O. Giménez and A. Jonsson, The complexity of planning problems with simple causal graphs, Journal of AI Research, vol.31, pp.319-351, 2008.

P. Haslum, Reducing Accidental Complexity in Planning Problems, Proceedings of IJCAI'07, pp.1898-1903, 2007.

P. Haslum, A New Approach To Tractable Planning, Proceedings of ICAPS, 2008.

M. Helmert, Complexity results for standard benchmark domains in planning, Artificial Intelligence, vol.143, issue.2, pp.219-262, 2003.
DOI : 10.1016/S0004-3702(02)00364-8

M. Helmert, New Complexity Results for Classical Planning Benchmarks, Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, pp.52-61, 2006.

J. Hoffmann, Where Ignoring Delete Lists Works, Local Search Topology in Planning Benchmarks, Journal of Artificial Intelligence Research, vol.24, pp.685-758, 2005.

P. Jeavons and M. C. Cooper, Tractable constraints on ordered domains, Artificial Intelligence, vol.79, issue.2, pp.327-339, 1995.
DOI : 10.1016/0004-3702(95)00107-7

A. Jonsson, The Role of Macros in Tractable Planning Over Causal Graphs, Proceedings of the 20th International Joint Conference on Artificial Intelligence , IJCAI'2007, pp.1936-1941, 2007.

P. Jonsson and C. Bäckström, Tractable planning with state variables by exploiting structural restrictions, Proceedings of AAAI'1994, pp.998-1003, 1994.

P. Jonsson and C. Bäckström, Incremental Planning, New Directions in AI Planning: 3rd European Workshop on Planning, pp.79-90, 1995.

P. Jonsson and C. Bäckström, State-variable planning under structural restrictions: algorithms and complexity, Artificial Intelligence, vol.100, issue.1-2, pp.125-176, 1998.
DOI : 10.1016/S0004-3702(98)00003-4
URL : http://doi.org/10.1016/s0004-3702(98)00003-4

M. Katz and C. Domshlak, New Islands of Tractability of Cost-Optimal Planning, Journal of Artificial Intelligence Research, vol.32, pp.203-288, 2008.

C. A. Knoblock, Automatically generating abstractions for planning, Artificial Intelligence, vol.68, issue.2, pp.243-302, 1994.
DOI : 10.1016/0004-3702(94)90069-8

M. Koubarakis, Dense Time and Temporal Constraints with ?, Proceedings of 3 rd International Conference on Principles of Knowledge Representation and Reasoning, pp.24-35, 1992.

J. Rintanen, Complexity of concurrent temporal planning, Proceedings of the 17th International Conference on Automated Planning and Scheduling, ICAPS, pp.280-287, 2007.

J. Slaney and S. Thiébaux, Blocks World revisited, Artificial Intelligence, vol.125, issue.1-2, pp.119-153, 2001.
DOI : 10.1016/S0004-3702(00)00079-5
URL : http://doi.org/10.1016/s0004-3702(00)00079-5

V. Vidal and H. Geffner, Solving Simple Planning Problems with More Inference and No Search, Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP'05, pp.682-696, 2005.
DOI : 10.1007/11564751_50
URL : https://hal.archives-ouvertes.fr/hal-00397443

B. C. Williams and P. Nayak, A reactive planner for a model-based executive, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pp.1178-1185, 1997.