Cédric Bentz

Available identifiers

zbMath Open bentz.cedricMaRDI QIDQ346490

List of research outcomes

Publication	Date of Publication	Type
Robust capacitated Steiner trees and networks with uniform demands	2023-12-18	Paper
On the edge capacitated Steiner tree problem	2021-01-15	Paper
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth	2020-01-29	Paper
Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees	2019-06-06	Paper
An FPT algorithm for planar multicuts with sources and sinks on the outer face	2019-01-11	Paper
Formulations for designing robust networks. An application to wind power collection	2018-04-11	Paper
Directed Steiner trees with diffusion costs	2016-11-29	Paper
Blockers for the stability number and the chromatic number	2015-01-20	Paper
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes	2014-12-09	Paper
Directed Steiner Tree with Branching Constraint	2014-09-26	Paper
Packing and covering with linear programming: a survey	2014-07-27	Paper
Steiner Problems with Limited Number of Branching Nodes	2013-12-17	Paper
https://portal.mardi4nfdi.de/entity/Q2857332	2013-11-01	Paper
New results on planar and directed multicuts	2013-10-10	Paper
\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs	2013-06-24	Paper
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs	2013-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q3109939	2012-01-26	Paper
On the hardness of finding near-optimal multicuts in directed acyclic graphs	2011-10-10	Paper
Disjoint paths in sparse graphs	2010-04-28	Paper
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid	2009-12-15	Paper
Blockers and transversals	2009-12-10	Paper
Multicuts and integral multiflows in rings	2009-12-07	Paper
A simple algorithm for multicuts in planar graphs with outer terminals	2009-06-24	Paper
Degree-constrained edge partitioning in graphs arising from discrete tomography	2009-05-19	Paper
Locally boundedk-colorings of trees	2009-04-23	Paper
Cardinality constrained and multicriteria (multi)cut problems	2009-04-16	Paper
The Maximum Integer Multiterminal Flow Problem	2009-02-10	Paper
On the complexity of the multicut problem in bounded tree-width graphs and digraphs	2008-09-10	Paper
On a graph coloring problem arising from discrete tomography	2008-07-29	Paper
Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity	2008-05-20	Paper
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs	2008-05-16	Paper
The maximum integer multiterminal flow problem in directed graphs	2007-08-27	Paper
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs	2007-05-29	Paper
The shortest multipaths problem in a capacitated dense channel	2007-01-16	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Cédric Bentz