dblp.uni-trier.dewww.uni-trier.de

Gerold Jäger

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Andreas Baltz [2] [5]
2Boris Goldengorin [8] [9] [10]
3Paul Molitor [8] [9] [10] [12]
4Dirk Richter [10]
5Anand Srivastav [2] [4] [5] [6] [11]
6Katja Wolf [11]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)