Prof. Dr. Raymond Hemmecke

Recent Papers

• Integer Programming
  • R. Hemmecke, S. Onn, and L. Romanchuk. N-fold integer programming in cubic time. To appear in Mathematical Programming. e-print  arXiv:1101.3267, 2011. Winner of the 2011 Abraham Mechrez Prize for Best Student Paper (awarded to L. Romanchuk by the OR Society of Israel)
  • R. Hemmecke, S. Onn, and R. Weismantel. N-fold integer programming and nonlinear multi-transshipment. Optimization Letters 5 (2011), 13-25.
  • R. Hemmecke, M. Köppe, and R. Weismantel. A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs.In: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science 6080 (2010), 219-229.
  • Survey: R. Hemmecke, M. Köppe, J. Lee, and R. Weismantel. Nonlinear integer programming. Invited book chapter in: 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, M. Jünger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), Springer-Verlag, 2009, ISBN 3540682740.
• (Algorithmic) Discrete Mathematics
  • T. Bogart, R. Hemmecke, S. Petrović. Equality of Graver bases and universal Gröbner bases of colored partition identities. e-print  arXiv:1004.0840v2, 2010.
  • W. Bruns, R. Hemmecke, B. Ichim, M. Köppe, and Ch. Söger. Challenging computations of Hilbert bases of cones associated with algebraic statistics. Experimental Mathematics 20 (2011), 25-33.
  • R. Hemmecke, S. Kosub, E. W. Mayr, Hanjo Täubig, and J. Weihmann. Inequalities for the Number of Walks in Trees and General Graphs and a Generalization of a Theorem of Erd\H{o}s and Simonovits. Technical Report TUM-I1109, TU Munich, 2011.
• Optimization in Machine Learning
  • R. Hemmecke, S. Lindner, and M. Studený. Learning restricted Bayesian network structures. e-print  arxiv.org/abs1011.6664v1, 2010.
  • R. Bouckaert, R. Hemmecke, S. Lindner, and M. Studený. Efficient algorithms for conditional independence inference. Journal of Machine Learning Research 11 (2010), 3453-3479.
  • M. Studený, R. Hemmecke, and S. Lindner. Characteristic imset: a simple algebraic representative of a Bayesian network structure. In Proceedings of PGM 2010 (P. Myllymäki, T. Roos, T. Jaakkola eds.), HIIT Publications 2010, available online here 
  • R. Hemmecke, M. Studený and J. Vomlel. A geometric view on learning Bayesian network structures. International Journal of Approximate Reasoning 51 (2010), 573-586. 2nd prize winning paper at the ``UTIA Best 2010 Paper competition'', UTIA Prag.
• Discrete and algebraic methods in Chemistry
  • U.-U. Haus, R. Hemmecke, and S. Pokutta. Computing biochemical cluster networks. To appear in Journal of Mathematical Chemistry. e-print  arXiv:0906.1342v2, 2009.
  • U.-U. Haus and R. Hemmecke. Unraveling the initial phase of the permanganate/oxalic acid reaction. Journal of Mathematical Chemistry 48 (2010), 305-312.