| 2008 |
|---|
| 9 | EE | Cédric Bentz:
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity.
4OR 6(1): 89-92 (2008) |
| 8 | EE | Cédric Bentz:
On the complexity of the multicut problem in bounded tree-width graphs and digraphs.
Discrete Applied Mathematics 156(10): 1908-1917 (2008) |
| 7 | EE | Cédric Bentz,
Marie-Christine Costa,
Dominique de Werra,
Christophe Picouleau,
Bernard Ries:
On a graph coloring problem arising from discrete tomography.
Networks 51(4): 256-267 (2008) |
| 2007 |
|---|
| 6 | EE | Cédric Bentz,
Marie-Christine Costa,
Lucas Létocart,
Frédéric Roupin:
Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69].
European Journal of Operational Research 177(2): 1312 (2007) |
| 5 | EE | Cédric Bentz,
Marie-Christine Costa,
Christophe Picouleau,
Maria Zrikem:
The shortest multipaths problem in a capacitated dense channel.
European Journal of Operational Research 178(3): 926-931 (2007) |
| 4 | EE | Cédric Bentz,
Marie-Christine Costa,
Frédéric Roupin:
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs.
J. Discrete Algorithms 5(1): 36-54 (2007) |
| 3 | EE | Cédric Bentz:
The maximum integer multiterminal flow problem in directed graphs.
Oper. Res. Lett. 35(2): 195-200 (2007) |
| 2006 |
|---|
| 2 | EE | Cédric Bentz:
The Maximum Integer Multiterminal Flow Problem.
ICCSA (3) 2006: 738-747 |
| 2005 |
|---|
| 1 | EE | Cédric Bentz:
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs.
Electronic Notes in Discrete Mathematics 22: 55-60 (2005) |
