| Publication | Date of Publication | Type |
|---|
| Minimum weighted clique cover on claw‐free perfect graphs | 2023-09-29 | Paper |
| On the facets of stable set polytopes of circular interval graphs | 2022-06-13 | Paper |
| Separation routine and extended formulations for the stable set problem in claw-free graphs | 2021-07-02 | Paper |
| Rerouting Flows when Links Fail | 2020-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111420 | 2020-05-27 | Paper |
| Single courier single restaurant meal delivery (without routing) | 2020-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743477 | 2019-05-10 | Paper |
| Protection of flows under targeted attacks | 2019-02-21 | Paper |
| Adaptivity in network interdiction | 2017-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365068 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816034 | 2016-07-01 | Paper |
| Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition | 2015-08-14 | Paper |
| Network design with a discrete set of traffic matrices | 2014-05-14 | Paper |
| The Online Replacement Path Problem | 2013-09-17 | Paper |
| On coloring problems with local constraints | 2013-07-19 | Paper |
| Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property | 2013-03-19 | Paper |
| Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs | 2012-11-06 | Paper |
| On coloring problems with local constraints | 2012-06-18 | Paper |
| On the recognition of fuzzy circular interval graphs | 2012-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109934 | 2012-01-26 | Paper |
| Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem | 2012-01-09 | Paper |
| A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) | 2011-08-19 | Paper |
| The VPN Problem with Concave Costs | 2011-06-17 | Paper |
| Stable routing under the Spanning Tree Protocol | 2010-12-20 | Paper |
| On the cubicity of certain graphs | 2009-12-04 | Paper |
| The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract) | 2008-12-12 | Paper |
| The stable set polytope of quasi-line graphs | 2008-10-21 | Paper |
| Clique-circulants and the stable set polytope of fuzzy circular interval graphs | 2008-10-16 | Paper |
| A short proof of the VPN tree routing conjecture on ring networks | 2008-09-10 | Paper |
| New Approaches for Virtual Private Network Design | 2008-06-19 | Paper |
| A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs | 2008-06-10 | Paper |
| Domination Between Traffic Matrices | 2008-05-27 | Paper |
| The VPN Tree Routing Conjecture for Outerplanar Networks | 2007-11-16 | Paper |
| Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs | 2007-08-30 | Paper |
| The stable set problem and the thinness of a graph | 2007-08-27 | Paper |
| Design of trees in the hose model: the balanced case | 2007-02-19 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs | 2004-09-22 | Paper |
| An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. | 2003-08-17 | Paper |
| The Machine Duplication Problem in a Job Shop with Two Jobs | 1997-01-15 | Paper |
