| Publication | Date of Publication | Type |
|---|
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem
SIAM Journal on Computing | 2023-08-10 | Paper |
Hard to solve instances of the Euclidean traveling salesman problem
Mathematical Programming Computation | 2021-11-16 | Paper |
The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem
Operations Research Letters | 2021-04-07 | Paper |
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
| 2020-10-06 | Paper |
On the integrality ratio of the subtour LP for Euclidean TSP
Operations Research Letters | 2018-09-28 | Paper |
The approximation ratio of the greedy algorithm for the metric traveling salesman problem
Operations Research Letters | 2018-09-28 | Paper |
Proof checking and non-approximability
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
Algorithmische Mathematik
| 2018-06-29 | Paper |
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Mathematical Programming Computation | 2018-02-23 | Paper |
Linear time approximation algorithms for~degree~constrained subgraph problems
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Algorithmic Mathematics
| 2016-09-08 | Paper |
On the nearest neighbor rule for the metric traveling salesman problem
Discrete Applied Mathematics | 2015-09-21 | Paper |
Edge elimination in TSP instances
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Algorithmic mathematics
Springer-Lehrbuch | 2015-09-08 | Paper |
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
On packing squares into a rectangle
Computational Geometry | 2011-08-02 | Paper |
The Floyd-Warshall algorithm on graphs with negative cycles
Information Processing Letters | 2010-09-07 | Paper |
Improved linear time approximation algorithms for weighted matchings
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Surface realization with the intersection segment functional
Experimental Mathematics | 2010-04-01 | Paper |
Approximating weighted matchings in parallel
Information Processing Letters | 2010-01-29 | Paper |
Polyhedral tori with minimal coordinates
| 2009-10-12 | Paper |
On approximation algorithms for the terminal Steiner tree problem
Information Processing Letters | 2009-07-09 | Paper |
A simple approximation algorithm for the weighted matching problem
Information Processing Letters | 2009-03-23 | Paper |
scientific article; zbMATH DE number 5264904 (Why is no real title available?)
| 2008-04-16 | Paper |
scientific article; zbMATH DE number 5264907 (Why is no real title available?)
| 2008-04-16 | Paper |
Computation of best possible low degree expanders
Discrete Applied Mathematics | 2007-11-30 | Paper |
On a conjecture of Hoàng and Tu concerning perfectly orderable graphs
Discrete Mathematics | 2007-01-09 | Paper |
Classes of perfect graphs
Discrete Mathematics | 2006-10-30 | Paper |
Surface realization with the intersection edge functional
| 2006-08-22 | Paper |
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Networks | 2006-05-16 | Paper |
Perfectness is an Elusive Graph Property
SIAM Journal on Computing | 2005-02-21 | Paper |
On simplicial and co-simplicial vertices in graphs.
Discrete Applied Mathematics | 2004-03-29 | Paper |
scientific article; zbMATH DE number 2044939 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 1982180 (Why is no real title available?)
| 2003-09-16 | Paper |
Recursive generation of partitionable graphs
Journal of Graph Theory | 2003-03-19 | Paper |
Steiner trees in uniformly quasi-bipartite graphs.
Information Processing Letters | 2003-01-21 | Paper |
The \(P_4\)-structure of perfect graphs
| 2002-08-08 | Paper |
On wing-perfect graphs
| 1999-06-20 | Paper |
scientific article; zbMATH DE number 1305435 (Why is no real title available?)
| 1999-06-17 | Paper |
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
Combinatorics, Probability and Computing | 1999-04-13 | Paper |
A CONJECTURE OF KAUFFMAN ON AMPHICHEIRAL ALTERNATING KNOTS
Journal of Knot Theory and Its Ramifications | 1998-05-07 | Paper |
Does the Jones Polynomial Detect Unknottedness?
Experimental Mathematics | 1998-03-09 | Paper |
On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs
Journal of Combinatorial Theory. Series B | 1997-09-24 | Paper |
Perfect graphs with unique \(P_ 4\)-structure
Discrete Mathematics | 1997-06-10 | Paper |
Wing-triangulated graphs are perfect
| 1997-06-09 | Paper |
Even pairs and the strong perfect graph conjecture
Discrete Mathematics | 1996-08-22 | Paper |
Probabilistically checkable proofs and their consequences for approximation algorithms
Discrete Mathematics | 1995-11-06 | Paper |
Even and odd pairs in linegraphs of bipartite graphs
European Journal of Combinatorics | 1995-03-08 | Paper |
Counterexamples to three conjectures concerning perfect graphs
Discrete Mathematics | 1994-09-11 | Paper |
The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
| N/A | Paper |
The Bottom-Left Algorithm for the Strip Packing Problem
| N/A | Paper |
