| Publication | Date of Publication | Type |
|---|
| Travelling salesman paths on Demidenko matrices | 2024-06-20 | Paper |
| Recognising permuted Demidenko matrices | 2024-06-17 | Paper |
| Dynamic multi-period vehicle routing with touting | 2023-07-11 | Paper |
| Sometimes travelling is easy: The master tour problem | 2023-05-08 | Paper |
| The bipartite travelling salesman problem: A pyramidally solvable case | 2023-02-10 | Paper |
| 2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics | 2022-03-11 | Paper |
| The travelling salesman and the PQ-tree | 2019-01-11 | Paper |
| New special cases of the quadratic assignment problem with diagonally structured coefficient matrices | 2018-05-30 | Paper |
| 2VRP: a benchmark problem for small but rich VRPs | 2018-02-22 | Paper |
| The multi-stripe travelling salesman problem | 2018-02-15 | Paper |
| On the traveling salesman problem with a relaxed Monge matrix | 2016-06-09 | Paper |
| Linearizable special cases of the QAP | 2016-04-13 | Paper |
| A New Tractable Case of the QAP with a Robinson Matrix | 2016-02-05 | Paper |
| The approximability of MAX CSP with fixed-value constraints | 2015-11-11 | Paper |
| Well-solvable cases of the QAP with block-structured matrices | 2015-05-22 | Paper |
| Four-point conditions for the TSP: the complete complexity classification | 2015-04-09 | Paper |
| Two hardness results for Gamson's game | 2015-01-09 | Paper |
| The \(x\)-and-\(y\)-axes travelling salesman problem | 2014-07-27 | Paper |
| Uniqueness in quadratic and hyperbolic \(0-1\) programming problems | 2014-05-15 | Paper |
| Two hardness results for core stability in hedonic coalition formation games | 2014-04-22 | Paper |
| Fast minimum-weight double-tree shortcutting for metric TSP | 2014-04-01 | Paper |
| Complexity and in-approximability of a selection problem in robust optimization | 2013-12-02 | Paper |
| Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio | 2013-07-04 | Paper |
| Another well-solvable case of the QAP: maximizing the job completion time variance | 2012-11-08 | Paper |
| Pinpointing the complexity of the interval min-max regret knapsack problem | 2012-06-20 | Paper |
| A well-solvable special case of the bounded knapsack problem | 2011-08-09 | Paper |
| Unbounded knapsack problems with arithmetic weight sequences | 2011-06-22 | Paper |
| On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices | 2011-02-14 | Paper |
| Four point conditions and exponential neighborhoods for symmetric TSP | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576659 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396593 | 2009-09-19 | Paper |
| On the Euclidean TSP with a permuted van der Veen matrix | 2009-07-21 | Paper |
| Polygons with inscribed circles and prescribed side lengths | 2009-06-09 | Paper |
| The complexity of computing the Muirhead-Dalton distance | 2009-04-20 | Paper |
| One-Sided Monge TSP Is NP-Hard | 2009-02-10 | Paper |
| Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP | 2008-01-02 | Paper |
| Well-solvable instances for the partition problem | 2007-06-29 | Paper |
| Exact algorithms for the Hamiltonian cycle problem in planar graphs | 2006-06-30 | Paper |
| Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices | 2005-12-14 | Paper |
| On the dimension of simple monotonic games | 2005-11-04 | Paper |
| Which matrices are immune against the transportation paradox? | 2003-09-22 | Paper |
| Complexity and approximability results for slicing floorplan designs. | 2003-07-30 | Paper |
| A comment on consecutive-2-out-of-\(n\) systems | 2002-09-22 | Paper |
| Hardness of approximation of the discrete time-cost tradeoff problem | 2002-07-03 | Paper |
| The Travelling Salesman and the PQ-Tree | 2001-11-26 | Paper |
| The maximum travelling salesman problem on symmetric Demidenko matrices | 2000-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937095 | 2000-02-03 | Paper |
| A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. | 2000-01-01 | Paper |
| The travelling salesman problem on permuted Monge matrices | 1999-07-20 | Paper |
| A solvable case of the quadratic assignment problem | 1998-12-03 | Paper |
| Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey | 1998-09-21 | Paper |
| Three easy special cases of the euclidean travelling salesman problem | 1998-06-08 | Paper |
| Sometimes Travelling is Easy: The Master Tour Problem | 1998-05-11 | Paper |
| The Convex-hull-and-k-line Travelling Salesman Problem | 1997-02-27 | Paper |
| On the recognition of permuted Supnick and incomplete Monge matrices | 1996-10-27 | Paper |
| Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood | 1995-05-04 | Paper |
| The convex-hull-and-line traveling salesman problem: A solvable case | 1994-09-05 | Paper |
| A general approach to avoiding two by two submatrices | 1994-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832350 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3892067 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3951909 | 1979-01-01 | Paper |
