Gerold Jäger
According to our database^{1},
Gerold Jäger
authored at least 45 papers
between 2003 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on math.umu.se
On csauthors.net:
Bibliography
2021
Discret. Math., 2021
2020
Theor. Comput. Sci., 2020
2019
CoRR, 2019
CoRR, 2019
2018
Discret. Appl. Math., 2018
CoRR, 2018
Proceedings of the Algorithmic Game Theory  11th International Symposium, 2018
2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
The complete parsimony haplotype inference problem and algorithms based on integer programming, branchandbound and Boolean satisfiability.
J. Discrete Algorithms, 2016
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
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 whitepeg answers.
Discret. Appl. Math., 2015
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem.
Comput., 2015
Proceedings of the Combinatorial Algorithms  26th International Workshop, 2015
2014
J. Heuristics, 2014
Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics.
Discret. Appl. Math., 2014
Proceedings of the Learning and Intelligent Optimization, 2014
Playing Several Variants of Mastermind with ConstantSize Memory is not Harder than with Unbounded Memory.
Proceedings of the Combinatorial Algorithms  25th International Workshop, 2014
2013
Proceedings of the Combinatorial Algorithms  24th International Workshop, 2013
2012
Proceedings of the Combinatorial Optimization and Applications, 2012
2011
Inf. Process. Lett., 2011
2010
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem.
J. Artif. Intell. Res., 2010
Proceedings of the Computer Science, 2010
An Effective SAT Encoding for Magic Labeling.
Proceedings of the 9th CologneTwente 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
Parallel Comput., 2009
Inf. Process. Lett., 2009
Bioinform., 2009
Proceedings of the Algorithms, 2009
Proceedings of the 8th CologneTwente Workshop on Graphs and Combinatorial Optimization, 2009
Proceedings of the Algorithmic Aspects in Information and Management, 2009
2008
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 LinKernighan Heuristic for the Symmetric TSP.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007
Proceedings of the Algorithmic Aspects in Information and Management, 2007
2006
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006
Proceedings of the Algorithmic Aspects in Information and Management, 2006
2005
Networks, 2005
J. Comb. Optim., 2005
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
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
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003