default search action
BibTeX records: Cédric Bentz
@article{DBLP:journals/anor/SilvaBBCK24, author = {Isaias Faria Silva and C{\'{e}}dric Bentz and Mustapha Bouhtou and Matthieu Chardy and Safia Kedad{-}Sidhoum}, title = {Optimization of battery management in telecommunications networks under energy market incentives}, journal = {Ann. Oper. Res.}, volume = {332}, number = {1}, pages = {949--988}, year = {2024}, url = {https://doi.org/10.1007/s10479-023-05402-6}, doi = {10.1007/S10479-023-05402-6}, timestamp = {Sat, 16 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/anor/SilvaBBCK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BentzCPR23, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Pierre{-}Louis Poirion and Thomas Ridremont}, title = {Robust capacitated Steiner trees and networks with uniform demands}, journal = {Networks}, volume = {82}, number = {1}, pages = {3--31}, year = {2023}, url = {https://doi.org/10.1002/net.22143}, doi = {10.1002/NET.22143}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BentzCPR23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/BentzCH20, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Alain Hertz}, title = {On the edge capacitated Steiner tree problem}, journal = {Discret. Optim.}, volume = {38}, pages = {100607}, year = {2020}, url = {https://doi.org/10.1016/j.disopt.2020.100607}, doi = {10.1016/J.DISOPT.2020.100607}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/disopt/BentzCH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BentzB20, author = {C{\'{e}}dric Bentz and Pierre Le Bodic}, title = {Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth}, journal = {Theor. Comput. Sci.}, volume = {809}, pages = {239--249}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2019.12.015}, doi = {10.1016/J.TCS.2019.12.015}, timestamp = {Fri, 31 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BentzB20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Bentz19, author = {C{\'{e}}dric Bentz}, title = {An {FPT} Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face}, journal = {Algorithmica}, volume = {81}, number = {1}, pages = {224--237}, year = {2019}, url = {https://doi.org/10.1007/s00453-018-0443-4}, doi = {10.1007/S00453-018-0443-4}, timestamp = {Tue, 15 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/Bentz19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Bentz19, author = {C{\'{e}}dric Bentz}, title = {Weighted and locally bounded list-colorings in split graphs, cographs, and partial \emph{k}-trees}, journal = {Theor. Comput. Sci.}, volume = {782}, pages = {11--29}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2019.02.029}, doi = {10.1016/J.TCS.2019.02.029}, timestamp = {Wed, 03 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Bentz19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BentzCPR18, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Pierre{-}Louis Poirion and Thomas Ridremont}, title = {Formulations for designing robust networks. An application to wind power collection}, journal = {Electron. Notes Discret. Math.}, volume = {64}, pages = {365--374}, year = {2018}, url = {https://doi.org/10.1016/j.endm.2018.02.011}, doi = {10.1016/J.ENDM.2018.02.011}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BentzCPR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1801-04696, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Pierre{-}Louis Poirion and Thomas Ridremont}, title = {Robust capacitated trees and networks with uniform demands}, journal = {CoRR}, volume = {abs/1801.04696}, year = {2018}, url = {http://arxiv.org/abs/1801.04696}, eprinttype = {arXiv}, eprint = {1801.04696}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1801-04696.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-06704, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Pierre{-}Louis Poirion and Thomas Ridremont}, title = {Formulations for designing robust networks. An application to wind power collection}, journal = {CoRR}, volume = {abs/1806.06704}, year = {2018}, url = {http://arxiv.org/abs/1806.06704}, eprinttype = {arXiv}, eprint = {1806.06704}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-06704.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/hal/Bentz17, author = {C{\'{e}}dric Bentz}, title = {Exact and approximation algorithms for some packing and covering problems in graphs}, year = {2017}, url = {https://tel.archives-ouvertes.fr/tel-03078788}, timestamp = {Tue, 23 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/books/hal/Bentz17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-05903, author = {C{\'{e}}dric Bentz}, title = {An {FPT} algorithm for planar multicuts with sources and sinks on the outer face}, journal = {CoRR}, volume = {abs/1708.05903}, year = {2017}, url = {http://arxiv.org/abs/1708.05903}, eprinttype = {arXiv}, eprint = {1708.05903}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-05903.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1709-05000, author = {C{\'{e}}dric Bentz}, title = {Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees}, journal = {CoRR}, volume = {abs/1709.05000}, year = {2017}, url = {http://arxiv.org/abs/1709.05000}, eprinttype = {arXiv}, eprint = {1709.05000}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1709-05000.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/WatelWBB16, author = {Dimitri Watel and Marc{-}Antoine Weisser and C{\'{e}}dric Bentz and Dominique Barth}, title = {Directed Steiner trees with diffusion costs}, journal = {J. Comb. Optim.}, volume = {32}, number = {4}, pages = {1089--1106}, year = {2016}, url = {https://doi.org/10.1007/s10878-015-9925-3}, doi = {10.1007/S10878-015-9925-3}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/WatelWBB16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BentzCH16, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Alain Hertz}, title = {On the edge capacitated Steiner tree problem}, journal = {CoRR}, volume = {abs/1607.07082}, year = {2016}, url = {http://arxiv.org/abs/1607.07082}, eprinttype = {arXiv}, eprint = {1607.07082}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BentzCH16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BentzB16, author = {C{\'{e}}dric Bentz and Pierre Le Bodic}, title = {A note on "Approximation schemes for a subclass of subset selection problems", and a faster {FPTAS} for the Minimum Knapsack Problem}, journal = {CoRR}, volume = {abs/1607.07950}, year = {2016}, url = {http://arxiv.org/abs/1607.07950}, eprinttype = {arXiv}, eprint = {1607.07950}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BentzB16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/BazganBPR15, author = {Cristina Bazgan and C{\'{e}}dric Bentz and Christophe Picouleau and Bernard Ries}, title = {Blockers for the Stability Number and the Chromatic Number}, journal = {Graphs Comb.}, volume = {31}, number = {1}, pages = {73--90}, year = {2015}, url = {https://doi.org/10.1007/s00373-013-1380-2}, doi = {10.1007/S00373-013-1380-2}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/BazganBPR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WatelWBB15, author = {Dimitri Watel and Marc{-}Antoine Weisser and C{\'{e}}dric Bentz and Dominique Barth}, title = {An {FPT} algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes}, journal = {Inf. Process. Lett.}, volume = {115}, number = {2}, pages = {275--279}, year = {2015}, url = {https://doi.org/10.1016/j.ipl.2014.09.027}, doi = {10.1016/J.IPL.2014.09.027}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WatelWBB15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/WatelWBB14, author = {Dimitri Watel and Marc{-}Antoine Weisser and C{\'{e}}dric Bentz and Dominique Barth}, editor = {Zhipeng Cai and Alex Zelikovsky and Anu G. Bourgeois}, title = {Directed Steiner Tree with Branching Constraint}, booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON} 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8591}, pages = {263--275}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-08783-2\_23}, doi = {10.1007/978-3-319-08783-2\_23}, timestamp = {Thu, 20 Aug 2020 15:36:49 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/WatelWBB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/BentzCR13, author = {C{\'{e}}dric Bentz and Denis Cornaz and Bernard Ries}, title = {Packing and covering with linear programming: {A} survey}, journal = {Eur. J. Oper. Res.}, volume = {227}, number = {3}, pages = {409--422}, year = {2013}, url = {https://doi.org/10.1016/j.ejor.2012.11.045}, doi = {10.1016/J.EJOR.2012.11.045}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/BentzCR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/WatelWBB13, author = {Dimitri Watel and Marc{-}Antoine Weisser and C{\'{e}}dric Bentz and Dominique Barth}, editor = {Thomas Moscibroda and Adele A. Rescigno}, title = {Steiner Problems with Limited Number of Branching Nodes}, booktitle = {Structural Information and Communication Complexity - 20th International Colloquium, {SIROCCO} 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8179}, pages = {310--321}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-03578-9\_26}, doi = {10.1007/978-3-319-03578-9\_26}, timestamp = {Tue, 14 May 2019 10:00:55 +0200}, biburl = {https://dblp.org/rec/conf/sirocco/WatelWBB13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BentzCPRW12, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Christophe Picouleau and Bernard Ries and Dominique de Werra}, title = {d-Transversals of stable sets and vertex covers in weighted bipartite graphs}, journal = {J. Discrete Algorithms}, volume = {17}, pages = {95--102}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2012.06.002}, doi = {10.1016/J.JDA.2012.06.002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BentzCPRW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/Bentz12, author = {C{\'{e}}dric Bentz}, editor = {Dimitrios M. Thilikos and Gerhard J. Woeginger}, title = {A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs}, booktitle = {Parameterized and Exact Computation - 7th International Symposium, {IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7535}, pages = {109--119}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33293-7\_12}, doi = {10.1007/978-3-642-33293-7\_12}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/Bentz12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1206-3999, author = {C{\'{e}}dric Bentz}, title = {A polynomial-time algorithm for planar multicuts with few source-sink pairs}, journal = {CoRR}, volume = {abs/1206.3999}, year = {2012}, url = {http://arxiv.org/abs/1206.3999}, eprinttype = {arXiv}, eprint = {1206.3999}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1206-3999.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BentzCWPR11, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Dominique de Werra and Christophe Picouleau and Bernard Ries}, title = {Minimum d-Transversals of Maximum-Weight Stable Sets in Trees}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {129--134}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.022}, doi = {10.1016/J.ENDM.2011.09.022}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BentzCWPR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Bentz11, author = {C{\'{e}}dric Bentz}, title = {On the hardness of finding near-optimal multicuts in directed acyclic graphs}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {39}, pages = {5325--5332}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2011.06.003}, doi = {10.1016/J.TCS.2011.06.003}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Bentz11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RiesBPWCZ10, author = {Bernard Ries and C{\'{e}}dric Bentz and Christophe Picouleau and Dominique de Werra and Marie{-}Christine Costa and Rico Zenklusen}, title = {Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid}, journal = {Discret. Math.}, volume = {310}, number = {1}, pages = {132--146}, year = {2010}, url = {https://doi.org/10.1016/j.disc.2009.08.009}, doi = {10.1016/J.DISC.2009.08.009}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/RiesBPWCZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Bentz09, author = {C{\'{e}}dric Bentz}, title = {A simple algorithm for multicuts in planar graphs with outer terminals}, journal = {Discret. Appl. Math.}, volume = {157}, number = {8}, pages = {1959--1964}, year = {2009}, url = {https://doi.org/10.1016/j.dam.2008.11.010}, doi = {10.1016/J.DAM.2008.11.010}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Bentz09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Bentz09a, author = {C{\'{e}}dric Bentz}, title = {Disjoint paths in sparse graphs}, journal = {Discret. Appl. Math.}, volume = {157}, number = {17}, pages = {3558--3568}, year = {2009}, url = {https://doi.org/10.1016/j.dam.2009.03.009}, doi = {10.1016/J.DAM.2009.03.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Bentz09a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ZenklusenRPWCB09, author = {Rico Zenklusen and Bernard Ries and Christophe Picouleau and Dominique de Werra and Marie{-}Christine Costa and C{\'{e}}dric Bentz}, title = {Blockers and transversals}, journal = {Discret. Math.}, volume = {309}, number = {13}, pages = {4306--4314}, year = {2009}, url = {https://doi.org/10.1016/j.disc.2009.01.006}, doi = {10.1016/J.DISC.2009.01.006}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ZenklusenRPWCB09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Bentz09, author = {C{\'{e}}dric Bentz}, title = {New results on planar and directed multicuts}, journal = {Electron. Notes Discret. Math.}, volume = {34}, pages = {207--211}, year = {2009}, url = {https://doi.org/10.1016/j.endm.2009.07.034}, doi = {10.1016/J.ENDM.2009.07.034}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Bentz09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/BentzCLR09, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Lucas L{\'{e}}tocart and Fr{\'{e}}d{\'{e}}ric Roupin}, title = {Multicuts and integral multiflows in rings}, journal = {Eur. J. Oper. Res.}, volume = {196}, number = {3}, pages = {1251--1254}, year = {2009}, url = {https://doi.org/10.1016/j.ejor.2008.05.006}, doi = {10.1016/J.EJOR.2008.05.006}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/BentzCLR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BentzCDR09, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Nicolas Derhy and Fr{\'{e}}d{\'{e}}ric Roupin}, title = {Cardinality constrained and multicriteria (multi)cut problems}, journal = {J. Discrete Algorithms}, volume = {7}, number = {1}, pages = {102--111}, year = {2009}, url = {https://doi.org/10.1016/j.jda.2008.04.004}, doi = {10.1016/J.JDA.2008.04.004}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BentzCDR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgaa/BentzCPRW09, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Christophe Picouleau and Bernard Ries and Dominique de Werra}, title = {Degree-constrained edge partitioning in graphs arising from discrete tomography}, journal = {J. Graph Algorithms Appl.}, volume = {13}, number = {2}, pages = {99--118}, year = {2009}, url = {https://doi.org/10.7155/jgaa.00178}, doi = {10.7155/JGAA.00178}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgaa/BentzCPRW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/BentzP09, author = {C{\'{e}}dric Bentz and Christophe Picouleau}, title = {Locally bounded \emph{k}-colorings of trees}, journal = {{RAIRO} Oper. Res.}, volume = {43}, number = {1}, pages = {27--33}, year = {2009}, url = {https://doi.org/10.1051/ro/2009003}, doi = {10.1051/RO/2009003}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/BentzP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colognetwente/Bentz09, author = {C{\'{e}}dric Bentz}, editor = {Sonia Cafieri and Antonio Mucherino and Giacomo Nannicini and Fabien Tarissan and Leo Liberti}, title = {On Planar and Directed Multicuts with few Source-Sink Pairs}, booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, {CTW} 2009, Paris, France, June 2-4 2009}, pages = {313--316}, year = {2009}, url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=325}, timestamp = {Thu, 12 Mar 2020 11:34:41 +0100}, biburl = {https://dblp.org/rec/conf/colognetwente/Bentz09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/4or/Bentz08, author = {C{\'{e}}dric Bentz}, title = {Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity}, journal = {4OR}, volume = {6}, number = {1}, pages = {89--92}, year = {2008}, url = {https://doi.org/10.1007/s10288-007-0040-x}, doi = {10.1007/S10288-007-0040-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/4or/Bentz08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Bentz08, author = {C{\'{e}}dric Bentz}, title = {On the complexity of the multicut problem in bounded tree-width graphs and digraphs}, journal = {Discret. Appl. Math.}, volume = {156}, number = {10}, pages = {1908--1917}, year = {2008}, url = {https://doi.org/10.1016/j.dam.2007.09.013}, doi = {10.1016/J.DAM.2007.09.013}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Bentz08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BentzCWPR08, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Dominique de Werra and Christophe Picouleau and Bernard Ries}, title = {On a graph coloring problem arising from discrete tomography}, journal = {Networks}, volume = {51}, number = {4}, pages = {256--267}, year = {2008}, url = {https://doi.org/10.1002/net.20218}, doi = {10.1002/NET.20218}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BentzCWPR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/BentzCLR07, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Lucas L{\'{e}}tocart and Fr{\'{e}}d{\'{e}}ric Roupin}, title = {Erratum to "Minimal multicut and maximal integer multiflow: {A} survey" [European Journal of Operational Research 162 {(1)} {(2005)} 55-69]}, journal = {Eur. J. Oper. Res.}, volume = {177}, number = {2}, pages = {1312}, year = {2007}, url = {https://doi.org/10.1016/j.ejor.2005.12.034}, doi = {10.1016/J.EJOR.2005.12.034}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/BentzCLR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/BentzCPZ07, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Christophe Picouleau and Maria Zrikem}, title = {The shortest multipaths problem in a capacitated dense channel}, journal = {Eur. J. Oper. Res.}, volume = {178}, number = {3}, pages = {926--931}, year = {2007}, url = {https://doi.org/10.1016/j.ejor.2006.03.007}, doi = {10.1016/J.EJOR.2006.03.007}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/BentzCPZ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BentzCR07, author = {C{\'{e}}dric Bentz and Marie{-}Christine Costa and Fr{\'{e}}d{\'{e}}ric Roupin}, title = {Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs}, journal = {J. Discrete Algorithms}, volume = {5}, number = {1}, pages = {36--54}, year = {2007}, url = {https://doi.org/10.1016/j.jda.2006.03.009}, doi = {10.1016/J.JDA.2006.03.009}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BentzCR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/Bentz07, author = {C{\'{e}}dric Bentz}, title = {The maximum integer multiterminal flow problem in directed graphs}, journal = {Oper. Res. Lett.}, volume = {35}, number = {2}, pages = {195--200}, year = {2007}, url = {https://doi.org/10.1016/j.orl.2006.03.005}, doi = {10.1016/J.ORL.2006.03.005}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/Bentz07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iccsa/Bentz06, author = {C{\'{e}}dric Bentz}, editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih Jeng Kenneth Tan and David Taniar and Antonio Lagan{\`{a}} and Youngsong Mun and Hyunseung Choo}, title = {The Maximum Integer Multiterminal Flow Problem}, booktitle = {Computational Science and Its Applications - {ICCSA} 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {3982}, pages = {738--747}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11751595\_78}, doi = {10.1007/11751595\_78}, timestamp = {Thu, 28 Apr 2022 16:17:38 +0200}, biburl = {https://dblp.org/rec/conf/iccsa/Bentz06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/Bentz05, author = {C{\'{e}}dric Bentz}, title = {Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs}, journal = {Electron. Notes Discret. Math.}, volume = {22}, pages = {55--60}, year = {2005}, url = {https://doi.org/10.1016/j.endm.2005.06.010}, doi = {10.1016/J.ENDM.2005.06.010}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/Bentz05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.