The following pages link to Cédric Bentz (Q346490):
Displayed 35 items.
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- The shortest multipaths problem in a capacitated dense channel (Q859708) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Item:Q346490 (redirect page) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- Multicuts and integral multiflows in rings (Q1041998) (← links)
- Blockers and transversals (Q1043948) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Formulations for designing robust networks. An application to wind power collection (Q1742258) (← links)
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Packing and covering with linear programming: a survey (Q2253646) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- (Q2857332) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Directed Steiner Tree with Branching Constraint (Q2920465) (← links)
- (Q3109939) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- On a graph coloring problem arising from discrete tomography (Q3515882) (← links)
- The Maximum Integer Multiterminal Flow Problem (Q3600158) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Degree-constrained edge partitioning in graphs arising from discrete tomography (Q3627968) (← links)
- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs (Q4899245) (← links)
- Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)