Gerold Jäger

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 18

Top Topics

Exact Algorithms

Integer Programming

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Gerold Jäger, Marcel Turkensteen
Assessing the effect of multiple cost changes using reverse set tolerances. Discret. Appl. Math. 354 (2024)
Gerold Jäger, Marcel Turkensteen
Extending the definition of set tolerances. CoRR (2024)
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
Enumeration of Row-Column Designs. CoRR (2024)
Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä
Super domination: Graph classes, products and enumeration. Discret. Appl. Math. 349 (2024)
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. Electron. J. Comb. 31 (1) (2024)
Gerold Jäger, Frank Drewes
Optimal strategies for the static black-peg AB game with two and three pegs. Discret. Math. Algorithms Appl. 16 (4) (2024)
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs. Discret. Math. Theor. Comput. Sci. 25 (2023)
Marcel Turkensteen, Gerold Jäger
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems. Theor. Comput. Sci. 937 (2022)
Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav
Bounds for the Static Permutation Mastermind game. Discret. Math. 344 (3) (2021)
Gerold Jäger, Frank Drewes
/2⌋. Theor. Comput. Sci. 806 (2020)
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. CoRR (2019)
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman
Small Youden Rectangles and Their Connections to Other Row-Column Designs. CoRR (2019)
Gerold Jäger, Marcel Turkensteen
Extending single tolerances to set tolerances. Discret. Appl. Math. 247 (2018)
Gerold Jäger, Frank Drewes
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. SAGT (2018)
Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak
Triples of Orthogonal Latin and Youden Rectangles For Small Orders. CoRR (2018)
Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav
Bounds for Static Black-Peg AB Mastermind. COCOA (2) (2017)
Gerold Jäger
An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs. COCOA (2016)
Gerold Jäger, Sharlee Climer, Weixiong Zhang
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability. J. Discrete Algorithms 37 (2016)
Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. Comput. 3 (2) (2015)
Gerold Jäger, Florian Arnold
SAT and IP based algorithms for magic labeling including a complete search for total magic labelings. J. Discrete Algorithms 31 (2015)
Gerold Jäger, Marcin Peczarski
The worst case number of questions in Generalized AB game with and without white-peg answers. Discret. Appl. Math. 184 (2015)
Gerold Jäger, Marcin Peczarski
Bounding memory for Mastermind might not make it harder. Theor. Comput. Sci. 596 (2015)
Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman
On the Zero Forcing Number of Bijection Graphs. IWOCA (2015)
Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. J. Oper. Res. Soc. 66 (4) (2015)
Gerold Jäger, Boris Goldengorin, Panos M. Pardalos
The Theory of Set Tolerances. LION (2014)
Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter
A backbone based TSP heuristic for large instances. J. Heuristics 20 (1) (2014)
Anja Fischer, Frank Fischer, Gerold Jäger, Jens Keilwagen, Paul Molitor, Ivo Grosse
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. Discret. Appl. Math. 166 (2014)
Gerold Jäger, Weixiong Zhang
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem. CoRR (2014)
Gerold Jäger, Marcin Peczarski
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. IWOCA (2014)
Gerold Jäger, Marcin Peczarski
The Worst Case Number of Questions in Generalized AB Game with and without White-peg Answers. CoRR (2013)
Gerold Jäger
SAT and IP Based Algorithms for Magic Labeling with Applications. IWOCA (2013)
Mourad El Ouali, Gerold Jäger
The b-Matching Problem in Hypergraphs: Hardness and Approximability. COCOA (2012)
Gerold Jäger, Marcin Peczarski
The number of pessimistic guesses in Generalized Black-peg Mastermind. Inf. Process. Lett. 111 (19) (2011)
Gerold Jäger, Weixiong Zhang
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem. CSR (2010)
Gerold Jäger
An Effective SAT Encoding for Magic Labeling. CTW (2010)
Gerold Jäger, Weixiong Zhang
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem. J. Artif. Intell. Res. 39 (2010)
Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. AAIM (2010)
Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. CTW (2009)
Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. AAIM (2009)
Gerold Jäger, Clemens Wagner
Efficient parallelizations of Hermite and Smith normal form algorithms. Parallel Comput. 35 (6) (2009)
Sharlee Climer, Gerold Jäger, Alan R. Templeton, Weixiong Zhang
How frugal is mother nature with haplotypes? Bioinform. 25 (1) (2009)
Gerold Jäger, Sharlee Climer, Weixiong Zhang
Complete Parsimony Haplotype Inference Problem and Algorithms. ESA (2009)
Gerold Jäger, Marcin Peczarski
The number of pessimistic guesses in Generalized Mastermind. Inf. Process. Lett. 109 (12) (2009)
Gerold Jäger, Paul Molitor
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. COCOA (2008)
Boris Goldengorin, Gerold Jäger
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem. Algorithmic Oper. Res. 3 (1) (2008)
Gerold Jäger, Anand Srivastav, Katja Wolf
Solving Generalized Maximum Dispersion with Linear Programming. AAIM (2007)
Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN (2007)
Boris Goldengorin, Gerold Jäger, Paul Molitor
Some Basics on Tolerances. AAIM (2006)
Boris Goldengorin, Gerold Jäger, Paul Molitor
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN (2006)
Andreas Baltz, Gerold Jäger, Anand Srivastav
Constructions of sparse asymmetric connectors with number theoretic methods. Networks 45 (3) (2005)
Gerold Jäger
Reduction of Smith Normal Form Transformation Matrices. Computing 74 (4) (2005)
Gerold Jäger, Anand Srivastav
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. J. Comb. Optim. 10 (2) (2005)
Gerold Jäger
A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines. IPDPS (2004)
Gerold Jäger, Anand Srivastav
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. FSTTCS (2004)
Andreas Baltz, Gerold Jäger, Anand Srivastav
Constructions of Sparse Asymmetric Connectors: Extended Abstract. FSTTCS (2003)
Gerold Jäger
Parallel Algorithm for Computing the Smith Normal Form of Large Matrices. PVM/MPI (2003)