"False"
Umeå universitet
printicon
Huvudmenyn dold.
Personalbild Gerold Jäger

Gerold Jäger

Jag är docent i diskret matematik. Min forskning är kombinatorisk optimering, grafteori och algoritmik, t. ex. Handelsresandeproblemet och Mastermind.

Vetenskaplig meritering: Docent

Kontakt

E-post
gerold.jager@umu.se
Telefon
090-786 61 41

Verksam vid

Anknytning
Universitetslektor vid Institutionen för matematik och matematisk statistik
Plats
MIT-huset, plan 3, Matematik och matematisk statistik, MIT.B.347 Umeå universitet, 901 87 Umeå

Mina forskningsämnen är diskret matematik, kombinatorisk optimering, grafteori och algoritmik. Det innefattar Handelsresandeproblemet, spelteori (särskilt Mastermind), teori av Latinska kvadrater och känslighetsanalys.

Biografi

Jag disputerade 2001 vid Essen University i Tyskland. Mellan 2001 och 2010 var jag postdoktor vid Christian-Albrechts-Universität zu Kiel, Martin-Luther Universität Halle-Wittenberg (både Tyskland) och Washington University St. Louis (USA). Från 2010 till 2011 var jag gästprofessor vid Technische Universität Clausthal (Tyskland). Sedan 2011 arbetar jag vid Umeå universitet som universitetslektor och i juni 2013 blev jag docent i matematik.

Super domination: graph classes, products and enumeration
Discrete Applied Mathematics, Elsevier 2024, Vol. 349 : 8-24
Ghanbari, Nima; Jäger, Gerold; Lehtilä, Tuomo
Optimal strategies for the static black-peg AB game with two and three pegs
Discrete Mathematics, Algorithms and Applications (DMAA), World Scientific 2024, Vol. 16, (4)
Jäger, Gerold; Drewes, Frank
Assessing the effect of multiple cost changes using reverse set tolerances
Discrete Applied Mathematics, Elsevier 2024, Vol. 354 : 279-300
Jäger, Gerold; Turkensteen, Marcel
Enumeration of sets of mutually orthogonal latin rectangles
The Electronic Journal of Combinatorics, Australian National University Press 2024, Vol. 31, (1)
Jäger, Gerold; Öhman, Lars-Daniel; Markström, Klas; et al.
Small youden rectangles, near youden rectangles, and their connections to other row-column designs
Discrete Mathematics & Theoretical Computer Science, Centre pour la Communication Scientifique Directe (CCSD) 2023, Vol. 25, (1)
Jäger, Gerold; Markström, Klas; Shcherbak, Denys; et al.
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Theoretical Computer Science, Elsevier 2022, Vol. 937 : 1-21
Turkensteen, Marcel; Jäger, Gerold
Bounds for the Static Permutation Mastermind game
Discrete Mathematics, Elsevier 2021, Vol. 344, (3)
Glazik, Christian; Jäger, Gerold; Schiemann, Jan; et al.
The Metric Dimension of Z(n) x Z(n) x Z(n) is [3n/2]
Theoretical Computer Science, Elsevier 2020, Vol. 806 : 344-362
Jäger, Gerold; Drewes, Frank
Triples of Orthogonal Latin and Youden Rectangles of small order
Journal of combinatorial designs (Print), Vol. 27, (4) : 229-250
Jäger, Gerold; Markström, Klas; Öhman, Lars-Daniel; et al.
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs
SAGT: International Symposium on Algorithmic Game Theory: 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings, Springer 2018 : 261-266
Jäger, Gerold; Drewes, Frank
Extending Single Tolerances to Set Tolerances
Discrete Applied Mathematics, Elsevier 2018, Vol. 247 : 197-215
Jäger, Gerold; Turkensteen, Marcel
Bounds for Static Black-Peg AB Mastermind
COCOA 2017: Combinatorial Optimization and Applications, Springer Berlin/Heidelberg 2017 : 409-424
Glazik, Christian; Jäger, Gerold; Schiemann, Jan; et al.
An Optimal Strategy for Static Mastermind with Two Pegs
Proceedings of 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016), Springer Berlin/Heidelberg 2016 : 670-682
Jäger, Gerold
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
Journal of Discrete Algorithms, Elsevier 2016, Vol. 37 : 68-83
Jäger, Gerold; Climer, Sharlee; Zhang, Weixiong
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection
Journal of the Operational Research Society, Vol. 66, (4) : 615-626
Baltz, Andreas; El Ouali, Mourad; Jäger, Gerold; et al.
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem
Computation, Vol. 3, (2) : 285-298
Fischer, Anja; Fischer, Frank; Jäger, Gerold; et al.
SAT and IP Based Algorithms for Magic Labeling Including a Complete Search for Total Magic Labelings
Journal of Discrete Algorithms, Vol. 31 : 87-103
Jäger, Gerold; Arnold, Florian
Bounding memory for Mastermind might not make it harder
Theoretical Computer Science, Vol. 596 : 55-66
Jäger, Gerold; Peczarski, Marcin
Playing several variants of mastermind with constant-size memory is not harder than with unbounded memory
Combinatorial Algorithms: 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers, Springer Berlin/Heidelberg 2015 : 188-199
Jäger, Gerold; Peczarski, Marcin
The worst case number of questions in Generalized AB game with and without white-peg answers
Discrete Applied Mathematics, Elsevier 2015, Vol. 184 : 20-31
Jäger, Gerold; Peczarski, Marcin
The Zero Forcing Number of Bijection Graphs
Proceedings of 26th International Workshop om Combinatorial Algorithms (IWOCA 2015), Berlin-Heidelberg: Springer 2015 : 334-345
Shcherbak, Denys; Jäger, Gerold; Öhman, Lars-Daniel
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics
Discrete Applied Mathematics, Vol. 166 : 97-114
Fischer, Anja; Fischer, Frank; Jäger, Gerold; et al.
A backbone based TSP heuristic for large instances
Journal of Heuristics, Vol. 20, (1) : 107-124
Jäger, Gerold; Dong, Changxing; Goldengorin, Boris; et al.
The Theory of Set Tolerances
LION 2014: Learning and Intelligent Optimization: Conference Proceedings : 362-377
Jäger, Gerold; Goldengorin, Boris; Pardalos, Panos M.
SAT and IP based algorithms for magic labeling with applications
Combinatorial algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers, Berlin-Heidelberg: Springer Berlin/Heidelberg 2013 : 258-268
Jäger, Gerold
The b-Matching Problem in Hypergraphs: Hardness and Approximability
COCOA 2012: Combinatorial Optimization and Applications, Berlin-Heidelberg: Springer Berlin-Heidelberg 2012 : 200-211
El Ouali, Mourad; Jäger, Gerold
The Theory of Tolerances with Applications to the Traveling Salesman Problem
Habilitation Thesis, Christian Albrechts Universität Kiel
Jäger, Gerold
The number of pessimistic guesses in Generalized Black-peg Mastermind
Information Processing Letters, Elsevier 2011, Vol. 111, (19) : 933-940
Jäger, Gerold; Peczarski, Marcin
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Proceedings of 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010), Berlin-Heidelberg: Springer 2010 : 119-130
Ernst, Christian; Dong, Changxing; Jäger, Gerold; et al.
An Effective SAT encoding for Magic Labeling
Proceedings of 9th Cologne/Twente workshop on graphs and combinatorial optimization (CTW 2010) : 97-100
Jäger, Gerold
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
The journal of artificial intelligence research, AAAI Press 2010, Vol. 39 : 663-687
Jäger, Gerold; Zhang, Weixiong
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
Proceedings of 5th International Computer Science Symposium in Russia (CSR 2010), Berlin-Heidelberg: Springer Berlin-Heidelberg 2010 : 216-227
Jäger, Gerold; Zhang, Weixiong
How frugal is mother nature with haplotypes?
Bioinformatics, Oxford: Oxford University Press 2009, Vol. 25, (1) : 68-74
Climer, Sharlee; Jäger, Gerold; Templeton, Alan R; et al.
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones
Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009) : 3-6
Dong, Changxing; Ernst, Christian; Jäger, Gerold; et al.
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
Proceedings of 5th International Conference on Algorithmic Aspects in Information and Management (AAIM 2009), Berlin-Heidelberg: Springer 2009 : 175-187
Dong, Changxing; Jäger, Gerold; Richter, Dirk; et al.
Complete Parsimony Haplotype Inference Problem and Algorithms
Proceedings of 17th Annual European Symposium on Algorithms (ESA 2009), Berlin-Heidelberg: Springer Berlin-Heidelberg 2009 : 337-348
Jäger, Gerold; Climer, Sharlee; Zhang, Weixiong
The number of pessimistic guesses in Generalized Mastermind
Information Processing Letters, Elsevier 2009, Vol. 109, (12) : 635-641
Jäger, Gerold; Peczarski, Marcin
Efficient parallelizations of Hermite and Smith normal form algorithms
Parallel Computing, Elsevier 2009, Vol. 35, (6) : 345-357
Jäger, Gerold; Wagner, Clemens
Tolerance-based algorithms for the traveling salesman problem
Mathematical Programming and Game Theory for Decision Making, New Jersey: World Scientific 2008 : 47-59
Ghosh, Diptesh; Goldengorin, Boris; Gutin, Gregory; et al.
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem
Algorithmic Operations Research, Preeminent Academic Facets 2008, Vol. 3, (1) : 79-81
Goldengorin, Boris; Jäger, Gerold
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
Proceedings of 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008), Berlin-Heidelberg: Springer Berlin-Heidelberg 2008 : 211-224
Jäger, Gerold; Molitor, Paul
Improving the Performance of Greedy Heuristics for TSPs Using Tolerances
Communications in Dependability and Quality Management, Germa and SOM Research Institute, University of Groningen, the Netherlands 2007, Vol. 10, (1) : 52-70
Ghosh, Diptesh; Goldengorin, Boris; Gutin, Gregory; et al.
An Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Sciences, Hikari Ltd. 2007, Vol. 1, (25) : 1203-1215
Jäger, Gerold
Solving Generalized Maximum Dispersion with Linear Programming
Proceedings of 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM 2007), Berlin-Heidelberg: Springer Berlin-Heidelberg 2007 : 1-10
Jäger, Gerold; Srivastav, Anand; Wolf, Katja
Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
Proceedings of the 4th conference on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007), Berlin-Heidelberg: Springer Berlin/Heidelberg 2007 : 99-111
Richter, Dirk; Goldengorin, Boris; Jäger, Gerold; et al.
Tolerances Applied in Combinatorial Optimization
Journal of Computer Science, Science Publications 2006, Vol. 2, (9) : 716-734
Goldengorin, Boris; Jäger, Gerold; Molitor, Paul
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
Proceedings of 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2006), Berlin-Heidelberg: Springer Berlin/Heidelberg 2006 : 86-97
Goldengorin, Boris; Jäger, Gerold; Molitor, Paul
Some Basics on Tolerances
Proceedings of 2nd International Conference on Alghorithmic Aspects in Information and Management (AAIM 2006), Berlin-Heidelberg: Springer Berlin/Heidelberg 2006 : 194-206
Goldengorin, Boris; Jäger, Gerold; Molitor, Paul
Constructions of Sparse Asymmetric Connectors with Number Theoretic Methods
Networks, John Wiley & Sons 2005, Vol. 45, (3) : 119-124
Baltz, Andreas; Jäger, Gerold; Srivastav, Anand
How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive
SOM (Systems, Organisations and Management) Research Report, 05A11
Goldengorin, Boris; Jäger, Gerold
Visa publikationer i DiVA