default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerold Jäger
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]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)- [j25]Nima Ghanbari
, Gerold Jäger, Tuomo Lehtilä:
Super domination: Graph classes, products and enumeration. Discret. Appl. Math. 349: 8-24 (2024) - [j24]Gerold Jäger, Marcel Turkensteen:
Assessing the effect of multiple cost changes using reverse set tolerances. Discret. Appl. Math. 354: 279-300 (2024) - [j23]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): 2350049:1-2350049:34 (2024) - [i8]Gerold Jäger, Marcel Turkensteen:
Extending the definition of set tolerances. CoRR abs/2402.14542 (2024) - [i7]Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak:
Enumeration of Row-Column Designs. CoRR abs/2406.16444 (2024) - [i6]Valentin Gledel, Gerold Jäger:
On the Metric Dimension of Ka ⨉ Kb ⨉ Kc. CoRR abs/2408.17229 (2024) - 2023
- [j22]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) - 2022
- [j21]Marcel Turkensteen, Gerold Jäger:
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems. Theor. Comput. Sci. 937: 1-21 (2022) - 2021
- [j20]Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav:
Bounds for the Static Permutation Mastermind game. Discret. Math. 344(3): 112253 (2021) - 2020
- [j19]Gerold Jäger, Frank Drewes:
The metric dimension of Zn×Zn×Zn is ⌊3n/2⌋. Theor. Comput. Sci. 806: 344-362 (2020)
2010 – 2019
- 2019
- [i5]Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
Small Youden Rectangles and Their Connections to Other Row-Column Designs. CoRR abs/1910.02791 (2019) - [i4]Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman:
Enumeration of Sets of Mutually Orthogonal Latin Rectangles. CoRR abs/1910.02950 (2019) - 2018
- [j18]Gerold Jäger, Marcel Turkensteen:
Extending single tolerances to set tolerances. Discret. Appl. Math. 247: 197-215 (2018) - [c23]Gerold Jäger, Frank Drewes:
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. SAGT 2018: 261-266 - [i3]Gerold Jäger, Klas Markström, Lars-Daniel Öhman, Denys Shcherbak:
Triples of Orthogonal Latin and Youden Rectangles For Small Orders. CoRR abs/1810.12639 (2018) - 2017
- [c22]Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav:
Bounds for Static Black-Peg AB Mastermind. COCOA (2) 2017: 409-424 - 2016
- [j17]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: 68-83 (2016) - [c21]Gerold Jäger:
An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs. COCOA 2016: 670-682 - 2015
- [j16]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): 285-298 (2015) - [j15]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: 20-31 (2015) - [j14]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: 87-103 (2015) - [j13]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): 615-626 (2015) - [j12]Gerold Jäger, Marcin Peczarski:
Bounding memory for Mastermind might not make it harder. Theor. Comput. Sci. 596: 55-66 (2015) - [c20]Denys Shcherbak, Gerold Jäger, Lars-Daniel Öhman:
On the Zero Forcing Number of Bijection Graphs. IWOCA 2015: 334-345 - 2014
- [j11]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: 97-114 (2014) - [j10]Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter:
A backbone based TSP heuristic for large instances. J. Heuristics 20(1): 107-124 (2014) - [c19]Gerold Jäger, Marcin Peczarski:
Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. IWOCA 2014: 188-199 - [c18]Gerold Jäger, Boris Goldengorin, Panos M. Pardalos:
The Theory of Set Tolerances. LION 2014: 362-377 - [i2]Gerold Jäger, Weixiong Zhang:
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem. CoRR abs/1401.3863 (2014) - 2013
- [c17]Gerold Jäger:
SAT and IP Based Algorithms for Magic Labeling with Applications. IWOCA 2013: 258-268 - [i1]Gerold Jäger, Marcin Peczarski:
The Worst Case Number of Questions in Generalized AB Game with and without White-peg Answers. CoRR abs/1306.1713 (2013) - 2012
- [c16]Mourad El Ouali, Gerold Jäger:
The b-Matching Problem in Hypergraphs: Hardness and Approximability. COCOA 2012: 200-211 - 2011
- [j9]Gerold Jäger, Marcin Peczarski:
The number of pessimistic guesses in Generalized Black-peg Mastermind. Inf. Process. Lett. 111(19): 933-940 (2011) - 2010
- [j8]Gerold Jäger, Weixiong Zhang:
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem. J. Artif. Intell. Res. 39: 663-687 (2010) - [c15]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: 119-130 - [c14]Gerold Jäger:
An Effective SAT Encoding for Magic Labeling. CTW 2010: 97-100 - [c13]Gerold Jäger, Weixiong Zhang:
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem. CSR 2010: 216-227
2000 – 2009
- 2009
- [j7]Sharlee Climer, Gerold Jäger, Alan R. Templeton, Weixiong Zhang:
How frugal is mother nature with haplotypes? Bioinform. 25(1): 68-74 (2009) - [j6]Gerold Jäger, Marcin Peczarski:
The number of pessimistic guesses in Generalized Mastermind. Inf. Process. Lett. 109(12): 635-641 (2009) - [j5]Gerold Jäger, Clemens Wagner:
Efficient parallelizations of Hermite and Smith normal form algorithms. Parallel Comput. 35(6): 345-357 (2009) - [c12]Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor:
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. AAIM 2009: 175-187 - [c11]Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor:
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones. CTW 2009: 3-6 - [c10]Gerold Jäger, Sharlee Climer, Weixiong Zhang:
Complete Parsimony Haplotype Inference Problem and Algorithms. ESA 2009: 337-348 - 2008
- [j4]Boris Goldengorin, Gerold Jäger:
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem. Algorithmic Oper. Res. 3(1) (2008) - [c9]Gerold Jäger, Paul Molitor:
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. COCOA 2008: 211-224 - 2007
- [c8]Gerold Jäger, Anand Srivastav, Katja Wolf:
Solving Generalized Maximum Dispersion with Linear Programming. AAIM 2007: 1-10 - [c7]Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor:
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN 2007: 99-111 - 2006
- [c6]Boris Goldengorin, Gerold Jäger, Paul Molitor:
Some Basics on Tolerances. AAIM 2006: 194-206 - [c5]Boris Goldengorin, Gerold Jäger, Paul Molitor:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN 2006: 86-97 - 2005
- [j3]Gerold Jäger:
Reduction of Smith Normal Form Transformation Matrices. Computing 74(4): 377-388 (2005) - [j2]Gerold Jäger, Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. J. Comb. Optim. 10(2): 133-167 (2005) - [j1]Andreas Baltz, Gerold Jäger, Anand Srivastav:
Constructions of sparse asymmetric connectors with number theoretic methods. Networks 45(3): 119-124 (2005) - 2004
- [c4]Gerold Jäger, Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. FSTTCS 2004: 348-359 - [c3]Gerold Jäger:
A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines. IPDPS 2004 - 2003
- [c2]Andreas Baltz, Gerold Jäger, Anand Srivastav:
Constructions of Sparse Asymmetric Connectors: Extended Abstract. FSTTCS 2003: 13-22 - [c1]Gerold Jäger:
Parallel Algorithm for Computing the Smith Normal Form of Large Matrices. PVM/MPI 2003: 170-179
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 01:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
