Shmuel Onn - RankMe

125 papers A* 1B 4C 2Misc 1Journal 115

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Degree sequence optimization and extremal degree enumerators. Discret. Appl. Math. Shmuel Onn
2025	J	`jnl`	Sparse Integer Programming Is Fixed-Parameter Tractable. Math. Oper. Res. Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
2024	J	`jnl`	Circuit and Graver Walks and Linear and Integer Programming. CoRR Shmuel Onn
2024	J	`jnl`	Circuit and Graver walks and linear and integer programming. Discret. Optim. Shmuel Onn
2024	J	`jnl`	Degree Sequence Optimization and Extremal Degree Enumerators. CoRR Shmuel Onn
2024	J	`jnl`	Kissing Polytopes. SIAM J. Discret. Math. Antoine Deza, Shmuel Onn, Sebastian Pokutta, Lionel Pournin
2023	J	`jnl`	Degree Sequence Optimization in Bounded Treewidth. CoRR Shmuel Onn
2023	J	`jnl`	Degree sequence optimization in bounded treewidth. Optim. Lett. Shmuel Onn
2023	J	`jnl`	High-multiplicity N-fold IP via configuration LP. Math. Program. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2023	J	`jnl`	On Supmodular Matrices. CoRR Shmuel Onn
2023	J	`jnl`	Reducibility bounds of objective functions over the integers. Oper. Res. Lett. Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
2023	J	`jnl`	Separable and equatable hypergraphs. Discret. Appl. Math. Daniel Deza, Shmuel Onn
2022	J	`jnl`	Approximate separable multichoice optimization over monotone systems. Discret. Optim. Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2022	J	`jnl`	Matching Orderable and Separable Hypergraphs. CoRR Shmuel Onn
2022	J	`jnl`	Matching orderable and separable hypergraphs. Optim. Lett. Shmuel Onn
2021	J	`jnl`	Optimization over degree sequences of graphs. Discret. Appl. Math. Gabriel Deza, Shmuel Onn
2021	J	`jnl`	Parameterized complexity of configuration integer programs. Oper. Res. Lett. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2021	J	`jnl`	Sparse Integer Programming is FPT. Bull. EATCS Martin Koutecký, Shmuel Onn
2021	J	`jnl`	The Complexity of Vector Partition. CoRR Shmuel Onn
2021	J	`jnl`	Uniform and monotone line sum optimization. Discret. Appl. Math. Martin Koutecký, Shmuel Onn
2020	J	`jnl`	On Degree Sequence Optimization. CoRR Shmuel Onn
2020	J	`jnl`	On Line Sum Optimization. CoRR Shmuel Onn
2020	J	`jnl`	On degree sequence optimization. Oper. Res. Lett. Shmuel Onn
2020	J	`jnl`	Optimization over Young Diagrams. CoRR Shmuel Onn
2020	J	`jnl`	Uniform and Monotone Line Sum Optimization. CoRR Martin Koutecký, Shmuel Onn
2019	J	`jnl`	An Algorithmic Theory of Integer Programming. CoRR Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
2019	J	`jnl`	Hypergraphic Degree Sequences are Hard. CoRR Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2019	J	`jnl`	Hypergraphic Degree Sequences are Hard. Bull. EATCS Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2019	J	`jnl`	Multitype Integer Monoid Optimization and Applications. CoRR Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2019	J	`jnl`	On the Complexity of Toric Ideals. CoRR Diego Cifuentes, Shmuel Onn
2019	J	`jnl`	Optimization over Degree Sequences of Graphs. CoRR Gabriel Deza, Shmuel Onn
2019	J	`jnl`	Parameterized shifted combinatorial optimization. J. Comput. Syst. Sci. Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2018	A*	`conf`	A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP Martin Koutecký, Asaf Levin, Shmuel Onn
2018	J	`jnl`	A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR Martin Koutecký, Asaf Levin, Shmuel Onn
2018	J	`jnl`	Optimization over Degree Sequences. SIAM J. Discret. Math. Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2018	J	`jnl`	Primitive Zonotopes. Discret. Comput. Geom. Antoine Deza, George Manoussakis, Shmuel Onn
2017	J	`jnl`	Approximate Shifted Combinatorial Optimization. CoRR Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2017	J	`jnl`	Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory. J. Comput. Syst. Sci. Shmuel Onn
2017	J	`jnl`	On nonlinear multi-covering problems. J. Comb. Optim. Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn
2017	J	`jnl`	Optimization over Degree Sequences. CoRR Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2017	Misc	`conf`	Parameterized Shifted Combinatorial Optimization. COCOON Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2017	J	`jnl`	Parameterized Shifted Combinatorial Optimization. CoRR Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn
2016	J	`jnl`	Efficient solutions for weight-balanced partitioning problems. Discret. Optim. Steffen Borgwardt, Shmuel Onn
2016	J	`jnl`	Shifted matroid optimization. Oper. Res. Lett. Asaf Levin, Shmuel Onn
2015	J	`jnl`	Huge Unimodular N-Fold Programs. CoRR Shmuel Onn, Pauline Sarrabezolles
2015	J	`jnl`	Huge Unimodular n-Fold Programs. SIAM J. Discret. Math. Shmuel Onn, Pauline Sarrabezolles
2015	J	`jnl`	Lexicographic Matroid Optimization. CoRR Asaf Levin, Shmuel Onn
2015	J	`jnl`	On the complexity of Hilbert refutations for partition. J. Symb. Comput. Susan Margulies, Shmuel Onn, Dmitrii V. Pasechnik
2015	J	`jnl`	Some efficiently solvable problems over integer partition polytopes. Discret. Appl. Math. Shmuel Onn, Vladimir A. Shlyk
2015	J	`jnl`	The Unimodular Intersection Problem. CoRR Shmuel Onn, Pauline Sarrabezolles
2015	J	`jnl`	The unimodular intersection problem. Oper. Res. Lett. Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles
2015	J	`jnl`	Unimodular Integer Caratheodory is Fixed Parameter Tractable. CoRR Shmuel Onn
2014	J	`jnl`	Huge Multiway Table Problems. CoRR Shmuel Onn
2014	J	`jnl`	Huge multiway table problems. Discret. Optim. Shmuel Onn
2014	J	`jnl`	Robust Integer Programming. CoRR Shmuel Onn
2014	J	`jnl`	Robust integer programming. Oper. Res. Lett. Shmuel Onn
2013	J	`jnl`	n-Fold integer programming in cubic time. Math. Program. Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk
2012	J	`jnl`	Convex Integer Optimization by Constantly Many Linear Counterparts CoRR Shmuel Onn, Michal Rozenblit
2012	J	`jnl`	Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. Math. Program. Michel Baes, Alberto Del Pia, Yurii E. Nesterov, Shmuel Onn, Robert Weismantel
2012	J	`jnl`	The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
2011	J	`jnl`	A polynomial oracle-time algorithm for convex integer minimization. Math. Program. Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2011	—	`ch.`	Convex Discrete Optimization. Combinatorial Optimization - Methods and Applications Shmuel Onn
2011	J	`jnl`	Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes. Ann. Oper. Res. Shmuel Onn, Ishay Weissman
2011	J	`jnl`	N-fold integer programming in cubic time CoRR Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk
2010	J	`jnl`	Accuracy Certificates for Computational Problems with Convex Structure. Math. Oper. Res. Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
2010	J	`jnl`	Intractability of approximate multi-dimensional nonlinear optimization on independence systems. CoRR Jon Lee, Shmuel Onn, Robert Weismantel
2010	J	`jnl`	Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel
2010	J	`jnl`	The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions CoRR Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
2009	J	`jnl`	Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discret. Math. Jon Lee, Shmuel Onn, Robert Weismantel
2009	—	`ch.`	Convex Discrete Optimization. Encyclopedia of Optimization Shmuel Onn
2009	J	`jnl`	Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Comb. Probab. Comput. Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn
2009	J	`jnl`	Graphs of transportation polytopes. J. Comb. Theory A Jesús A. De Loera, Edward D. Kim, Shmuel Onn, Francisco Santos
2009	J	`jnl`	Multicommodity Flow in Polynomial Time. CoRR Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2009	C	`conf`	Nonlinear Optimization over a Weighted Independence System. AAIM Jon Lee, Shmuel Onn, Robert Weismantel
2009	J	`jnl`	Theory and Applications of N-Fold Integer Programming. CoRR Shmuel Onn
2009	J	`jnl`	Two graph isomorphism polytopes. Discret. Math. Shmuel Onn
2008	J	`jnl`	N-fold integer programming. Discret. Optim. Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2008	J	`jnl`	Nonlinear Matroid Optimization and Experimental Design. SIAM J. Discret. Math. Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn
2008	J	`jnl`	Nonlinear Optimization over a Weighted Independence System CoRR Jon Lee, Shmuel Onn, Robert Weismantel
2008	J	`jnl`	Nonlinear bipartite matching. Discret. Optim. Yael Berstein, Shmuel Onn
2008	J	`jnl`	On test sets for nonlinear integer maximization. Oper. Res. Lett. Jon Lee, Shmuel Onn, Robert Weismantel
2008	J	`jnl`	Two graph isomorphism polytopes CoRR Shmuel Onn
2007	J	`jnl`	Convex Discrete Optimization. CoRR Shmuel Onn
2007	J	`jnl`	Nonlinear Matroid Optimization and Experimental Design. CoRR Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn
2007	J	`jnl`	The Graver Complexity of Integer Programming. CoRR Yael Berstein, Shmuel Onn
2007	J	`jnl`	The convex dimension of a graph. Discret. Appl. Math. Nir Halman, Shmuel Onn, Uriel G. Rothblum
2007	J	`jnl`	The use of edge-directions and linear programming to enumerate vertices. J. Comb. Optim. Shmuel Onn, Uriel G. Rothblum
2006	J	`jnl`	All Linear and Integer Programs Are Slim 3-Way Transportation Programs. SIAM J. Optim. Jesús A. De Loera, Shmuel Onn
2006	C	`conf`	Entry Uniqueness in Margined Tables. Privacy in Statistical Databases Shmuel Onn
2006	J	`jnl`	Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comput. Jesús A. De Loera, Shmuel Onn
2006	J	`jnl`	N-Fold Integer Programming. CoRR Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel
2006	J	`jnl`	Nonlinear Bipartite Matching. CoRR Yael Berstein, Shmuel Onn
2005	J	`jnl`	Edge-Directions of Standard Polyhedra with Applications to Network Flows. J. Glob. Optim. Shmuel Onn, Uriel G. Rothblum, Yoav Tangir
2004	J	`jnl`	A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory A Shmuel Onn, Rom Pinchasi
2004	B	`conf`	All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. IPCO Jesús A. De Loera, Shmuel Onn
2004	J	`jnl`	Convex Combinatorial Optimization. Discret. Comput. Geom. Shmuel Onn, Uriel G. Rothblum
2004	J	`jnl`	Nowhere-zero flow polynomials. J. Comb. Theory A Shmuel Onn
2004	J	`jnl`	The Complexity of Three-Way Statistical Tables. SIAM J. Comput. Jesús A. De Loera, Shmuel Onn
2003	J	`jnl`	An Adaptive Algorithm for Vector Partitioning. J. Glob. Optim. Komei Fukuda, Shmuel Onn, Vera Rosta
2003	J	`jnl`	Automated Transformations for PDE Systems with Application to Multigrid Solvers. SIAM J. Sci. Comput. Yossi Gil, Zvi Gutterman, Shmuel Onn, Irad Yavneh
2003	J	`jnl`	Convex Combinatorial Optimization CoRR Shmuel Onn, Uriel G. Rothblum
2003	J	`jnl`	Convex Matroid Optimization. SIAM J. Discret. Math. Shmuel Onn
2003	J	`jnl`	Nowhere-Zero Flow Polynomials CoRR Shmuel Onn
2003	J	`jnl`	Social network coordination and graph routing. Networks Shmuel Onn, Elisheva Sperber
2003	J	`jnl`	The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. Adv. Appl. Math. Eric Babson, Shmuel Onn, Rekha R. Thomas
2002	J	`jnl`	Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences. Discret. Comput. Geom. Sharon Aviran, Shmuel Onn
2002	J	`jnl`	Solitaire Lattices. Graphs Comb. Antoine Deza, Shmuel Onn
2002	J	`jnl`	Vertex characterization of partition polytopes of bipartitions and of planar point sets. Discret. Appl. Math. Sharon Aviran, Nissan Lev-Tov, Shmuel Onn, Uriel G. Rothblum
2001	J	`jnl`	The Vector Partition Problem for Convex Objective Functions. Math. Oper. Res. Shmuel Onn, Leonard J. Schulman
2000	J	`jnl`	Linear-shaped partition problems. Oper. Res. Lett. Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum
1999	J	`jnl`	A Polynomial Time Algorithm for Shaped Partition Problems. SIAM J. Optim. Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum
1999	J	`jnl`	Separable Partitions. Discret. Appl. Math. Noga Alon, Shmuel Onn
1997	J	`jnl`	Book reviews. Math. Methods Oper. Res. Shmuel Onn, Robert Weismantel, Peter Brucker
1997	J	`jnl`	Colourful Linear Programming and its Relatives. Math. Oper. Res. Imre Bárány, Shmuel Onn
1997	J	`jnl`	Determination of Social Laws for Multi-Agent Mobilization. Artif. Intell. Shmuel Onn, Moshe Tennenholtz
1997	J	`jnl`	Strongly Signable and Partitionable Posets. Eur. J. Comb. Shmuel Onn
1996	B	`conf`	Colourful Linear Programming. IPCO Imre Bárány, Shmuel Onn
1996	J	`jnl`	Signable Posets and Partitionable Simplicial Complexes. Discret. Comput. Geom. Peter Kleinschmidt, Shmuel Onn
1995	J	`jnl`	Lattice-Free Polytopes and Their Diameter. Discret. Comput. Geom. Michel Deza, Shmuel Onn
1995	B	`conf`	Oriented Matroid Polytopes and Polyhedral Fans are Signable. IPCO Peter Kleinschmidt, Shmuel Onn
1994	J	`jnl`	Approximating Oracle Machines for Combinatorial Optimization. SIAM J. Optim. Shmuel Onn
1993	J	`jnl`	Geometry, Complexity, and Combinatorics of Permutation Polytopes. J. Comb. Theory A Shmuel Onn
1992	J	`jnl`	On the diameter of convex polytopes. Discret. Math. Peter Kleinschmidt, Shmuel Onn
1991	J	`jnl`	On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice. SIAM J. Discret. Math. Shmuel Onn
1990	B	`conf`	On the Radon Number of the Integer Lattice. IPCO Shmuel Onn