The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gerold Jäger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boris Goldengorin, Gerold Jäger, Paul Molitor
    Some Basics on Tolerances. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:194-206 [Conf]
  2. Boris Goldengorin, Gerold Jäger, Paul Molitor
    Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
    CAAN, 2006, pp:86-97 [Conf]
  3. Andreas Baltz, Gerold Jäger, Anand Srivastav
    Constructions of Sparse Asymmetric Connectors: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:13-22 [Conf]
  4. Gerold Jäger, Anand Srivastav
    Improved Approximation Algorithms for Maximum Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:348-359 [Conf]
  5. Gerold Jäger
    A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  6. Gerold Jäger
    Parallel Algorithm for Computing the Smith Normal Form of Large Matrices. [Citation Graph (0, 0)][DBLP]
    PVM/MPI, 2003, pp:170-179 [Conf]
  7. G. Jäger
    Reduction of Smith Normal Form Transformation Matrices. [Citation Graph (0, 0)][DBLP]
    Computing, 2005, v:74, n:4, pp:377-388 [Journal]
  8. Gerold Jäger, Anand Srivastav
    Improved Approximation Algorithms for Maximum Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:10, n:2, pp:133-167 [Journal]
  9. Andreas Baltz, Gerold Jäger, Anand Srivastav
    Constructions of sparse asymmetric connectors with number theoretic methods. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:3, pp:119-124 [Journal]
  10. Gerold Jäger, Anand Srivastav, Katja Wolf
    Solving Generalized Maximum Dispersion with Linear Programming. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:1-10 [Conf]

  11. Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. [Citation Graph (, )][DBLP]


  12. Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. [Citation Graph (, )][DBLP]


  13. Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. [Citation Graph (, )][DBLP]


  14. A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem. [Citation Graph (, )][DBLP]


  15. Complete Parsimony Haplotype Inference Problem and Algorithms. [Citation Graph (, )][DBLP]


  16. Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. [Citation Graph (, )][DBLP]


  17. Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. [Citation Graph (, )][DBLP]


  18. How frugal is mother nature with haplotypes? [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002