Shmuel Onn

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Lyubov Romanchuk

> Home > Persons > Shmuel Onn

Publications

2013
[j47]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/HemmeckeOR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/HemmeckeOR13
Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk:
n-Fold integer programming in cubic time. Math. Program. 137(1-2): 325-341 (2013)
2012
[j45]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/LeeORW12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/LeeORW12
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel:
The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. 136(2): 301-323 (2012)
2011
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1101-3267
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1101-3267
Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk:
N-fold integer programming in cubic time. CoRR abs/1101.3267 (2011)
2010
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1006-0773
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1006-0773
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel:
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions. CoRR abs/1006.0773 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.