default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCédric Bentz
Person information
- affiliation: CNAM-Laboratoire Cédric, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Isaias Faria Silva
, Cédric Bentz, Mustapha Bouhtou, Matthieu Chardy, Safia Kedad-Sidhoum:
Optimization of battery management in telecommunications networks under energy market incentives. Ann. Oper. Res. 332(1): 949-988 (2024)- 2023
- [j30]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated Steiner trees and networks with uniform demands. Networks 82(1): 3-31 (2023) - 2020
- [j29]Cédric Bentz, Marie-Christine Costa, Alain Hertz:
On the edge capacitated Steiner tree problem. Discret. Optim. 38: 100607 (2020) - [j28]Cédric Bentz, Pierre Le Bodic:
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth. Theor. Comput. Sci. 809: 239-249 (2020)
2010 – 2019
- 2019
- [j27]Cédric Bentz:
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face. Algorithmica 81(1): 224-237 (2019) - [j26]Cédric Bentz:
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees. Theor. Comput. Sci. 782: 11-29 (2019) - 2018
- [j25]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. Electron. Notes Discret. Math. 64: 365-374 (2018) - [i7]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated trees and networks with uniform demands. CoRR abs/1801.04696 (2018) - [i6]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. CoRR abs/1806.06704 (2018) - 2017
- [b1]Cédric Bentz:
Exact and approximation algorithms for some packing and covering problems in graphs. Sorbonne University, France, 2017 - [i5]Cédric Bentz:
An FPT algorithm for planar multicuts with sources and sinks on the outer face. CoRR abs/1708.05903 (2017) - [i4]Cédric Bentz:
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees. CoRR abs/1709.05000 (2017) - 2016
- [j24]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner trees with diffusion costs. J. Comb. Optim. 32(4): 1089-1106 (2016) - [i3]Cédric Bentz, Marie-Christine Costa, Alain Hertz:
On the edge capacitated Steiner tree problem. CoRR abs/1607.07082 (2016) - [i2]Cédric Bentz, Pierre Le Bodic:
A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem. CoRR abs/1607.07950 (2016) - 2015
- [j23]Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries:
Blockers for the Stability Number and the Chromatic Number. Graphs Comb. 31(1): 73-90 (2015) - [j22]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes. Inf. Process. Lett. 115(2): 275-279 (2015) - 2014
- [c5]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Directed Steiner Tree with Branching Constraint. COCOON 2014: 263-275 - 2013
- [j21]Cédric Bentz, Denis Cornaz, Bernard Ries:
Packing and covering with linear programming: A survey. Eur. J. Oper. Res. 227(3): 409-422 (2013) - [c4]Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
Steiner Problems with Limited Number of Branching Nodes. SIROCCO 2013: 310-321 - 2012
- [j20]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) - [c3]Cédric Bentz:
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs. IPEC 2012: 109-119 - [i1]Cédric Bentz:
A polynomial-time algorithm for planar multicuts with few source-sink pairs. CoRR abs/1206.3999 (2012) - 2011
- [j19]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. Electron. Notes Discret. Math. 38: 129-134 (2011) - [j18]Cédric Bentz:
On the hardness of finding near-optimal multicuts in directed acyclic graphs. Theor. Comput. Sci. 412(39): 5325-5332 (2011) - 2010
- [j17]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. Discret. Math. 310(1): 132-146 (2010)
2000 – 2009
- 2009
- [j16]Cédric Bentz:
A simple algorithm for multicuts in planar graphs with outer terminals. Discret. Appl. Math. 157(8): 1959-1964 (2009) - [j15]Cédric Bentz:
Disjoint paths in sparse graphs. Discret. Appl. Math. 157(17): 3558-3568 (2009) - [j14]Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz:
Blockers and transversals. Discret. Math. 309(13): 4306-4314 (2009) - [j13]Cédric Bentz:
New results on planar and directed multicuts. Electron. Notes Discret. Math. 34: 207-211 (2009) - [j12]Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Multicuts and integral multiflows in rings. Eur. J. Oper. Res. 196(3): 1251-1254 (2009) - [j11]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) - [j10]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) - [j9]Cédric Bentz, Christophe Picouleau:
Locally bounded k-colorings of trees. RAIRO Oper. Res. 43(1): 27-33 (2009) - [c2]Cédric Bentz:
On Planar and Directed Multicuts with few Source-Sink Pairs. CTW 2009: 313-316 - 2008
- [j8]Cédric Bentz:
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity. 4OR 6(1): 89-92 (2008) - [j7]Cédric Bentz:
On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discret. Appl. Math. 156(10): 1908-1917 (2008) - [j6]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
- [j5]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]. Eur. J. Oper. Res. 177(2): 1312 (2007) - [j4]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Maria Zrikem:
The shortest multipaths problem in a capacitated dense channel. Eur. J. Oper. Res. 178(3): 926-931 (2007) - [j3]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) - [j2]Cédric Bentz:
The maximum integer multiterminal flow problem in directed graphs. Oper. Res. Lett. 35(2): 195-200 (2007) - 2006
- [c1]Cédric Bentz:
The Maximum Integer Multiterminal Flow Problem. ICCSA (3) 2006: 738-747 - 2005
- [j1]Cédric Bentz:
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs. Electron. Notes Discret. Math. 22: 55-60 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
