 | 2011 |
|---|
| 21 |       | Cédric Bentz,
Marie-Christine Costa,
Dominique de Werra,
Christophe Picouleau,
Bernard Ries:
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.
Electronic Notes in Discrete Mathematics 38: 129-134 (2011) |
| 20 | | Cédric Bentz:
On the hardness of finding near-optimal multicuts in directed acyclic graphs.
Theor. Comput. Sci. 412(39): 5325-5332 (2011) |
| 2010 |
|---|
| 19 | | Bernard Ries,
Cédric Bentz,
Christophe Picouleau,
Dominique de Werra,
Marie-Christine Costa,
Rico Zenklusen:
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.
Discrete Mathematics 310(1): 132-146 (2010) |
| 2009 |
|---|
| 18 | | Cédric Bentz:
On Planar and Directed Multicuts with few Source-Sink Pairs.
CTW 2009: 313-316 |
| 17 | | Cédric Bentz:
Disjoint paths in sparse graphs.
Discrete Applied Mathematics 157(17): 3558-3568 (2009) |
| 16 | | Cédric Bentz:
A simple algorithm for multicuts in planar graphs with outer terminals.
Discrete Applied Mathematics 157(8): 1959-1964 (2009) |
| 15 | | Rico Zenklusen,
Bernard Ries,
Christophe Picouleau,
Dominique de Werra,
Marie-Christine Costa,
Cédric Bentz:
Blockers and transversals.
Discrete Mathematics 309(13): 4306-4314 (2009) |
| 14 | | Cédric Bentz:
New results on planar and directed multicuts.
Electronic Notes in Discrete Mathematics 34: 207-211 (2009) |
| 13 | | Cédric Bentz,
Marie-Christine Costa,
Lucas Létocart,
Frédéric Roupin:
Multicuts and integral multiflows in rings.
European Journal of Operational Research 196(3): 1251-1254 (2009) |
| 12 | | Cédric Bentz,
Marie-Christine Costa,
Nicolas Derhy,
Frédéric Roupin:
Cardinality constrained and multicriteria (multi)cut problems.
J. Discrete Algorithms 7(1): 102-111 (2009) |
| 11 | | Cédric Bentz,
Marie-Christine Costa,
Christophe Picouleau,
Bernard Ries,
Dominique de Werra:
Degree-constrained edge partitioning in graphs arising from discrete tomography.
J. Graph Algorithms Appl. 13(2): 99-118 (2009) |
| 10 | | Cédric Bentz,
Christophe Picouleau:
Locally bounded k-colorings of trees.
RAIRO - Operations Research 43(1): 27-33 (2009) |
| 2008 |
|---|
| 9 | | Cédric Bentz:
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity.
4OR 6(1): 89-92 (2008) |
| 8 | | 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 | | 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 | | 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 | | 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 | | 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 | | Cédric Bentz:
The maximum integer multiterminal flow problem in directed graphs.
Oper. Res. Lett. 35(2): 195-200 (2007) |
| 2006 |
|---|
| 2 | | Cédric Bentz:
The Maximum Integer Multiterminal Flow Problem.
ICCSA (3) 2006: 738-747 |
| 2005 |
|---|
| 1 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page