| Publication | Date of Publication | Type |
|---|
Optimization of battery management in telecommunications networks under energy market incentives
Annals of Operations Research | 2024-09-03 | Paper |
Robust capacitated Steiner trees and networks with uniform demands
Networks | 2023-12-18 | Paper |
On the edge capacitated Steiner tree problem
Discrete Optimization | 2021-01-15 | Paper |
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
Theoretical Computer Science | 2020-01-29 | Paper |
Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees
Theoretical Computer Science | 2019-06-06 | Paper |
An FPT algorithm for planar multicuts with sources and sinks on the outer face
Algorithmica | 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
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Blockers for the stability number and the chromatic number
Graphs and Combinatorics | 2015-01-20 | Paper |
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
Information Processing Letters | 2014-12-09 | Paper |
Directed Steiner tree with branching constraint
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Packing and covering with linear programming: a survey
European Journal of Operational Research | 2014-07-27 | Paper |
Steiner problems with limited number of branching nodes
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Minimum \(d\)-transversals of maximum-weight stable sets in trees
| 2013-11-01 | Paper |
New results on planar and directed multicuts
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
Journal of Discrete Algorithms | 2013-06-24 | Paper |
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
Parameterized and Exact Computation | 2013-01-07 | Paper |
scientific article; zbMATH DE number 6000604 (Why is no real title available?)
| 2012-01-26 | Paper |
On the hardness of finding near-optimal multicuts in directed acyclic graphs
Theoretical Computer Science | 2011-10-10 | Paper |
Disjoint paths in sparse graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
Discrete Mathematics | 2009-12-15 | Paper |
Blockers and transversals
Discrete Mathematics | 2009-12-10 | Paper |
Multicuts and integral multiflows in rings
European Journal of Operational Research | 2009-12-07 | Paper |
A simple algorithm for multicuts in planar graphs with outer terminals
Discrete Applied Mathematics | 2009-06-24 | Paper |
Degree-constrained edge partitioning in graphs arising from discrete tomography
Journal of Graph Algorithms and Applications | 2009-05-19 | Paper |
Locally boundedk-colorings of trees
RAIRO - Operations Research | 2009-04-23 | Paper |
Cardinality constrained and multicriteria (multi)cut problems
Journal of Discrete Algorithms | 2009-04-16 | Paper |
The Maximum Integer Multiterminal Flow Problem
Computational Science and Its Applications - ICCSA 2006 | 2009-02-10 | Paper |
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics | 2008-09-10 | Paper |
On a graph coloring problem arising from discrete tomography
Networks | 2008-07-29 | Paper |
Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity
4OR | 2008-05-20 | Paper |
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
Journal of Discrete Algorithms | 2008-05-16 | Paper |
The maximum integer multiterminal flow problem in directed graphs
Operations Research Letters | 2007-08-27 | Paper |
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The shortest multipaths problem in a capacitated dense channel
European Journal of Operational Research | 2007-01-16 | Paper |
