|
 
|
Cédric Bentz
cnam.frProjets
Publications
2019
- [Ben19a] C. Bentz. "Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees", Theoretical Computer Science, pp. (accepted; to appear), 2019
- [Ben19] C. Bentz. "An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face", Algorithmica, vol. 81(1), pp. 224-237, 2019, (doi:10.1007/s00453-018-0443-4)
Revue Internationale avec comité de lecture
2018
-
[BCP18]
C. Bentz, M.-C. Costa, P. Poirion, T. Ridremont.
" Formulations for designing robust networks. An application to wind power collection.
",
INOC,
February 2018,
Vol. 64,
pp.365-374,
Series ENDM,
Lisbonne,
Portugal,
(DOI: 10.1016/j.endm.2018.02.011)
Conférence Internationale avec comité de lecture
2017
-
[Ben17a]
C. Bentz.
"Exact and approximation algorithms for some packing and covering problems in graphs",
Soutenue le: 13 November 2017,
pp. 90,
Mémoire de HDR
2016
-
[WWB16]
D. Watel, M. Weisser, C. Bentz, D. Barth.
"Directed Steiner trees with diffusion costs",
Journal of Combinatorial Optimization,
vol. 32(4), pp. 1089-1106,
2016, (doi:10.1007/s10878-015-9925-3)
- [RCP16] T. Ridremont, M.-C. Costa, D. Porumbel, C. Bentz. "Conception de câblages robustes dans les parcs éoliens : recherche d’une Arborescence de Steiner "robuste"", ROADEF 2016, February 2016, pp.2, France,
-
[BCH16]
C. Bentz, M.-C. Costa, A. Hertz.
"On the edge capacitated Steiner tree problem.",
Date de dépot: 2016/07/05,
Nb pages 31. http://arxiv.org/abs/1607.07082,
(Tech. Rep.: CEDRIC-16-3770)
Revue Internationale avec comité de lecture
Conférence Nationale avec comité de lecture
Rapport Scientifique
2015
- [BBP15] C. Bazgan, C. Bentz, C. Picouleau, B. Ries. "Blockers for the stability number and the chromatic number", Graphs and Combinatorics, vol. 31(1), pp. 73-90, 2015, (doi:10.1007/s00373-013-1380-2)
-
[WWB15]
D. Watel, M. Weisser, C. Bentz, D. Barth.
"An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes",
Information processing letters,
vol. 115(2), pp. 275-279,
2015, (doi:10.1016/j.ipl.2014.09.027)
- [LBG15] T. Lefebvre, C. Bentz, E. Gourdin. "An approximation algorithm for packing Steiner trees under budget and delay constraints", EURO, July 2015, pp.1, UK,
- [LBE15] T. Lefebvre, C. Bentz, S. Elloumi, E. Gourdin. "On the minimum convex cost multicast flow problem", INOC, May 2015, pp.1-8, Poland,
- [BEG15] C. Bentz, S. Elloumi, E. Gourdin, T. Lefebvre. "Flot maximum robuste avec incertitudes sur les chemins", 16ème congrès annuel de la ROADEF, February 2015, pp.1, Marseille, France,
Revue Internationale avec comité de lecture
Conférence Internationale avec comité de lecture
Conférence Nationale avec comité de lecture
2014
- [BEG14] C. Bentz, S. Elloumi, E. Gourdin, T. Lefebvre. "Network coding for survivable multicast video streaming networks ", Reliable Networks Design and Modeling (RNDM), 2014 6th International Workshop on , November 2014, pp.138-144, Spain, (DOI: 10.1109/RNDM.2014.7014943)
- [BCH14] C. Bentz, M.-C. Costa, A. Hertz, P. Poirion. "Cabling optimization of a windfarm and capacitated K-Steiner tree ", PGMO-COPI'14 Gaspard Monge Program for Optimization - Conference on Optimization & Practices in Industry, October 2014, pp.4 pages, Palaiseau (91), France,
- [WWB14] D. Watel, M. Weisser, C. Bentz, D. Barth. "Directed Steiner Tree with Branching Constraint", Computing and combinatorics (COCOON), August 2014, pp.263-275, Series Lecture notes in computer science, (DOI: 10.1007/978-3-319-08783-2_23)
- [BCH14a] C. Bentz, M.-C. Costa, A. Hertz. "A Steiner tree problem with capacity constraints", GO IX, Ninth international colloquium on Graphs and Optimization, July 2014, pp.12, Sirmione, Italy,
- [BEG14a] C. Bentz, S. Elloumi, E. Gourdin, T. Lefebvre. "Survivable network coding ", 15ème congrès annuel de la ROADEF, February 2014, pp.1, Bordeaux, France,
Conférence Internationale avec comité de lecture
Conférence Nationale avec comité de lecture
2013
- [BCR13] C. Bentz, D. Cornaz, B. Ries. "Packing and covering with linear programming: A survey", European Journal of Operational Research, vol. 227(3), pp. 409-422, 2013, (doi:10.1016/j.ejor.2012.11.045)
- [WWB13] D. Watel, M. Weisser, C. Bentz, D. Barth. "Steiner Problems with Limited Number of Branching Nodes", Structural Information and Communication Complexity, July 2013, pp.310-321, Series Lecture notes in computer science, (DOI: 10.1007/978-3-319-03578-9_26)
Revue Internationale avec comité de lecture
Conférence Internationale avec comité de lecture
2012
- [BCPa12] C. Bentz, M.-C. Costa, C. Picouleau, B. Ries, D. de Werra. "d-Transversals of Stable Sets and Vertex Covers in Weighted Bipartite Graphs", Journal of Discrete Algorithms, vol. 17, pp. 95-102, 2012, (doi:10.1016/j.jda.2012.06.002)
- [Ben12] C. Bentz. "A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs", IPEC 2012, September 2012, Vol. 7535, pp.109-119, Series LNCS, Ljubljana, Slovénie, (DOI: 10.1007/978-3-642-33293-7_12)
Revue Internationale avec comité de lecture
Conférence Internationale avec comité de lecture
2011
- [Ben11] C. Bentz. "On the hardness of finding near-optimal multicuts in directed acyclic graphs", Theoretical Computer Science, vol. 412(39), pp. 5325-5332, 2011, (doi:10.1016/j.tcs.2011.06.003)
- [CDPb11] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, C. Bentz. "Minimum d-Transversals of Maximum-Weight Stable Sets in Trees", European conference on combinatorics, graph theory and applications EuroComb'11, Electronics Notes in Discrete Mathematics, August 2011, Vol. 38, pp.129-134, Bupapest, Hongrie, (DOI: 10.1016/j.endm.2011.09.022)
- [CDPa11] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, C. Bentz. "Weighted Transversals and Blockers for Some Optimization Problems in Graphs", Titre du livre: "Progress in Combinatorial Optimization", November 2011, Wiley, pp. 203-222, (isbn: 978-1-84821-206-0)
Revue Internationale avec comité de lecture
Conférence Internationale avec comité de lecture
Chapitres de Livre
2010
- [RBP10] B. Ries, C. Bentz, C. Picouleau, D. de Werra, M.-C. Costa, R. Zenklusen. "Blockers and Transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid", Discrete Mathematics, vol. 310, pp. 132-146, 2010, (doi:10.1016/j.disc.2009.08.009)
Revue Internationale avec comité de lecture
2009
-
[BCL09]
C. Bentz, M.-C. Costa, L. Létocart, F. Roupin.
"Multicuts and integral multiflows in rings",
European Journal of Operational Research,
vol. 196(3), pp. 1251-1254,
2009, (doi:10.1016/j.ejor.2008.05.006)
- [BCD09a] C. Bentz, M.-C. Costa, N. Derhy, F. Roupin. "Cardinality constrained and multicriteria (multi)cut problems", Journal of Discrete Algorithms, vol. 7(1), pp. 102-111, 2009, (doi:10.1016/j.jda.2008.04.004)
- [BP09] C. Bentz, C. Picouleau. "Locally bounded k-colorings of trees", RAIRO, vol. 43(1), pp. 27-33, 2009, (doi:10.1051/ro/2009003)
- [BCP09] C. Bentz, M.-C. Costa, C. Picouleau, B. Ries, D. de Werra. "Degree-constrained edge partitioning in graphs arising from discrete tomography", J. of Graph Algorithms and Applications, vol. 13(2), pp. 99-118, 2009
- [ZRP09] R. Zenklusen, B. Ries, C. Picouleau, D. de Werra, M.-C. Costa, C. Bentz. "Blockers and Transversals", Discrete Mathematics, vol. 309(13), pp. 4306-4314, 2009, (doi:10.1016/j.disc.2009.01.006)
- [Ben09b] C. Bentz. "Disjoint paths in sparse graphs", Discrete Applied Mathematics, vol. 157(17), pp. 3558-3568, 2009, (doi:10.1016/j.dam.2009.03.009)
- [Ben09c] C. Bentz. "A simple algorithm for multicuts in planar graphs with outer terminals", Discrete Applied Mathematics, vol. 157(8), pp. 1959-1964, 2009, (doi:10.1016/j.dam.2008.11.010)
- [Ben09a] C. Bentz. "New results on planar and directed multicuts", EUROCOMB 2009, September 2009, Vol. 34, pp.207-211, Series ENDM, Bordeaux, France, (DOI: 10.1016/j.endm.2009.07.034)
- [Ben09] C. Bentz. "On Planar and Directed Multicuts with few Source-Sink Pairs", CTW 2009, June 2009, pp.313-316, Paris, France,
- [BCD09] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, R. Zenklusen. "d-bloqueurs et d-transversaux", Recherche opérationnelle et aide à la décision. ROADEF'09 Nancy, February 2009, pp.316-317,
Revue Internationale avec comité de lecture
Conférence Internationale avec comité de lecture
Conférence Nationale avec comité de lecture
2008
- [Ben08] C. Bentz. "On the complexity of the multicut problem in bounded tree-width graphs and digraphs", Discrete Applied Mathematics, vol. 156(10), pp. 1908-1917, 2008, (doi:10.1016/j.dam.2007.09.013)
- [BCD08] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "On a graph coloring problem arising from discrete tomography", Networks, vol. 51(4), pp. 256-267, 2008, (doi:10.1002/net.20218)
- [Ben08a] C. Bentz. "Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity", 4OR, vol. 6(1), pp. 89-92, 2008, (doi:10.1007/s10288-007-0040-x)
Revue Internationale avec comité de lecture
2007
-
[BCR07]
C. Bentz, M.-C. Costa, F. Roupin.
"Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs",
Journal of Discrete Algorithms,
vol. 5(1), pp. 36-54,
2007, (doi:10.1016/j.jda.2006.03.009)
- [BCP07] C. Bentz, M.-C. Costa, C. Picouleau, M. Zrikem. "The shortest multipaths problem in a capacitated dense channel", European Journal of Operational Research, vol. 178(3), pp. 926-931, 2007, (doi:10.1016/j.ejor.2006.03.007)
- [BEN07] C. Bentz. "The maximum integer multiterminal flow problem in directed graphs", Operations Research Letters, vol. 35(2), pp. 195-200, 2007, (doi:10.1016/j.orl.2006.03.005)
- [BEN07b] C. Bentz. "Solving the planar multicut problem", Graphs and Optimization VI, Cademario, Switzerland, January 2007, pp.9,
- [BCD07] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Reconstruction d'une coloration des arêtes d’un graphe à partir des séquences de degrés", FRANCORO/ROADEF'07, Grenoble, février, February 2007, pp.87-88,
-
[Ben07a]
C. Bentz.
"Multicoupes dans les graphes orientés de largeur d'arbre bornée et les cactus : complexité et inapproximabilité",
ROADEF'07 Francoro V, Février, Grenoble,
January 2007,
pp.85-86,
-
[BCR07a]
C. Bentz, M.-C. Costa, F. Roupin.
"Erratum to: "C. Bentz, M.-C. Costa, F. Roupin. Maximum integer multiflow and minimum multicut
problems in two-sided uniform grid graphs [Journal of Discrete Algorithms 5 (2007) 36-54]"",
Date de dépot: 2007/11/12,
Nb pages 3,
(Tech. Rep.: CEDRIC-07-4068)
Revue Internationale avec comité de lecture
Conférence Internationale avec comité de lecture
Conférence Nationale avec comité de lecture
Rapport Scientifique
2006
- [BEN06b] C. Bentz. "The Maximum Integer Multiterminal Flow Problem", OTA'06 Int. Workshop of ICCSA 2006, Glasgow, January 2006, Vol. 3982, pp.738-747, Series LNCS, (DOI: 10.1007/11751595_78)
- [BCPa06] C. Bentz, M.-C. Costa, C. Picouleau, D. de Werra, B. Ries. "On a graph coloring problem arising from discrete tomography", Fifth International Colloquium on Graphs and Optimisation, Leukerbad, Switzerland, January 2006,
- [BEN06d] C. Bentz. "Multicuts in bounded tree-width (di)graphs", Fifth Int. Colloquium on Graphs and Optimisation, Leukerbad, Switzerland, January 2006, pp.9,
-
[CRB06]
M.-C. Costa, F. Roupin, C. Bentz, N. Derhy.
"Etude du problème de la multicoupe minimale à cardinalité contrainte",
ROADEF'06 7ème congrès, Lille, février,
February 2006,
pp.54,
-
[Ben06]
C. Bentz.
"Approximation du problème de flot multiterminal entier maximum dans les graphes orientés",
ROADEF'06 7ème congrès, Lille, février,
February 2006,
pp.48,
-
[Ben06a]
C. Bentz.
"Multicoupe dans les graphes planaires et de largeur d'arbre bornée",
ROADEF'06 7ème congrès, Lille, février,
February 2006,
pp.54,
- [BCP06] C. Bentz, M.-C. Costa, C. Picouleau, B. Ries, D. de Werra. "Reconstruction de la coloration d’un graphe à partir de projections de chaînes", ROADEF'06 7ème congrès ROADEF - LILLE - Février, January 2006, pp.51,
- [BCD06] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Discrete tomography and graph coloring", EURO XXI, Reykjavik, Iceland,
-
[Ben06c]
C. Bentz.
"Résolution exacte et approchée de problèmes de multiflot entier et de multicoupe : algorithmes et complexité",
Soutenue le: 20 November 2006,
pp. 223,
- [BP06] C. Bentz, C. Picouleau. "Feasible node colorings of trees with cardinality constraints", Date de dépot: 2006/01/01, (Tech. Rep.: CEDRIC-06-987)
Conférence Internationale avec comité de lecture
Conférence Nationale avec comité de lecture
Conférences Internationales sans actes
Mémoire de Thèse
Rapport Scientifique
2005
- [Ben05a] C. Bentz. "Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs", ICGT'05 7th Int. Colloquium on Graph Theory, Hyères, January 2005, Vol. 22, pp.55-60, Series ENDM, (DOI: 10.1016/j.endm.2005.06.010)
-
[BCP05]
C. Bentz, M.-C. Costa, C. Picouleau, M. Zrikem.
"The shortest multipaths problem in a capacitated dense channel",
ALIO/EURO'05 5th Conf. on Combinatorial Optimization, ENST, Paris, France,
January 2005,
pp.31,
-
[CRB05]
M.-C. Costa, F. Roupin, C. Bentz.
"Résoudre en temps linéaire le problème de la multicoupe minimum dans des grilles rectangulaires",
ROADEF'05 6ème congrès, Tours, février,
February 2005,
pp.105-106,
- [BCR05] C. Bentz, M.-C. Costa, F. Roupin. "Maximum edge disjoint paths and minimum unweighted multicuts in grid graphs", CIRO'05, Marrakech, January 2005, pp.85,
-
[BEN05]
C. Bentz.
"Edge disjoint paths and multicut problems in graphs generalizing the trees",
Date de dépot: 2005/01/01,
(Tech. Rep.: CEDRIC-05-948)
Conférence Internationale avec comité de lecture
Conférence Nationale avec comité de lecture
Rapport Scientifique
2004
-
[CRB04]
M.-C. Costa, F. Roupin, C. Bentz.
"Maximum edge disjoint paths and minimum unweighted multicut problems in grid graphs",
Contributed talk, Proceedings Graph Theory (GT'04), Paris,
January 2004,
pp.23,
-
[BCL04]
C. Bentz, M.-C. Costa, L. Létocart, F. Roupin.
"A bibliography on multicut and integer multiflow problems",
Date de dépot: 2004/01/01,
(Tech. Rep.: CEDRIC-04-654)
