Shmuel Onn

ORCID

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 39

Top Venues

Publications

Shmuel Onn
Degree Sequence Optimization and Extremal Degree Enumerators. CoRR (2024)
Daniel Deza, Shmuel Onn
Separable and equatable hypergraphs. Discret. Appl. Math. 332 (2023)
Shmuel Onn
Degree sequence optimization in bounded treewidth. Optim. Lett. 17 (5) (2023)
Shmuel Onn
Degree Sequence Optimization in Bounded Treewidth. CoRR (2023)
Shmuel Onn
On Supmodular Matrices. CoRR (2023)
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) (2023)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
High-multiplicity N-fold IP via configuration LP. Math. Program. 200 (1) (2023)
Shmuel Onn
Matching Orderable and Separable Hypergraphs. CoRR (2022)
Shmuel Onn
Matching orderable and separable hypergraphs. Optim. Lett. 16 (5) (2022)
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44 (Part) (2022)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49 (6) (2021)
Martin Koutecký, Shmuel Onn
Uniform and monotone line sum optimization. Discret. Appl. Math. 298 (2021)
Gabriel Deza, Shmuel Onn
Optimization over degree sequences of graphs. Discret. Appl. Math. 296 (2021)
Shmuel Onn
The Complexity of Vector Partition. CoRR (2021)
Martin Koutecký, Shmuel Onn
Sparse Integer Programming is FPT. Bull. EATCS 134 (2021)
Shmuel Onn
On degree sequence optimization. Oper. Res. Lett. 48 (6) (2020)
Shmuel Onn
On Degree Sequence Optimization. CoRR (2020)
Shmuel Onn
Optimization over Young Diagrams. CoRR (2020)
Shmuel Onn
On Line Sum Optimization. CoRR (2020)
Martin Koutecký, Shmuel Onn
Uniform and Monotone Line Sum Optimization. CoRR (2020)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Hypergraphic Degree Sequences are Hard. CoRR (2019)
Gabriel Deza, Shmuel Onn
Optimization over Degree Sequences of Graphs. CoRR (2019)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Multitype Integer Monoid Optimization and Applications. CoRR (2019)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Hypergraphic Degree Sequences are Hard. Bull. EATCS 127 (2019)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. 99 (2019)
Diego Cifuentes, Shmuel Onn
On the Complexity of Toric Ideals. CoRR (2019)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
An Algorithmic Theory of Integer Programming. CoRR (2019)
Martin Koutecký, Asaf Levin, Shmuel Onn
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP (2018)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Optimization over Degree Sequences. SIAM J. Discret. Math. 32 (3) (2018)
Antoine Deza, George Manoussakis, Shmuel Onn
Primitive Zonotopes. Discret. Comput. Geom. 60 (1) (2018)
Martin Koutecký, Asaf Levin, Shmuel Onn
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR (2018)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized Shifted Combinatorial Optimization. CoRR (2017)
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate Shifted Combinatorial Optimization. CoRR (2017)
Shmuel Onn
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory. J. Comput. Syst. Sci. 83 (1) (2017)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Optimization over Degree Sequences. CoRR (2017)
Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
Parameterized Shifted Combinatorial Optimization. COCOON (2017)
Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn
On nonlinear multi-covering problems. J. Comb. Optim. 33 (2) (2017)
Steffen Borgwardt, Shmuel Onn
Efficient solutions for weight-balanced partitioning problems. Discret. Optim. 21 (2016)
Asaf Levin, Shmuel Onn
Shifted matroid optimization. Oper. Res. Lett. 44 (4) (2016)
Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles
The unimodular intersection problem. Oper. Res. Lett. 43 (6) (2015)
Shmuel Onn
Unimodular Integer Caratheodory is Fixed Parameter Tractable. CoRR (2015)
Asaf Levin, Shmuel Onn
Lexicographic Matroid Optimization. CoRR (2015)
Shmuel Onn, Vladimir A. Shlyk
Some efficiently solvable problems over integer partition polytopes. Discret. Appl. Math. 180 (2015)
Shmuel Onn, Pauline Sarrabezolles
The Unimodular Intersection Problem. CoRR (2015)
Shmuel Onn, Pauline Sarrabezolles
Huge Unimodular N-Fold Programs. CoRR (2015)
Shmuel Onn, Pauline Sarrabezolles
Huge Unimodular n-Fold Programs. SIAM J. Discret. Math. 29 (4) (2015)
Susan Margulies, Shmuel Onn, Dmitrii V. Pasechnik
On the complexity of Hilbert refutations for partition. J. Symb. Comput. 66 (2015)
Shmuel Onn
Huge Multiway Table Problems. CoRR (2014)
Shmuel Onn
Huge multiway table problems. Discret. Optim. 14 (2014)
Shmuel Onn
Robust Integer Programming. CoRR (2014)
Shmuel Onn
Robust integer programming. Oper. Res. Lett. 42 (8) (2014)
Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk
n-Fold integer programming in cubic time. Math. Program. 137 (1-2) (2013)
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) (2012)
Shmuel Onn, Michal Rozenblit
Convex Integer Optimization by Constantly Many Linear Counterparts CoRR (2012)
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. 136 (2) (2012)
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126 (1) (2011)
Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk
N-fold integer programming in cubic time CoRR (2011)
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) (2011)
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
-fold integer programming and nonlinear multi-transshipment. Optim. Lett. 5 (1) (2011)
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
Accuracy Certificates for Computational Problems with Convex Structure. Math. Oper. Res. 35 (1) (2010)
Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel
Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124 (1-2) (2010)
Jon Lee, Shmuel Onn, Robert Weismantel
Intractability of approximate multi-dimensional nonlinear optimization on independence systems. CoRR (2010)
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions CoRR (2010)
Jon Lee, Shmuel Onn, Robert Weismantel
Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discret. Math. 23 (4) (2009)
Raymond Hemmecke, Shmuel Onn, Robert Weismantel
Multicommodity Flow in Polynomial Time. CoRR (2009)
Shmuel Onn
Theory and Applications of N-Fold Integer Programming. CoRR (2009)
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) (2009)
Shmuel Onn
Two graph isomorphism polytopes. Discret. Math. 309 (9) (2009)
Jon Lee, Shmuel Onn, Robert Weismantel
Nonlinear Optimization over a Weighted Independence System. AAIM (2009)
Jesús A. De Loera, Edward D. Kim, Shmuel Onn, Francisco Santos
Graphs of transportation polytopes. J. Comb. Theory, Ser. A 116 (8) (2009)
Jon Lee, Shmuel Onn, Robert Weismantel
On test sets for nonlinear integer maximization. Oper. Res. Lett. 36 (4) (2008)
Yael Berstein, Shmuel Onn
Nonlinear bipartite matching. Discret. Optim. 5 (1) (2008)
Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel
N-fold integer programming. Discret. Optim. 5 (2) (2008)
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) (2008)
Shmuel Onn
Two graph isomorphism polytopes CoRR (2008)
Jon Lee, Shmuel Onn, Robert Weismantel
Nonlinear Optimization over a Weighted Independence System CoRR (2008)
Shmuel Onn, Uriel G. Rothblum
The use of edge-directions and linear programming to enumerate vertices. J. Comb. Optim. 14 (2-3) (2007)
Yael Berstein, Shmuel Onn
The Graver Complexity of Integer Programming. CoRR (2007)
Shmuel Onn
Convex Discrete Optimization. CoRR (2007)
Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn
Nonlinear Matroid Optimization and Experimental Design. CoRR (2007)
Nir Halman, Shmuel Onn, Uriel G. Rothblum
The convex dimension of a graph. Discret. Appl. Math. 155 (11) (2007)
Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel
N-Fold Integer Programming. CoRR (2006)
Jesús A. De Loera, Shmuel Onn
All Linear and Integer Programs Are Slim 3-Way Transportation Programs. SIAM J. Optim. 17 (3) (2006)
Jesús A. De Loera, Shmuel Onn
Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comput. 41 (2) (2006)
Shmuel Onn
Entry Uniqueness in Margined Tables. Privacy in Statistical Databases (2006)
Yael Berstein, Shmuel Onn
Nonlinear Bipartite Matching. CoRR (2006)
Shmuel Onn, Uriel G. Rothblum, Yoav Tangir
Edge-Directions of Standard Polyhedra with Applications to Network Flows. J. Glob. Optim. 33 (1) (2005)
Jesús A. De Loera, Shmuel Onn
All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. IPCO (2004)
Shmuel Onn, Rom Pinchasi
A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory, Ser. A 107 (1) (2004)
Jesús A. De Loera, Shmuel Onn
The Complexity of Three-Way Statistical Tables. SIAM J. Comput. 33 (4) (2004)
Shmuel Onn, Uriel G. Rothblum
Convex Combinatorial Optimization. Discret. Comput. Geom. 32 (4) (2004)
Shmuel Onn
Nowhere-zero flow polynomials. J. Comb. Theory, Ser. A 108 (2) (2004)
Shmuel Onn, Uriel G. Rothblum
Convex Combinatorial Optimization CoRR (2003)
Shmuel Onn
Nowhere-Zero Flow Polynomials CoRR (2003)
Komei Fukuda, Shmuel Onn, Vera Rosta
An Adaptive Algorithm for Vector Partitioning. J. Glob. Optim. 25 (3) (2003)
Shmuel Onn, Elisheva Sperber
Social network coordination and graph routing. Networks 41 (1) (2003)
Yossi Gil, Zvi Gutterman, Shmuel Onn, Irad Yavneh
Automated Transformations for PDE Systems with Application to Multigrid Solvers. SIAM J. Sci. Comput. 24 (3) (2003)
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) (2003)
Shmuel Onn
Convex Matroid Optimization. SIAM J. Discret. Math. 17 (2) (2003)
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) (2002)

Shmuel Onn.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Shmuel Onn