| 2008 |
|---|
| 12 | EE | Gerold Jäger,
Paul Molitor:
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.
COCOA 2008: 211-224 |
| 2007 |
|---|
| 11 | EE | Gerold Jäger,
Anand Srivastav,
Katja Wolf:
Solving Generalized Maximum Dispersion with Linear Programming.
AAIM 2007: 1-10 |
| 10 | EE | Dirk Richter,
Boris Goldengorin,
Gerold Jäger,
Paul Molitor:
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.
CAAN 2007: 99-111 |
| 2006 |
|---|
| 9 | EE | Boris Goldengorin,
Gerold Jäger,
Paul Molitor:
Some Basics on Tolerances.
AAIM 2006: 194-206 |
| 8 | EE | Boris Goldengorin,
Gerold Jäger,
Paul Molitor:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
CAAN 2006: 86-97 |
| 2005 |
|---|
| 7 | EE | Gerold Jäger:
Reduction of Smith Normal Form Transformation Matrices.
Computing 74(4): 377-388 (2005) |
| 6 | EE | Gerold Jäger,
Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
J. Comb. Optim. 10(2): 133-167 (2005) |
| 5 | EE | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of sparse asymmetric connectors with number theoretic methods.
Networks 45(3): 119-124 (2005) |
| 2004 |
|---|
| 4 | EE | Gerold Jäger,
Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
FSTTCS 2004: 348-359 |
| 3 | EE | Gerold Jäger:
A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines.
IPDPS 2004 |
| 2003 |
|---|
| 2 | EE | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of Sparse Asymmetric Connectors: Extended Abstract.
FSTTCS 2003: 13-22 |
| 1 | EE | Gerold Jäger:
Parallel Algorithm for Computing the Smith Normal Form of Large Matrices.
PVM/MPI 2003: 170-179 |
