| 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 |
| Minimal graphs for 2-factor extension | 2020-06-05 | Paper |
| Formulations for designing robust networks. An application to wind power collection | 2018-04-11 | Paper |
| Minimal graphs for matching extensions | 2017-12-20 | Paper |
| 2-stage robust MILP with continuous recourse variables | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857332 | 2013-11-01 | Paper |
| \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs | 2013-06-24 | Paper |
| Optimizing splitter and fiber location in a multilevel optical FTTH network | 2012-12-29 | Paper |
| Minimum \(d\)-blockers and \(d\)-transversals in graphs | 2012-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109939 | 2012-01-26 | Paper |
| Complexity results for the horizontal bar packing problem | 2010-06-09 | Paper |
| On the use of graphs in discrete tomography | 2010-05-10 | 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 |
| Graph coloring with cardinality constraints on the neighborhoods | 2009-11-23 | Paper |
| Degree-constrained edge partitioning in graphs arising from discrete tomography | 2009-05-19 | Paper |
| Cardinality constrained and multicriteria (multi)cut problems | 2009-04-16 | Paper |
| On the use of graphs in discrete tomography | 2008-09-04 | Paper |
| Addendum to ``Bicolored matchings in some classes of graphs | 2008-08-20 | Paper |
| On a graph coloring problem arising from discrete tomography | 2008-07-29 | Paper |
| Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs | 2008-05-16 | Paper |
| Approximating hv-Convex Binary Matrices and Images from Discrete Projections | 2008-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5434302 | 2008-01-04 | Paper |
| Multiway cut and integer flow problems in trees | 2007-05-29 | Paper |
| Reconstruction of binary matrices under adjacency constraints | 2007-05-29 | Paper |
| Bicolored matchings in some classes of graphs | 2007-05-29 | Paper |
| Bicolored matchings in some classes of graphs | 2007-04-26 | Paper |
| An acyclic days-off scheduling problem | 2007-01-24 | Paper |
| The shortest multipaths problem in a capacitated dense channel | 2007-01-16 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Using graphs for some discrete tomography problems | 2006-01-10 | Paper |
| A solvable case of image reconstruction in discrete tomography | 2005-08-05 | Paper |
| Minimal multicut and maximal integer multiflow: a survey | 2005-02-09 | Paper |
| A greedy algorithm for multicut and integral multiflow in rooted trees | 2003-05-04 | Paper |
| Bounds and heuristics for the shortest capacitated paths problem | 2002-12-15 | Paper |
| Solving the dynamic facility location problem | 1997-01-07 | Paper |
| Solving the uncapacited plant location problem on trees | 1995-03-01 | Paper |
| Persistency in maximum cardinality bipartite matchings | 1994-09-05 | Paper |
| An efficient algorithm for a task allocation problem | 1994-08-21 | Paper |
