| Publication | Date of Publication | Type |
|---|
Minimum weighted clique cover on claw‐free perfect graphs
Journal of Graph Theory | 2023-09-29 | Paper |
On the facets of stable set polytopes of circular interval graphs
Annals of Operations Research | 2022-06-13 | Paper |
Separation routine and extended formulations for the stable set problem in claw-free graphs
Mathematical Programming. Series A. Series B | 2021-07-02 | Paper |
Rerouting Flows when Links Fail
SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
| Rerouting flows when links fail | 2020-05-27 | Paper |
Single courier single restaurant meal delivery (without routing)
Operations Research Letters | 2020-02-10 | Paper |
| Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs | 2019-05-10 | Paper |
Protection of flows under targeted attacks
Operations Research Letters | 2019-02-21 | Paper |
| Adaptivity in network interdiction | 2017-10-27 | Paper |
| scientific article; zbMATH DE number 6783420 (Why is no real title available?) | 2017-09-29 | Paper |
| Clique covers in claw-free Berge graphs | 2016-07-01 | Paper |
Solving the weighted stable set problem in claw-free graphs via decomposition
Journal of the ACM | 2015-08-14 | Paper |
Network design with a discrete set of traffic matrices
Operations Research Letters | 2014-05-14 | Paper |
The online replacement path problem
Lecture Notes in Computer Science | 2013-09-17 | Paper |
On coloring problems with local constraints
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Minimum weighted clique cover on strip-composed perfect graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
On coloring problems with local constraints
Discrete Mathematics | 2012-06-18 | Paper |
On the recognition of fuzzy circular interval graphs
Discrete Mathematics | 2012-03-29 | Paper |
| Stable sets in claw-free graphs: a journey through algorithms and polytopes | 2012-01-26 | Paper |
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Theoretical Computer Science | 2012-01-09 | Paper |
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
Operations Research Letters | 2011-08-19 | Paper |
The VPN Problem with Concave Costs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Stable routing under the Spanning Tree Protocol
Operations Research Letters | 2010-12-20 | Paper |
On the cubicity of certain graphs
Information Processing Letters | 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
Combinatorica | 2008-10-21 | Paper |
Clique-circulants and the stable set polytope of fuzzy circular interval graphs
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
A short proof of the VPN tree routing conjecture on ring networks
Operations Research Letters | 2008-09-10 | Paper |
A short proof of the VPN tree routing conjecture on ring networks
Operations Research Letters | 2008-09-10 | Paper |
New Approaches for Virtual Private Network Design
SIAM Journal on Computing | 2008-06-19 | Paper |
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Domination Between Traffic Matrices
Mathematics of Operations Research | 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
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
The stable set problem and the thinness of a graph
Operations Research Letters | 2007-08-27 | Paper |
Design of trees in the hose model: the balanced case
Operations Research Letters | 2007-02-19 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
Mathematical Methods of Operations Research | 2004-09-22 | Paper |
An approximate \(A^{\ast}\) algorithm and its application to the SCS problem.
Theoretical Computer Science | 2003-08-17 | Paper |
The Machine Duplication Problem in a Job Shop with Two Jobs
International Transactions in Operational Research | 1997-01-15 | Paper |
