Gerold Jäger

According to our database1, Gerold Jäger authored at least 45 papers between 2003 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Bounds for the Static Permutation Mastermind game.
Discret. Math., 2021

2020
The metric dimension of Zn×Zn×Zn is ⌊3<i>n</i>/2⌋.
Theor. Comput. Sci., 2020

2019
Enumeration of Sets of Mutually Orthogonal Latin Rectangles.
CoRR, 2019

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

2018
Extending single tolerances to set tolerances.
Discret. Appl. Math., 2018

Triples of Orthogonal Latin and Youden Rectangles For Small Orders.
CoRR, 2018

An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
Bounds for Static Black-Peg AB Mastermind.
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.
J. Discrete Algorithms, 2016

An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Bounding memory for Mastermind might not make it harder.
Theor. Comput. Sci., 2015

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.
J. Oper. Res. Soc., 2015

SAT and IP based algorithms for magic labeling including a complete search for total magic labelings.
J. Discrete Algorithms, 2015

The worst case number of questions in Generalized AB game with and without white-peg answers.
Discret. Appl. Math., 2015

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

On the Zero Forcing Number of Bijection Graphs.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
A backbone based TSP heuristic for large instances.
J. Heuristics, 2014

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics.
Discret. Appl. Math., 2014

The Theory of Set Tolerances.
Proceedings of the Learning and Intelligent Optimization, 2014

Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
SAT and IP Based Algorithms for Magic Labeling with Applications.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
The b-Matching Problem in Hypergraphs: Hardness and Approximability.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
The number of pessimistic guesses in Generalized Black-peg Mastermind.
Inf. Process. Lett., 2011

2010
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem.
J. Artif. Intell. Res., 2010

A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem.
Proceedings of the Computer Science, 2010

An Effective SAT Encoding for Magic Labeling.
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.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Efficient parallelizations of Hermite and Smith normal form algorithms.
Parallel Comput., 2009

The number of pessimistic guesses in Generalized Mastermind.
Inf. Process. Lett., 2009

How frugal is mother nature with haplotypes?
Bioinform., 2009

Complete Parsimony Haplotype Inference Problem and Algorithms.
Proceedings of the Algorithms, 2009

Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem.
Algorithmic Oper. Res., 2008

Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

Solving Generalized Maximum Dispersion with Linear Programming.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Some Basics on Tolerances.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Constructions of sparse asymmetric connectors with number theoretic methods.
Networks, 2005

Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
J. Comb. Optim., 2005

Reduction of Smith Normal Form Transformation Matrices.
Computing, 2005

2004
A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines.
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.
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.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003


  Loading...