Gerold Jäger

According to our database, Gerold Jäger authored at least 49 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Optimal strategies for the static black-peg AB game with two and three pegs.

Gerold Jäger, Frank Drewes

Discret. Math. Algorithms Appl., May, 2024

Extending the definition of set tolerances.

Gerold Jäger, Marcel Turkensteen

CoRR, 2024

Enumeration of Sets of Mutually Orthogonal Latin Rectangles.

Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak

Electron. J. Comb., 2024

2023

Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs.

Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman

Discret. Math. Theor. Comput. Sci., 2023

2022

Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems.

Marcel Turkensteen, Gerold Jäger

Theor. Comput. Sci., 2022

2021

Bounds for the Static Permutation Mastermind game.

Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav

Discret. Math., 2021

2020

The metric dimension of Zn×Zn×Zn is ⌊3<i>n</i>/2⌋.

Gerold Jäger, Frank Drewes

Theor. Comput. Sci., 2020

2019

Small Youden Rectangles and Their Connections to Other Row-Column Designs.

Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman

CoRR, 2019

2018

Extending single tolerances to set tolerances.

Gerold Jäger, Marcel Turkensteen

Discret. Appl. Math., 2018

Triples of Orthogonal Latin and Youden Rectangles For Small Orders.

Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak

CoRR, 2018

An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs.

Gerold Jäger, Frank Drewes

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

Bounds for Static Black-Peg AB Mastermind.

Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability.

Gerold Jäger, Sharlee Climer, Weixiong Zhang

J. Discrete Algorithms, 2016

An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs.

Gerold Jäger

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Bounding memory for Mastermind might not make it harder.

Gerold Jäger, Marcin Peczarski

Theor. Comput. Sci., 2015

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.

Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav

J. Oper. Res. Soc., 2015

SAT and IP based algorithms for magic labeling including a complete search for total magic labelings.

Gerold Jäger, Florian Arnold

J. Discrete Algorithms, 2015

The worst case number of questions in Generalized AB game with and without white-peg answers.

Gerold Jäger, Marcin Peczarski

Discret. Appl. Math., 2015

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem.

Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse

Comput., 2015

On the Zero Forcing Number of Bijection Graphs.

Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

A backbone based TSP heuristic for large instances.

Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter

J. Heuristics, 2014

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics.

Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse

Discret. Appl. Math., 2014

The Theory of Set Tolerances.

Gerold Jäger, Boris Goldengorin, Panos M. Pardalos

Proceedings of the Learning and Intelligent Optimization, 2014

Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory.

Gerold Jäger, Marcin Peczarski

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

SAT and IP Based Algorithms for Magic Labeling with Applications.

Gerold Jäger

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

The b-Matching Problem in Hypergraphs: Hardness and Approximability.

Mourad El Ouali, Gerold Jäger

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

The number of pessimistic guesses in Generalized Black-peg Mastermind.

Gerold Jäger, Marcin Peczarski

Inf. Process. Lett., 2011

2010

An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem.

Gerold Jäger, Weixiong Zhang

J. Artif. Intell. Res., 2010

A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem.

Gerold Jäger, Weixiong Zhang

Proceedings of the Computer Science, 2010

An Effective SAT Encoding for Magic Labeling.

Gerold Jäger

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction.

Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Efficient parallelizations of Hermite and Smith normal form algorithms.

Gerold Jäger, Clemens Wagner

Parallel Comput., 2009

The number of pessimistic guesses in Generalized Mastermind.

Gerold Jäger, Marcin Peczarski

Inf. Process. Lett., 2009

How frugal is mother nature with haplotypes?

Sharlee Climer, Gerold Jäger, Alan R. Templeton, Weixiong Zhang

Bioinform., 2009

Complete Parsimony Haplotype Inference Problem and Algorithms.

Gerold Jäger, Sharlee Climer, Weixiong Zhang

Proceedings of the Algorithms, 2009

Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.

Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.

Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem.

Boris Goldengorin, Gerold Jäger

Algorithmic Oper. Res., 2008

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.

Gerold Jäger, Paul Molitor

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.

Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

Solving Generalized Maximum Dispersion with Linear Programming.

Gerold Jäger, Anand Srivastav, Katja Wolf

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.

Boris Goldengorin, Gerold Jäger, Paul Molitor

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Some Basics on Tolerances.

Boris Goldengorin, Gerold Jäger, Paul Molitor

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Constructions of sparse asymmetric connectors with number theoretic methods.

Andreas Baltz, Gerold Jäger, Anand Srivastav

Networks, 2005

Improved Approximation Algorithms for Maximum Graph Partitioning Problems.

Gerold Jäger, Anand Srivastav

J. Comb. Optim., 2005

Reduction of Smith Normal Form Transformation Matrices.

Gerold Jäger

Computing, 2005

2004

A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines.

Gerold Jäger

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Parallel Algorithm for Computing the Smith Normal Form of Large Matrices.

Gerold Jäger

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003

Constructions of Sparse Asymmetric Connectors: Extended Abstract.

Andreas Baltz, Gerold Jäger, Anand Srivastav

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003