| Publication | Date of Publication | Type |
|---|
| Gerhard J. Woeginger 1964--2022 | 2024-10-22 | Paper |
| A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem | 2024-07-05 | Paper |
| One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs | 2024-06-05 | Paper |
| A linear time algorithm for linearizing quadratic and higher-order shortest path problems | 2023-11-09 | Paper |
| The bipartite travelling salesman problem: A pyramidally solvable case | 2023-02-10 | Paper |
| Minimum cost dynamic flows: The series-parallel case | 2022-08-30 | Paper |
| Linearizable special cases of the quadratic shortest path problem | 2022-06-08 | Paper |
| 2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics | 2022-03-11 | Paper |
| The constant objective value property for multidimensional assignment problems | 2018-05-24 | Paper |
| Geometric versions of the three-dimensional assignment problem under general norms | 2018-05-24 | Paper |
| 2VRP: a benchmark problem for small but rich VRPs | 2018-02-22 | Paper |
| Four-point conditions for the TSP: the complete complexity classification | 2015-04-09 | Paper |
| The constant objective value property for combinatorial optimization problems | 2014-05-19 | Paper |
| Uniqueness in quadratic and hyperbolic \(0-1\) programming problems | 2014-05-15 | Paper |
| The Northwest corner rule revisited | 2011-08-10 | Paper |
| ILP Models for a Nurse Scheduling Problem | 2011-04-07 | Paper |
| A fast parametric assignment algorithm with applications in max-algebra | 2010-11-24 | Paper |
| Four point conditions and exponential neighborhoods for symmetric TSP | 2010-08-16 | Paper |
| The computational complexity of bilevel assignment problems | 2010-06-16 | 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 |
| Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem | 2007-06-21 | Paper |
| Exact algorithms for the Hamiltonian cycle problem in planar graphs | 2006-06-30 | Paper |
| Faster algorithms for computing power indices in weighted voting games | 2005-06-01 | Paper |
| Minimum-cost dynamic flows: The series-parallel case | 2004-08-04 | Paper |
| Which matrices are immune against the transportation paradox? | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547466 | 2003-01-30 | Paper |
| Minimum-cost strong network orientation problems: Classification, complexity, and algorithms | 2002-07-21 | Paper |
| A note on the complexity of the transportation problem with a permutable demand vector | 2001-09-03 | Paper |
| Bottleneck capacity expansion problems with general budget constraints | 2001-01-01 | Paper |
| A process scheduling problem arising from chemical production planning | 2000-06-04 | Paper |
| The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices | 1999-11-08 | Paper |
| The Steiner tree problem in Kalmanson matrices and in circulant matrices | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4254354 | 1999-06-29 | Paper |
| One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs | 1998-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4394600 | 1998-06-11 | Paper |
| The computational complexity of Steiner tree problems in graded matrices | 1997-12-09 | Paper |
| Perspectives of Monge properties in optimization | 1996-10-09 | Paper |
| On the recognition of permuted bottleneck Monge matrices | 1996-07-04 | Paper |
| Permuting matrices to avoid forbidden submatrices | 1996-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321551 | 1995-01-23 | Paper |
| The quickest flow problem | 1993-05-03 | Paper |
