Gerold Jäger - RankMe

63 papers A 2B 2C 12Misc 1Journal 39Unranked 7

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