Cédric Bentz

Cédric Bentz, Denis Cornaz, Bernard Ries: Packing and covering with linear programming: A survey. European Journal of Operational Research 227(3): 409-422 (2013)

Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra: d-Transversals of stable sets and vertex covers in weighted bipartite graphs. J. Discrete Algorithms 17: 95-102 (2012)

Cédric Bentz: A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs. IPEC 2012: 109-119

Cédric Bentz: A polynomial-time algorithm for planar multicuts with few source-sink pairs. CoRR abs/1206.3999 (2012)

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)

Cédric Bentz: On the hardness of finding near-optimal multicuts in directed acyclic graphs. Theor. Comput. Sci. 412(39): 5325-5332 (2011)

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)

Cédric Bentz: A simple algorithm for multicuts in planar graphs with outer terminals. Discrete Applied Mathematics 157(8): 1959-1964 (2009)

Cédric Bentz: Disjoint paths in sparse graphs. Discrete Applied Mathematics 157(17): 3558-3568 (2009)

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)

Cédric Bentz: New results on planar and directed multicuts. Electronic Notes in Discrete Mathematics 34: 207-211 (2009)

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)

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)

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)

Cédric Bentz, Christophe Picouleau: Locally bounded k-colorings of trees. RAIRO - Operations Research 43(1): 27-33 (2009)

Cédric Bentz: On Planar and Directed Multicuts with few Source-Sink Pairs. CTW 2009: 313-316

Cédric Bentz: Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity. 4OR 6(1): 89-92 (2008)

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)

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)

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)

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)

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)

Cédric Bentz: The maximum integer multiterminal flow problem in directed graphs. Oper. Res. Lett. 35(2): 195-200 (2007)

Cédric Bentz: The Maximum Integer Multiterminal Flow Problem. ICCSA (3) 2006: 738-747

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)