12 citations · 27 across the 7 of their papers we have counts for
9 papers
Algorithms for Computing Set Tolerances: Theory, Computational Analysis and Applications
Gerold Jäger, Dmitrii Panasenko
The regular set tolerance is an important term in sensitivity analysis. For combinatorial sum problems, e.g., the Traveling Salesman Problem, Shortest Path Problem and Minimum Span…
Exact number of flips required to sort a burnt stack of pancakes
Gerold Jäger, Nacim Oijid
In this work, we consider the burnt pancake problem, which is a well-studied problem going back to a work of Gates and Papadimitriou from 1979.The problem is to sort a stack of~…
Enumeration of Row-Column Designs
Gerold Jäger, Klas Markström, Lars-Daniel Öhman +1
We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two ne…
Extending the definition of set tolerances
Gerold Jäger, Marcel Turkensteen
Optimal solutions of combinatorial optimization problems can be sensitive to changes in the cost of one or more elements of the ground set E. Single and set tolerances measure the…
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
Gerold Jäger, Klas Markström, Denys Shcherbak +1
We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually…
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs
Gerold Jäger, Klas Markström, Denys Shcherbak +1
In this paper we first study Youden rectangles of small orders. We have enumerated all Youden rectangles for a range of small parameter values, excluding the almost sq…
Triples of Orthogonal Latin and Youden Rectangles For Small Orders
Gerold Jäger, Klas Markström, Lars-Daniel Öhman +1
We have performed a complete enumeration of non-isotopic triples of mutually orthogonal Latin rectangles for . Here we will present a census of such tri…
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
Gerold Jäger, Weixiong Zhang
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, in…
The Worst Case Number of Questions in Generalized AB Game with and without White-peg Answers
Gerold Jäger, Marcin Peczarski
The AB game is a two-player game, where the codemaker has to choose a secret code and the codebreaker has to guess it in as few questions as possible. It is a variant of the famous…