Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs. - Cédric Bentz (Electron. Notes Discret. Math., 2005)

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

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2007)

The shortest multipaths problem in a capacitated dense channel. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Maria Zrikem (Eur. J. Oper. Res., 2007)

Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. - Cédric Bentz; Marie-Christine Costa; Frédéric Roupin (J. Discrete Algorithms, 2007)

The maximum integer multiterminal flow problem in directed graphs. - Cédric Bentz (Oper. Res. Lett., 2007)

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

On the complexity of the multicut problem in bounded tree-width graphs and digraphs. - Cédric Bentz (Discret. Appl. Math., 2008)

On a graph coloring problem arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Networks, 2008)

On Planar and Directed Multicuts with few Source-Sink Pairs. - Cédric Bentz (CTW, 2009)

A simple algorithm for multicuts in planar graphs with outer terminals. - Cédric Bentz (Discret. Appl. Math., 2009)

Disjoint paths in sparse graphs. - Cédric Bentz (Discret. Appl. Math., 2009)

Blockers and transversals. - Rico Zenklusen; Bernard Ries; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Cédric Bentz (Discret. Math., 2009)

New results on planar and directed multicuts. - Cédric Bentz (Electron. Notes Discret. Math., 2009)

Multicuts and integral multiflows in rings. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2009)

Cardinality constrained and multicriteria (multi)cut problems. - Cédric Bentz; Marie-Christine Costa; Nicolas Derhy; Frédéric Roupin (J. Discrete Algorithms, 2009)

Degree-constrained edge partitioning in graphs arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Graph Algorithms Appl., 2009)

Locally bounded k-colorings of trees. - Cédric Bentz; Christophe Picouleau (RAIRO Oper. Res., 2009)

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. - Bernard Ries; Cédric Bentz; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Rico Zenklusen (Discret. Math., 2010)

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2011)

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

A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs. - Cédric Bentz (IPEC, 2012)

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

Steiner Problems with Limited Number of Branching Nodes. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (SIROCCO, 2013)

Packing and covering with linear programming: A survey. - Cédric Bentz; Denis Cornaz; Bernard Ries (Eur. J. Oper. Res., 2013)

Directed Steiner Tree with Branching Constraint. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (COCOON, 2014)

Blockers for the Stability Number and the Chromatic Number. - Cristina Bazgan; Cédric Bentz; Christophe Picouleau; Bernard Ries (Graphs Comb., 2015)

An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (Inf. Process. Lett., 2015)

A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem. - Cédric Bentz; Pierre Le Bodic (CoRR, 2016)

Directed Steiner trees with diffusion costs. - Dimitri Watel; Marc-Antoine Weisser; Cédric Bentz; Dominique Barth (J. Comb. Optim., 2016)

Exact and approximation algorithms for some packing and covering problems in graphs. - Cédric Bentz (2017)

Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees. - Cédric Bentz (CoRR, 2017)

Robust capacitated trees and networks with uniform demands. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (CoRR, 2018)

Formulations for designing robust networks. An application to wind power collection. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (Electron. Notes Discret. Math., 2018)

An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face. - Cédric Bentz (Algorithmica, 2019)

Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees. - Cédric Bentz (Theor. Comput. Sci., 2019)

On the edge capacitated Steiner tree problem. - Cédric Bentz; Marie-Christine Costa; Alain Hertz (Discret. Optim., 2020)

Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth. - Cédric Bentz; Pierre Le Bodic (Theor. Comput. Sci., 2020)

Robust capacitated Steiner trees and networks with uniform demands. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (Networks, 2023)

Optimization of battery management in telecommunications networks under energy market incentives. - Isaias Faria Silva; Cédric Bentz; Mustapha Bouhtou; Matthieu Chardy; Safia Kedad-Sidhoum (Ann. Oper. Res., 2024)