PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Jäger, Gerold"

Author of the publication

copydeleteadd this publication to your clipboard
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem.

, , , , , and . Computation, 3 (2): 285-298 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Jäger University of Stuttgart

Jonas Gerold University of Stuttgart

Dr. -Ing. Gerold Hafner University of Stuttgart

 

Other publications of authors with the same name

Improved Approximation Algorithms for Maximum Graph Partitioning Problems., and . J. Comb. Optim., 10 (2): 133-167 (2005)Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection., , , , and . JORS, 66 (4): 615-626 (2015)SAT and IP based algorithms for magic labeling including a complete search for total magic labelings., and . J. Discrete Algorithms, (2015)A New Algorithm for Computing the Smith Normal Form and Its Implementation on Parallel Machines.. IPDPS, IEEE Computer Society, (2004)A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem., and . CSR, volume 6072 of Lecture Notes in Computer Science, page 216-227. Springer, (2010)An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs.. COCOA, volume 10043 of Lecture Notes in Computer Science, page 670-682. Springer, (2016)The b-Matching Problem in Hypergraphs: Hardness and Approximability., and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 200-211. Springer, (2012)Solving Generalized Maximum Dispersion with Linear Programming., , and . AAIM, volume 4508 of Lecture Notes in Computer Science, page 1-10. Springer, (2007)Efficient parallelizations of Hermite and Smith normal form algorithms., and . Parallel Computing, 35 (6): 345-357 (2009)Bounding memory for Mastermind might not make it harder., and . Theor. Comput. Sci., (2015)