I. D. Aron and P. Van-hentenryck, On the complexity of the robust spanning tree problem with interval data, Operations Research Letters, vol.32, issue.1, pp.36-40, 2004.
DOI : 10.1016/S0167-6377(03)00058-0

A. Atserias, On digraph coloring problems and treewidth duality, 2006.
DOI : 10.1109/lics.2005.31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.8200

I. Averbakh, On the complexity of a class of combinatorial optimization problems with uncertainty, Mathematical Programming, pp.263-272, 2001.
DOI : 10.1007/PL00011424

I. Averbakh and V. Lebedev, Interval data minmax regret network optimization problems, Discrete Applied Mathematics, vol.138, issue.3, pp.289-301, 2004.
DOI : 10.1016/S0166-218X(03)00462-1
URL : http://doi.org/10.1016/s0166-218x(03)00462-1

W. W. Bein, J. Kamburowski, and M. F. Stallmann, Optimal Reduction of Two-Terminal Directed Acyclic Graphs, SIAM Journal on Computing, vol.21, issue.6, pp.1112-1129, 1992.
DOI : 10.1137/0221065
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.7263

U. Bertele and F. Brioschi, Nonserial Dynamic Programming, p.12, 1972.

H. L. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

B. Escoffier, J. Monnot, and O. Spanjaard, Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality, LAMSADE, 2007.
DOI : 10.1007/978-3-540-77566-9_24
URL : https://hal.archives-ouvertes.fr/hal-00179399

J. Guo, F. Hüffner, and R. Niedermeier, A Structural View on Parameterizing Problems: Distance from Triviality, IWPEC 2004, pp.162-173, 2004.
DOI : 10.1007/978-3-540-28639-4_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.7757

O. E. Karasan, M. C. Pinar, and H. Yaman, The robust shortest path problem with interval data, 2001.

A. Kasperski and P. Zielinski, Minimizing maximal regret in the linear assignment problems with interval costs, 2004.

A. Kasperski and P. Zielinski, An approximation algorithm for interval data minmax regret combinatorial optimization problems, Information Processing Letters, vol.97, issue.5, pp.177-180, 2006.
DOI : 10.1016/j.ipl.2005.11.001

A. Kasperski and P. Zielinski, The robust shortest path problem in series???parallel multidigraphs with interval data, Operations Research Letters, vol.34, issue.1, pp.69-76, 2006.
DOI : 10.1016/j.orl.2005.01.008

P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications, 1997.
DOI : 10.1007/978-1-4757-2620-6

A. Paz and S. Moran, Non deterministic polynomial optimisation problems and their approximation, Theoretical Computer Science, vol.95, pp.251-277, 1981.
DOI : 10.1007/978-3-7091-2748-3_1

J. Valdes, R. Tarjan, and E. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.
DOI : 10.1137/0211023