Cédric Bentz

Pierre-Louis Poirion

Thomas Ridremont

Networks, July, 2023

2020

Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth.

[BibT_eX]

[DOI]

Pierre Le Bodic

Theor. Comput. Sci., 2020

On the edge capacitated Steiner tree problem.

[BibT_eX]

[DOI]

Alain Hertz

Discret. Optim., 2020

2019

Weighted and locally bounded list-colorings in split graphs, cographs, and partial <i>k</i>-trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Formulations for designing robust networks. An application to wind power collection.

[BibT_eX]

[DOI]

Pierre-Louis Poirion

Thomas Ridremont

Electron. Notes Discret. Math., 2018

Robust capacitated trees and networks with uniform demands.

[BibT_eX]

[DOI]

Pierre-Louis Poirion

Thomas Ridremont

CoRR, 2018

2017

Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees.

[BibT_eX]

[DOI]

CoRR, 2017

Exact and approximation algorithms for some packing and covering problems in graphs.

[BibT_eX]

[DOI]

, 2017

2016

Directed Steiner trees with diffusion costs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem.

[BibT_eX]

[DOI]

Pierre Le Bodic

CoRR, 2016

2015

An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Blockers for the Stability Number and the Chromatic Number.

[BibT_eX]

[DOI]

Graphs Comb., 2015

2014

Directed Steiner Tree with Branching Constraint.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Packing and covering with linear programming: A survey.

[BibT_eX]

[DOI]

Denis Cornaz

Eur. J. Oper. Res., 2013

Steiner Problems with Limited Number of Branching Nodes.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

2012

d-Transversals of stable sets and vertex covers in weighted bipartite graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011

On the hardness of finding near-optimal multicuts in directed acyclic graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.

[BibT_eX]

[DOI]

Rico Zenklusen

Discret. Math., 2010

2009

Locally bounded <i>k</i>-colorings of trees.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2009

Degree-constrained edge partitioning in graphs arising from discrete tomography.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Cardinality constrained and multicriteria (multi)cut problems.

[BibT_eX]

[DOI]

Nicolas Derhy

J. Discrete Algorithms, 2009

Multicuts and integral multiflows in rings.

[BibT_eX]

[DOI]

Lucas Létocart

Eur. J. Oper. Res., 2009

New results on planar and directed multicuts.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Blockers and transversals.

[BibT_eX]

[DOI]

Discret. Math., 2009

Disjoint paths in sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

A simple algorithm for multicuts in planar graphs with outer terminals.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On Planar and Directed Multicuts with few Source-Sink Pairs.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

On a graph coloring problem arising from discrete tomography.

[BibT_eX]

[DOI]

Networks, 2008

On the complexity of the multicut problem in bounded tree-width graphs and digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity.

[BibT_eX]

[DOI]

4OR, 2008

2007

The maximum integer multiterminal flow problem in directed graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

The shortest multipaths problem in a capacitated dense channel.

[BibT_eX]

[DOI]

Maria Zrikem

Eur. J. Oper. Res., 2007

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69].

[BibT_eX]

[DOI]

Lucas Létocart

Eur. J. Oper. Res., 2007

2006

The Maximum Integer Multiterminal Flow Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

2005

Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs.

[BibT_eX]

[DOI]