| Publication | Date of Publication | Type |
|---|
Approximation algorithms for flexible graph connectivity
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
| Approximation algorithms for flexible graph connectivity | 2024-02-05 | Paper |
A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case
(available as arXiv preprint) | 2023-10-31 | Paper |
A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
The salesman's improved tours for fundamental classes
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
(available as arXiv preprint) | 2020-08-07 | Paper |
| The saleman's improved tours for fundamental classes | 2017-08-31 | Paper |
Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Facet generating techniques
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem
(available as arXiv preprint) | 2016-10-17 | Paper |
A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
Discrete Applied Mathematics | 2016-06-21 | Paper |
The traveling salesman problem on cubic and subcubic graphs
Mathematical Programming. Series A. Series B | 2014-06-02 | Paper |
A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Finding 2-factors closer to TSP tours in cubic graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Mixed and circular multichromosomal genomic median problem
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
Discrete Optimization | 2012-04-05 | Paper |
TSP on cubic and subcubic graphs
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
| Structure of the extreme points of the subtour elimination polytope of the STSP | 2011-05-16 | Paper |
Finding the exact integrality gap for small traveling salesman problems
Mathematics of Operations Research | 2011-04-27 | Paper |
On the domino-parity inequalities for the STSP
Mathematical Programming. Series A. Series B | 2010-07-21 | Paper |
| scientific article; zbMATH DE number 5158509 (Why is no real title available?) | 2007-05-29 | Paper |
| scientific article; zbMATH DE number 2086915 (Why is no real title available?) | 2004-08-11 | Paper |
Ladders for Travelling Salesmen
SIAM Journal on Optimization | 1996-04-01 | Paper |
An Integer Polytope Related to the Design of Survivable Communication Networks
SIAM Journal on Discrete Mathematics | 1994-08-14 | Paper |
The synchronization problem in protocol testing and its complexity
Information Processing Letters | 1992-06-28 | Paper |
Small Travelling Salesman Polytopes
Mathematics of Operations Research | 1992-06-25 | Paper |
Optimizing over the subtour polytope of the travelling salesman problem
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
Operations Research Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3853102 (Why is no real title available?) | 1983-01-01 | Paper |
