Raymond Hemmecke

Dr. rer. nat. habil.

20032016

Research activity per year

Filter
Conference contribution

Search results

  • 2012

    Inequalities for the number of walks in graphs

    Hemmecke, R., Kosub, S., Mayr, E. W., Täubig, H. & Weihmann, J., 2012, 9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012. Society for Industrial and Applied Mathematics Publications, p. 26-39 14 p. (9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    2 Scopus citations
  • 2010

    A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs

    Hemmecke, R., Köppe, M. & Weismantel, R., 2010, Integer Programming and Combinatorial Optimization - 14th International Conference, IPCO 2010, Proceedings. p. 219-229 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6080 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    14 Scopus citations
  • Characteristic imset: A simple algebraic representative of a Bayesian network structure

    Studený, M., Hemmecke, R. & Lindner, S., 2010, Proceedings of the 5th European Workshop on Probabilistic Graphical Models, PGM 2010. p. 257-264 8 p. (Proceedings of the 5th European Workshop on Probabilistic Graphical Models, PGM 2010).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    14 Scopus citations