default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShmuel Onn
Person information
SPARQL queries 
🛈 Please note that only 67% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Shmuel Onn
:
Circuit and Graver walks and linear and integer programming. Discret. Optim. 54: 100862 (2024)- [j73]Antoine Deza, Shmuel Onn, Sebastian Pokutta, Lionel Pournin:
Kissing Polytopes. SIAM J. Discret. Math. 38(4): 2643-2664 (2024) - [i40]Shmuel Onn:
Degree Sequence Optimization and Extremal Degree Enumerators. CoRR abs/2404.02551 (2024) - [i39]Shmuel Onn:
Circuit and Graver Walks and Linear and Integer Programming. CoRR abs/2410.00656 (2024) - 2023
- [j72]Daniel Deza, Shmuel Onn:
Separable and equatable hypergraphs. Discret. Appl. Math. 332: 170-179 (2023) - [j71]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - [j70]Shmuel Onn:
Degree sequence optimization in bounded treewidth. Optim. Lett. 17(5): 1127-1132 (2023) - [j69]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6): 595-598 (2023) - [i38]Shmuel Onn:
Degree Sequence Optimization in Bounded Treewidth. CoRR abs/2303.12560 (2023) - [i37]Shmuel Onn:
On Supmodular Matrices. CoRR abs/2309.07700 (2023) - 2022
- [j68]Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44(Part): 100629 (2022) - [j67]Shmuel Onn:
Matching orderable and separable hypergraphs. Optim. Lett. 16(5): 1393-1401 (2022) - [i36]Shmuel Onn:
Matching Orderable and Separable Hypergraphs. CoRR abs/2202.00902 (2022) - 2021
- [j66]Gabriel Deza, Shmuel Onn:
Optimization over degree sequences of graphs. Discret. Appl. Math. 296: 2-8 (2021) - [j65]Martin Koutecký, Shmuel Onn:
Uniform and monotone line sum optimization. Discret. Appl. Math. 298: 165-170 (2021) - [j64]Martin Koutecký, Shmuel Onn:
Sparse Integer Programming is FPT. Bull. EATCS 134 (2021) - [j63]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49(6): 908-913 (2021) - [i35]Shmuel Onn:
The Complexity of Vector Partition. CoRR abs/2109.06569 (2021) - 2020
- [j62]Shmuel Onn:
On degree sequence optimization. Oper. Res. Lett. 48(6): 840-843 (2020) - [i34]Shmuel Onn:
On Degree Sequence Optimization. CoRR abs/2003.05141 (2020) - [i33]Shmuel Onn:
Optimization over Young Diagrams. CoRR abs/2009.05953 (2020) - [i32]Martin Koutecký, Shmuel Onn:
Uniform and Monotone Line Sum Optimization. CoRR abs/2011.09932 (2020) - [i31]Shmuel Onn:
On Line Sum Optimization. CoRR abs/2012.02617 (2020)
2010 – 2019
- 2019
- [j61]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. Bull. EATCS 127 (2019) - [j60]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99: 53-71 (2019) - [i30]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. CoRR abs/1901.02272 (2019) - [i29]Diego Cifuentes, Shmuel Onn:
On the Complexity of Toric Ideals. CoRR abs/1902.01484 (2019) - [i28]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
An Algorithmic Theory of Integer Programming. CoRR abs/1904.01361 (2019) - [i27]Gabriel Deza, Shmuel Onn:
Optimization over Degree Sequences of Graphs. CoRR abs/1908.09278 (2019) - [i26]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Multitype Integer Monoid Optimization and Applications. CoRR abs/1909.07326 (2019) - 2018
- [j59]Antoine Deza, George Manoussakis, Shmuel Onn:
Primitive Zonotopes. Discret. Comput. Geom. 60(1): 27-39 (2018) - [j58]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. SIAM J. Discret. Math. 32(3): 2067-2079 (2018) - [c8]Martin Koutecký, Asaf Levin, Shmuel Onn:
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP 2018: 85:1-85:14 - [i25]Martin Koutecký, Asaf Levin, Shmuel Onn:
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR abs/1802.05859 (2018) - 2017
- [j57]Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn:
On nonlinear multi-covering problems. J. Comb. Optim. 33(2): 645-659 (2017) - [j56]Shmuel Onn:
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory. J. Comput. Syst. Sci. 83(1): 207-214 (2017) - [c7]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. COCOON 2017: 224-236 - [i24]Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn:
Parameterized Shifted Combinatorial Optimization. CoRR abs/1702.06844 (2017) - [i23]Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate Shifted Combinatorial Optimization. CoRR abs/1706.02075 (2017) - [i22]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. CoRR abs/1706.03951 (2017) - 2016
- [j55]Steffen Borgwardt, Shmuel Onn:
Efficient solutions for weight-balanced partitioning problems. Discret. Optim. 21: 71-84 (2016) - [j54]Asaf Levin, Shmuel Onn:
Shifted matroid optimization. Oper. Res. Lett. 44(4): 535-539 (2016) - 2015
- [j53]Shmuel Onn, Vladimir A. Shlyk:
Some efficiently solvable problems over integer partition polytopes. Discret. Appl. Math. 180: 135-140 (2015) - [j52]Susan Margulies, Shmuel Onn, Dmitrii V. Pasechnik:
On the complexity of Hilbert refutations for partition. J. Symb. Comput. 66: 70-83 (2015) - [j51]Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles:
The unimodular intersection problem. Oper. Res. Lett. 43(6): 592-594 (2015) - [j50]Shmuel Onn, Pauline Sarrabezolles:
Huge Unimodular n-Fold Programs. SIAM J. Discret. Math. 29(4): 2277-2283 (2015) - [i21]Shmuel Onn, Pauline Sarrabezolles:
Huge Unimodular N-Fold Programs. CoRR abs/1501.00665 (2015) - [i20]Shmuel Onn, Pauline Sarrabezolles:
The Unimodular Intersection Problem. CoRR abs/1502.04301 (2015) - [i19]Asaf Levin, Shmuel Onn:
Lexicographic Matroid Optimization. CoRR abs/1507.00447 (2015) - [i18]Shmuel Onn:
Unimodular Integer Caratheodory is Fixed Parameter Tractable. CoRR abs/1511.03403 (2015) - 2014
- [j49]Shmuel Onn:
Huge multiway table problems. Discret. Optim. 14: 72-77 (2014) - [j48]Shmuel Onn:
Robust integer programming. Oper. Res. Lett. 42(8): 558-560 (2014) - [i17]Shmuel Onn:
Robust Integer Programming. CoRR abs/1402.2852 (2014) - [i16]Shmuel Onn:
Huge Multiway Table Problems. CoRR abs/1405.1189 (2014) - 2013
- [j47]Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk:
n-Fold integer programming in cubic time. Math. Program. 137(1-2): 325-341 (2013) - 2012
- [j46]Michel Baes, Alberto Del Pia, Yurii E. Nesterov, Shmuel Onn, Robert Weismantel:
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. Math. Program. 134(1): 305-322 (2012) - [j45]Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel:
The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. 136(2): 301-323 (2012) - [i15]Shmuel Onn, Michal Rozenblit:
Convex Integer Optimization by Constantly Many Linear Counterparts. CoRR abs/1208.5639 (2012) - 2011
- [j44]Shmuel Onn, Ishay Weissman:
Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes. Ann. Oper. Res. 189(1): 331-342 (2011) - [j43]Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126(1): 97-117 (2011) - [j42]Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
N-fold integer programming and nonlinear multi-transshipment. Optim. Lett. 5(1): 13-25 (2011) - [p1]Shmuel Onn:
Convex Discrete Optimization. Combinatorial Optimization - Methods and Applications 2011: 183-228 - [i14]Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk:
N-fold integer programming in cubic time. CoRR abs/1101.3267 (2011) - 2010
- [j41]Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum:
Accuracy Certificates for Computational Problems with Convex Structure. Math. Oper. Res. 35(1): 52-78 (2010) - [j40]Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel:
Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124(1-2): 233-253 (2010) - [i13]Jon Lee, Shmuel Onn, Robert Weismantel:
Intractability of approximate multi-dimensional nonlinear optimization on independence systems. CoRR abs/1001.5056 (2010) - [i12]Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel:
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions. CoRR abs/1006.0773 (2010)
2000 – 2009
- 2009
- [j39]Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn:
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Comb. Probab. Comput. 18(4): 551-582 (2009) - [j38]Shmuel Onn:
Two graph isomorphism polytopes. Discret. Math. 309(9): 2934-2936 (2009) - [j37]Jesús A. De Loera, Edward D. Kim, Shmuel Onn, Francisco Santos:
Graphs of transportation polytopes. J. Comb. Theory A 116(8): 1306-1325 (2009) - [j36]Jon Lee, Shmuel Onn, Robert Weismantel:
Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discret. Math. 23(4): 1667-1681 (2009) - [c6]Jon Lee, Shmuel Onn, Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System. AAIM 2009: 251-264 - [r1]Shmuel Onn:
Convex Discrete Optimization. Encyclopedia of Optimization 2009: 513-550 - [i11]Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
Multicommodity Flow in Polynomial Time. CoRR abs/0906.5106 (2009) - [i10]Shmuel Onn:
Theory and Applications of N-Fold Integer Programming. CoRR abs/0911.4191 (2009) - 2008
- [j35]Yael Berstein, Shmuel Onn:
Nonlinear bipartite matching. Discret. Optim. 5(1): 53-65 (2008) - [j34]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
N-fold integer programming. Discret. Optim. 5(2): 231-241 (2008) - [j33]Jon Lee, Shmuel Onn, Robert Weismantel:
On test sets for nonlinear integer maximization. Oper. Res. Lett. 36(4): 439-443 (2008) - [j32]Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn:
Nonlinear Matroid Optimization and Experimental Design. SIAM J. Discret. Math. 22(3): 901-919 (2008) - [i9]Shmuel Onn:
Two graph isomorphism polytopes. CoRR abs/0801.1410 (2008) - [i8]Jon Lee, Shmuel Onn, Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System. CoRR abs/0805.0954 (2008) - 2007
- [j31]Nir Halman, Shmuel Onn, Uriel G. Rothblum:
The convex dimension of a graph. Discret. Appl. Math. 155(11): 1373-1383 (2007) - [j30]Shmuel Onn, Uriel G. Rothblum:
The use of edge-directions and linear programming to enumerate vertices. J. Comb. Optim. 14(2-3): 153-164 (2007) - [i7]Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn:
Nonlinear Matroid Optimization and Experimental Design. CoRR abs/0707.4618 (2007) - [i6]Yael Berstein, Shmuel Onn:
The Graver Complexity of Integer Programming. CoRR abs/0709.1500 (2007) - [i5]Shmuel Onn:
Convex Discrete Optimization. CoRR abs/math/0703575 (2007) - 2006
- [j29]Jesús A. De Loera, Shmuel Onn:
Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comput. 41(2): 173-181 (2006) - [j28]Jesús A. De Loera, Shmuel Onn:
All Linear and Integer Programs Are Slim 3-Way Transportation Programs. SIAM J. Optim. 17(3): 806-821 (2006) - [c5]Shmuel Onn:
Entry Uniqueness in Margined Tables. Privacy in Statistical Databases 2006: 94-101 - [i4]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
N-Fold Integer Programming. CoRR abs/math/0605242 (2006) - [i3]Yael Berstein, Shmuel Onn:
Nonlinear Bipartite Matching. CoRR abs/math/0605610 (2006) - 2005
- [j27]Shmuel Onn, Uriel G. Rothblum, Yoav Tangir:
Edge-Directions of Standard Polyhedra with Applications to Network Flows. J. Glob. Optim. 33(1): 109-122 (2005) - 2004
- [j26]Shmuel Onn, Uriel G. Rothblum:
Convex Combinatorial Optimization. Discret. Comput. Geom. 32(4): 549-566 (2004) - [j25]Shmuel Onn, Rom Pinchasi:
A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory A 107(1): 147-151 (2004) - [j24]Shmuel Onn:
Nowhere-zero flow polynomials. J. Comb. Theory A 108(2): 205-215 (2004) - [j23]Jesús A. De Loera, Shmuel Onn:
The Complexity of Three-Way Statistical Tables. SIAM J. Comput. 33(4): 819-836 (2004) - [c4]Jesús A. De Loera, Shmuel Onn:
All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. IPCO 2004: 338-351 - 2003
- [j22]Eric Babson, Shmuel Onn, Rekha R. Thomas:
The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. Adv. Appl. Math. 30(3): 529-544 (2003) - [j21]Komei Fukuda, Shmuel Onn, Vera Rosta:
An Adaptive Algorithm for Vector Partitioning. J. Glob. Optim. 25(3): 305-319 (2003) - [j20]Shmuel Onn, Elisheva Sperber:
Social network coordination and graph routing. Networks 41(1): 44-50 (2003) - [j19]Shmuel Onn:
Convex Matroid Optimization. SIAM J. Discret. Math. 17(2): 249-253 (2003) - [j18]Yossi Gil, Zvi Gutterman, Shmuel Onn, Irad Yavneh:
Automated Transformations for PDE Systems with Application to Multigrid Solvers. SIAM J. Sci. Comput. 24(3): 886-904 (2003) - [i2]Shmuel Onn, Uriel G. Rothblum:
Convex Combinatorial Optimization. CoRR math.CO/0309083 (2003) - [i1]Shmuel Onn:
Nowhere-Zero Flow Polynomials. CoRR math.CO/0309347 (2003) - 2002
- [j17]Sharon Aviran, Nissan Lev-Tov, Shmuel Onn, Uriel G. Rothblum:
Vertex characterization of partition polytopes of bipartitions and of planar point sets. Discret. Appl. Math. 124(1-3): 1-15 (2002) - [j16]Sharon Aviran, Shmuel Onn:
Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences. Discret. Comput. Geom. 27(3): 409-417 (2002) - [j15]Antoine Deza, Shmuel Onn:
Solitaire Lattices. Graphs Comb. 18(2): 227-243 (2002) - 2001
- [j14]Shmuel Onn, Leonard J. Schulman:
The Vector Partition Problem for Convex Objective Functions. Math. Oper. Res. 26(3): 583-590 (2001) - 2000
- [j13]Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum:
Linear-shaped partition problems. Oper. Res. Lett. 26(4): 159-163 (2000)
1990 – 1999
- 1999
- [j12]Noga Alon, Shmuel Onn:
Separable Partitions. Discret. Appl. Math. 91(1-3): 39-51 (1999) - [j11]Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum:
A Polynomial Time Algorithm for Shaped Partition Problems. SIAM J. Optim. 10(1): 70-81 (1999) - 1997
- [j10]Shmuel Onn, Moshe Tennenholtz:
Determination of Social Laws for Multi-Agent Mobilization. Artif. Intell. 95(1): 155-167 (1997) - [j9]Shmuel Onn:
Strongly Signable and Partitionable Posets. Eur. J. Comb. 18(8): 921-938 (1997) - [j8]Shmuel Onn, Robert Weismantel, Peter Brucker:
Book reviews. Math. Methods Oper. Res. 46(2): 281-284 (1997) - [j7]Imre Bárány, Shmuel Onn:
Colourful Linear Programming and its Relatives. Math. Oper. Res. 22(3): 550-567 (1997) - 1996
- [j6]Peter Kleinschmidt, Shmuel Onn:
Signable Posets and Partitionable Simplicial Complexes. Discret. Comput. Geom. 15(4): 443-466 (1996) - [c3]Imre Bárány, Shmuel Onn:
Colourful Linear Programming. IPCO 1996: 1-15 - 1995
- [j5]Michel Deza, Shmuel Onn:
Lattice-Free Polytopes and Their Diameter. Discret. Comput. Geom. 13: 59-75 (1995) - [c2]Peter Kleinschmidt, Shmuel Onn:
Oriented Matroid Polytopes and Polyhedral Fans are Signable. IPCO 1995: 198-211 - 1994
- [j4]Shmuel Onn:
Approximating Oracle Machines for Combinatorial Optimization. SIAM J. Optim. 4(1): 142-145 (1994) - 1993
- [j3]Shmuel Onn:
Geometry, Complexity, and Combinatorics of Permutation Polytopes. J. Comb. Theory A 64(1): 31-49 (1993) - 1992
- [j2]Peter Kleinschmidt, Shmuel Onn:
On the diameter of convex polytopes. Discret. Math. 102(1): 75-77 (1992) - 1991
- [j1]Shmuel Onn:
On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice. SIAM J. Discret. Math. 4(3): 436-447 (1991) - 1990
- [c1]Shmuel Onn:
On the Radon Number of the Integer Lattice. IPCO 1990: 385-396
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
