 | 2009 |
| 18 |  | Changxing Dong,
Gerold Jäger,
Dirk Richter,
Paul Molitor:
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.
AAIM 2009: 175-187 |
| 17 |  | Changxing Dong,
Christian Ernst,
Gerold Jäger,
Dirk Richter,
Paul Molitor:
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.
CTW 2009: 3-6 |
| 16 |  | Gerold Jäger,
Sharlee Climer,
Weixiong Zhang:
Complete Parsimony Haplotype Inference Problem and Algorithms.
ESA 2009: 337-348 |
| 15 |  | Sharlee Climer,
Gerold Jäger,
Alan R. Templeton,
Weixiong Zhang:
How frugal is mother nature with haplotypes?
Bioinformatics 25(1): 68-74 (2009) |
| 14 |  | Gerold Jäger,
Marcin Peczarski:
The number of pessimistic guesses in Generalized Mastermind.
Inf. Process. Lett. 109(12): 635-641 (2009) |
| 13 |  | Gerold Jäger,
Clemens Wagner:
Efficient parallelizations of Hermite and Smith normal form algorithms.
Parallel Computing 35(6): 345-357 (2009) |
| 2008 |
| 12 |  | Gerold Jäger,
Paul Molitor:
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.
COCOA 2008: 211-224 |
| 2007 |
| 11 |  | Gerold Jäger,
Anand Srivastav,
Katja Wolf:
Solving Generalized Maximum Dispersion with Linear Programming.
AAIM 2007: 1-10 |
| 10 |  | 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 |  | Boris Goldengorin,
Gerold Jäger,
Paul Molitor:
Some Basics on Tolerances.
AAIM 2006: 194-206 |
| 8 |  | Boris Goldengorin,
Gerold Jäger,
Paul Molitor:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
CAAN 2006: 86-97 |
| 2005 |
| 7 |  | Gerold Jäger:
Reduction of Smith Normal Form Transformation Matrices.
Computing 74(4): 377-388 (2005) |
| 6 |  | Gerold Jäger,
Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
J. Comb. Optim. 10(2): 133-167 (2005) |
| 5 |  | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of sparse asymmetric connectors with number theoretic methods.
Networks 45(3): 119-124 (2005) |
| 2004 |
| 4 |  | Gerold Jäger,
Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
FSTTCS 2004: 348-359 |
| 3 |  | Gerold Jäger:
A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines.
IPDPS 2004 |
| 2003 |
| 2 |  | Andreas Baltz,
Gerold Jäger,
Anand Srivastav:
Constructions of Sparse Asymmetric Connectors: Extended Abstract.
FSTTCS 2003: 13-22 |
| 1 |  | Gerold Jäger:
Parallel Algorithm for Computing the Smith Normal Form of Large Matrices.
PVM/MPI 2003: 170-179 |