| Tolerances applied in combinatorial optimization B Goldengorin, G Jäger, P Molitor J. Comput. Sci 2 (9), 716-734, 2006 | 38 | 2006 |
| Improved approximation algorithms for maximum graph partitioning problems G Jäger, A Srivastav Journal of combinatorial optimization 10 (2), 133-167, 2005 | 36* | 2005 |
| Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics A Fischer, F Fischer, G Jäger, J Keilwagen, P Molitor, I Grosse Discrete Applied Mathematics 166, 97-114, 2014 | 35 | 2014 |
| Algorithms and experimental study for the traveling salesman problem of second order G Jäger, P Molitor International Conference on Combinatorial Optimization and Applications, 211-224, 2008 | 33 | 2008 |
| Improved approximation algorithms for maximum graph partitioning problems G Jäger, A Srivastav Journal of combinatorial optimization 10 (2), 133-167, 2005 | 31 | 2005 |
| Exact and heuristic algorithms for the travelling salesman problem with multiple time windows and hotel selection A Baltz, M El Ouali, G Jäger, V Sauerland, A Srivastav Journal of the Operational Research Society 66 (4), 615-626, 2015 | 25 | 2015 |
| Improving the efficiency of Helsgaun’s Lin-Kernighan heuristic for the symmetric TSP D Richter, B Goldengorin, G Jäger, P Molitor Workshop on Combinatorial and Algorithmic Aspects of Networking, 99-111, 2007 | 21 | 2007 |
| Some basics on tolerances B Goldengorin, G Jäger, P Molitor International Conference on Algorithmic Applications in Management, 194-206, 2006 | 20 | 2006 |
| The number of pessimistic guesses in Generalized Mastermind G Jäger, M Peczarski Information Processing Letters 109 (12), 635-641, 2009 | 19 | 2009 |
| The number of pessimistic guesses in Generalized Black-peg Mastermind G Jäger, M Peczarski Information Processing Letters 111 (19), 933-940, 2011 | 17 | 2011 |
| Tolerance based contract-or-patch heuristic for the asymmetric TSP B Goldengorin, G Jäger, P Molitor Workshop on Combinatorial and Algorithmic Aspects of Networking, 86-97, 2006 | 14 | 2006 |
| How frugal is mother nature with haplotypes? S Climer, G Jäger, AR Templeton, W Zhang Bioinformatics 25 (1), 68-74, 2009 | 13 | 2009 |
| Efficient parallelizations of Hermite and Smith normal form algorithms G Jäger, C Wagner Parallel Computing 35 (6), 345-357, 2009 | 11 | 2009 |
| The theory of tolerances with applications to the traveling salesman problem G Jäger Christian Albrechts Universität Kiel, 2011 | 10 | 2011 |
| Effective tour searching for TSP by contraction of pseudo backbone edges C Dong, G Jäger, D Richter, P Molitor International Conference on Algorithmic Applications in Management, 175-187, 2009 | 10 | 2009 |
| The worst case number of questions in Generalized AB game with and without white-peg answers G Jäger, M Peczarski Discrete Applied Mathematics 184, 20-31, 2015 | 9 | 2015 |
| The theory of set tolerances G Jäger, B Goldengorin, PM Pardalos International Conference on Learning and Intelligent Optimization, 362-377, 2014 | 9 | 2014 |
| An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem G Jäger, W Zhang Journal of Artificial Intelligence Research 39, 663-687, 2010 | 9 | 2010 |
| Parallel algorithms for computing the Smith Normal Form of large matrices G Jäger European Parallel Virtual Machine/Message Passing Interface Users’ Group …, 2003 | 9 | 2003 |
| A backbone based TSP heuristic for large instances G Jäger, C Dong, B Goldengorin, P Molitor, D Richter Journal of Heuristics 20 (1), 107-124, 2014 | 8 | 2014 |
