| Effective lattice point counting in rational convex polytopes JA De Loera, R Hemmecke, J Tauzer, R Yoshida Journal of symbolic computation 38 (4), 1273-1302, 2004 | 279 | 2004 |
| Nonlinear integer programming R Hemmecke, M Köppe, J Lee, R Weismantel 50 Years of Integer Programming 1958-2008, 561-618, 2010 | 210 | 2010 |
| Algebraic and geometric ideas in the theory of discrete optimization JA De Loera, R Hemmecke, M Köppe Society for Industrial and Applied Mathematics, 2012 | 130 | 2012 |
| Algebraic and geometric ideas in the theory of discrete optimization JA De Loera, R Hemmecke, M Köppe Society for Industrial and Applied Mathematics, 2012 | 130 | 2012 |
| N-fold integer programming JA De Loera, R Hemmecke, S Onn, R Weismantel Discrete Optimization 5 (2), 231-241, 2008 | 80 | 2008 |
| A polynomial oracle-time algorithm for convex integer minimization R Hemmecke, S Onn, R Weismantel Mathematical Programming 126 (1), 97-117, 2011 | 70 | 2011 |
| N-fold integer programming in cubic time R Hemmecke, S Onn, L Romanchuk Mathematical Programming 137 (1), 325-341, 2013 | 65 | 2013 |
| Integer polynomial optimization in fixed dimension JA De Loera, R Hemmecke, M Köppe, R Weismantel Mathematics of Operations Research 31 (1), 147-153, 2006 | 64 | 2006 |
| Decomposition of test sets in stochastic integer programming R Hemmecke, R Schultz Mathematical Programming 94 (2), 323-341, 2003 | 63 | 2003 |
| A decomposition algorithm applied to planning the interdiction of stochastic networks H Held, R Hemmecke, DL Woodruff Naval Research Logistics (NRL) 52 (4), 321-328, 2005 | 62 | 2005 |
| On the computation of Hilbert bases of cones R Hemmecke Mathematical software, 307-317, 2002 | 58 | 2002 |
| 4ti2 version 1.2—computation of Hilbert bases, Graver bases, toric Gröbner bases, and more R Hemmecke, R Hemmecke, P Malkin Manuscript available at http://www. 4ti2. de, 2005 | 55 | 2005 |
| Short rational functions for toric algebra and applications JA De Loera, D Haws, R Hemmecke, P Huggins, B Sturmfels, R Yoshida Journal of Symbolic Computation 38 (2), 959-973, 2004 | 55 | 2004 |
| Interdicting stochastic networks with binary interdiction effort R Hemmecke, R Schultz, DL Woodruff Network interdiction and stochastic integer programming, 69-84, 2003 | 55 | 2003 |
| Characteristic imsets for learning Bayesian network structure R Hemmecke, S Lindner, M Studený International Journal of Approximate Reasoning 53 (9), 1336-1349, 2012 | 51 | 2012 |
| Computing generating sets of lattice ideals and Markov bases of lattices R Hemmecke, PN Malkin Journal of Symbolic Computation 44 (10), 1463-1476, 2009 | 48 | 2009 |
| Decomposition methods for two-stage stochastic integer programs R Hemmecke, R Schultz Online optimization of large scale systems, 601-622, 2001 | 44 | 2001 |
| A geometric view on learning Bayesian network structures M Studený, J Vomlel, R Hemmecke International Journal of Approximate Reasoning 51 (5), 573-586, 2010 | 39 | 2010 |
| Challenging computations of Hilbert bases of cones associated with algebraic statistics W Bruns, R Hemmecke, B Ichim, M Köppe, C Söger Experimental Mathematics 20 (1), 25-33, 2011 | 38 | 2011 |
| Pareto optima of multicriteria integer linear programs JA De Loera, R Hemmecke, M Köppe INFORMS Journal on Computing 21 (1), 39-48, 2009 | 38 | 2009 |
Matthias KoeppeProfessor of Mathematics, UC DavisE-mail confirmado em math.ucdavis.edu
