On the positive sum property and the computation of Graver test sets. - Raymond Hemmecke (Math. Program., 2003)

Decomposition of test sets in stochastic integer programming. - Raymond Hemmecke; Rüdiger Schultz (Math. Program., 2003)

Three Kinds of Integer Programming Algorithms Based on Barvinok's Rational Functions. - Jesús A. De Loera; David Haws; Raymond Hemmecke; Peter Huggins; Ruriko Yoshida (IPCO, 2004)

Short rational functions for toric algebra and applications. - Jesús A. De Loera; David Haws; Raymond Hemmecke; Peter Huggins; Bernd Sturmfels; Ruriko Yoshida (J. Symb. Comput., 2004)

Effective lattice point counting in rational convex polytopes. - Jesús A. De Loera; Raymond Hemmecke; Jeremiah Tauzer; Ruriko Yoshida (J. Symb. Comput., 2004)

A computational study of integer programming algorithms based on Barvinok's rational functions. - Jesús A. De Loera; David Haws; Raymond Hemmecke; Peter Huggins; Ruriko Yoshida (Discret. Optim., 2005)

FPTAS for mixed-integer polynomial optimization with a fixed number of variables. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (SODA, 2006)

Integer Polynomial Optimization in Fixed Dimension. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Oper. Res., 2006)

Finiteness Theorems in Stochastic Integer Programming. - Matthias Aschenbrenner; Raymond Hemmecke (Found. Comput. Math., 2007)

Representation of Sets of Lattice Points. - Raymond Hemmecke; Robert Weismantel (SIAM J. Optim., 2007)

Three Counter-Examples on Semi-Graphoids. - Raymond Hemmecke; Jason Morton; Anne Shiu; Bernd Sturmfels; Oliver Wienand (Comb. Probab. Comput., 2008)

N-fold integer programming. - Jesús A. De Loera; Raymond Hemmecke; Shmuel Onn; Robert Weismantel (Discret. Optim., 2008)

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Program., 2008)

Computing holes in semi-groups and its applications to transportation problems. - Raymond Hemmecke; Akimichi Takemura; Ruriko Yoshida (Contributions Discret. Math., 2009)

Multicommodity Flow in Polynomial Time. - Raymond Hemmecke; Shmuel Onn; Robert Weismantel (CoRR, 2009)

Pareto Optima of Multicriteria Integer Linear Programs. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe (INFORMS J. Comput., 2009)

Computing generating sets of lattice ideals and Markov bases of lattices. - Raymond Hemmecke; Peter N. Malkin (J. Symb. Comput., 2009)

Nonlinear Integer Programming. - Raymond Hemmecke; Matthias Köppe; Jon Lee 001; Robert Weismantel (50 Years of Integer Programming, 2010)

A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs. - Raymond Hemmecke; Matthias Köppe; Robert Weismantel (IPCO, 2010)

Learning restricted Bayesian network structures - Raymond Hemmecke; Silvia Lindner; Milan Studený (CoRR, 2010)

A geometric view on learning Bayesian network structures. - Milan Studený; Jirí Vomlel; Raymond Hemmecke (Int. J. Approx. Reason., 2010)

Efficient Algorithms for Conditional Independence Inference. - Remco R. Bouckaert; Raymond Hemmecke; Silvia Lindner; Milan Studený (J. Mach. Learn. Res., 2010)

Computation of atomic fibers of Z-linear maps. - Elke Eisenschmidt; Raymond Hemmecke; Matthias Köppe (Contributions Discret. Math., 2011)

Challenging Computations of Hilbert Bases of Cones Associated with Algebraic Statistics. - Winfried Bruns; Raymond Hemmecke; Bogdan Ichim; Matthias Köppe; Christof Söger (Exp. Math., 2011)

A polynomial oracle-time algorithm for convex integer minimization. - Raymond Hemmecke; Shmuel Onn; Robert Weismantel (Math. Program., 2011)

N-fold integer programming and nonlinear multi-transshipment. - Raymond Hemmecke; Shmuel Onn; Robert Weismantel (Optim. Lett., 2011)

Universal Gröbner Bases of Colored Partition Identities. - Tristram Bogart; Ray Hemmecke; Sonja Petrovic (Exp. Math., 2012)

Characteristic imsets for learning Bayesian network structure. - Raymond Hemmecke; Silvia Lindner; Milan Studený (Int. J. Approx. Reason., 2012)

Algebraic and Geometric Ideas in the Theory of Discrete Optimization. - Jesús A. De Loera; Raymond Hemmecke; Matthias Köppe (SIAM, 2013)

Inequalities for the Number of Walks in Graphs. - Hanjo Täubig; Jeremias Weihmann; Sven Kosub; Raymond Hemmecke; Ernst W. Mayr (Algorithmica, 2013)

n-Fold integer programming in cubic time. - Raymond Hemmecke; Shmuel Onn; Lyubov Romanchuk (Math. Program., 2013)

Graver basis and proximity techniques for block-structured separable convex integer minimization problems. - Raymond Hemmecke; Matthias Köppe; Robert Weismantel (Math. Program., 2014)

On the Circuit Diameter of Dual Transportation Polyhedra. - Steffen Borgwardt; Elisabeth Finhold; Raymond Hemmecke (SIAM J. Discret. Math., 2015)

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond. - Jesús A. De Loera; Raymond Hemmecke; Jon Lee 001 (SIAM J. Optim., 2015)

Quadratic diameter bounds for dual network flow polyhedra. - Steffen Borgwardt; Elisabeth Finhold; Raymond Hemmecke (Math. Program., 2016)