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
On digraph coloring problems and treewidth duality, 2006. ,
DOI : 10.1016/j.ejc.2007.11.004
URL : http://doi.org/10.1016/j.ejc.2007.11.004
On the complexity of a class of combinatorial optimization problems with uncertainty, Mathematical Programming, vol.90, issue.2, pp.263-272, 2001. ,
DOI : 10.1007/PL00011424
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
Optimal Reduction of Two-Terminal Directed Acyclic Graphs, SIAM Journal on Computing, vol.21, issue.6, pp.1112-1129, 1992. ,
DOI : 10.1137/0221065
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
Graphs and algorithms, 1984. ,
URL : https://hal.archives-ouvertes.fr/hal-01304880
A Structural View on Parameterizing Problems: Distance from Triviality, LNCS, vol.3162, 2004. ,
DOI : 10.1007/978-3-540-28639-4_15
The robust shortest path problem with interval data, 2001. ,
Minimizing maximal regret in the linear assignment problems with interval costs, Instytut Matematyki Wroclaw, 2004. ,
An approximation algorithm for interval data minmax regret combinatorial optimization problems, Inf, Proc. L. 97, pp.177-180, 2006. ,
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
Robust Discrete Optimization and Its Applications, 1997. ,
DOI : 10.1007/978-1-4757-2620-6
Non deterministic polynomial optimisation problems and their approximation, Theoretical Computer Science, vol.95, pp.251-277, 1981. ,
DOI : 10.1007/3-540-08342-1_29
The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982. ,
DOI : 10.1137/0211023