According to our database
1,
Shmuel Onn
authored at least 101 papers
between 1990 and 2024.
Collaborative distances:
2024
SIAM J. Discret. Math., 2024
Circuit and Graver walks and linear and integer programming.
Discret. Optim., 2024
Degree Sequence Optimization and Extremal Degree Enumerators.
CoRR, 2024
2023
Reducibility bounds of objective functions over the integers.
Oper. Res. Lett., November, 2023
Degree sequence optimization in bounded treewidth.
Optim. Lett., June, 2023
Separable and equatable hypergraphs.
Discret. Appl. Math., June, 2023
High-multiplicity N-fold IP via configuration LP.
Math. Program., 2023
2022
Matching orderable and separable hypergraphs.
Optim. Lett., 2022
Approximate separable multichoice optimization over monotone systems.
Discret. Optim., 2022
2021
Parameterized complexity of configuration integer programs.
Oper. Res. Lett., 2021
Sparse Integer Programming is FPT.
Bull. EATCS, 2021
Uniform and monotone line sum optimization.
Discret. Appl. Math., 2021
Optimization over degree sequences of graphs.
Discret. Appl. Math., 2021
The Complexity of Vector Partition.
CoRR, 2021
2020
On degree sequence optimization.
Oper. Res. Lett., 2020
On Line Sum Optimization.
CoRR, 2020
Optimization over Young Diagrams.
CoRR, 2020
2019
Parameterized shifted combinatorial optimization.
J. Comput. Syst. Sci., 2019
Hypergraphic Degree Sequences are Hard.
Bull. EATCS, 2019
Multitype Integer Monoid Optimization and Applications.
CoRR, 2019
An Algorithmic Theory of Integer Programming.
CoRR, 2019
On the Complexity of Toric Ideals.
CoRR, 2019
2018
Optimization over Degree Sequences.
SIAM J. Discret. Math., 2018
Discret. Comput. Geom., 2018
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory.
J. Comput. Syst. Sci., 2017
On nonlinear multi-covering problems.
J. Comb. Optim., 2017
Approximate Shifted Combinatorial Optimization.
CoRR, 2017
2016
Shifted matroid optimization.
Oper. Res. Lett., 2016
Efficient solutions for weight-balanced partitioning problems.
Discret. Optim., 2016
2015
Huge Unimodular n-Fold Programs.
SIAM J. Discret. Math., 2015
The unimodular intersection problem.
Oper. Res. Lett., 2015
On the complexity of Hilbert refutations for partition.
J. Symb. Comput., 2015
Some efficiently solvable problems over integer partition polytopes.
Discret. Appl. Math., 2015
The Unimodular Intersection Problem.
CoRR, 2015
Unimodular Integer Caratheodory is Fixed Parameter Tractable.
CoRR, 2015
Lexicographic Matroid Optimization.
CoRR, 2015
2014
Robust integer programming.
Oper. Res. Lett., 2014
Huge multiway table problems.
Discret. Optim., 2014
2013
n-Fold integer programming in cubic time.
Math. Program., 2013
2012
The quadratic Graver cone, quadratic integer minimization, and extensions.
Math. Program., 2012
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.
Math. Program., 2012
Convex Integer Optimization by Constantly Many Linear Counterparts
CoRR, 2012
2011
Convex Discrete Optimization.
Proceedings of the Combinatorial Optimization - Methods and Applications, 2011
<i>N</i>-fold integer programming and nonlinear multi-transshipment.
Optim. Lett., 2011
A polynomial oracle-time algorithm for convex integer minimization.
Math. Program., 2011
Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes.
Ann. Oper. Res., 2011
2010
Parametric nonlinear discrete optimization over well-described sets and matroid intersections.
Math. Program., 2010
Accuracy Certificates for Computational Problems with Convex Structure.
Math. Oper. Res., 2010
Intractability of approximate multi-dimensional nonlinear optimization on independence systems.
CoRR, 2010
2009
Convex Discrete Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Approximate Nonlinear Optimization over Weighted Independence Systems.
SIAM J. Discret. Math., 2009
Graphs of transportation polytopes.
J. Comb. Theory A, 2009
Two graph isomorphism polytopes.
Discret. Math., 2009
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.
Comb. Probab. Comput., 2009
Theory and Applications of N-Fold Integer Programming.
CoRR, 2009
Multicommodity Flow in Polynomial Time.
CoRR, 2009
Nonlinear Optimization over a Weighted Independence System.
Proceedings of the Algorithmic Aspects in Information and Management, 2009
2008
Nonlinear Matroid Optimization and Experimental Design.
SIAM J. Discret. Math., 2008
On test sets for nonlinear integer maximization.
Oper. Res. Lett., 2008
N-fold integer programming.
Discret. Optim., 2008
Nonlinear bipartite matching.
Discret. Optim., 2008
2007
The use of edge-directions and linear programming to enumerate vertices.
J. Comb. Optim., 2007
The convex dimension of a graph.
Discret. Appl. Math., 2007
Convex Discrete Optimization.
CoRR, 2007
The Graver Complexity of Integer Programming.
CoRR, 2007
2006
All Linear and Integer Programs Are Slim 3-Way Transportation Programs.
SIAM J. Optim., 2006
Markov bases of three-way tables are arbitrarily complicated.
J. Symb. Comput., 2006
Entry Uniqueness in Margined Tables.
Proceedings of the Privacy in Statistical Databases, 2006
2005
Edge-Directions of Standard Polyhedra with Applications to Network Flows.
J. Glob. Optim., 2005
2004
The Complexity of Three-Way Statistical Tables.
SIAM J. Comput., 2004
A note on the minimum number of edge-directions of a convex polytope.
J. Comb. Theory A, 2004
Nowhere-zero flow polynomials.
J. Comb. Theory A, 2004
Convex Combinatorial Optimization.
Discret. Comput. Geom., 2004
All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2003
Automated Transformations for PDE Systems with Application to Multigrid Solvers.
SIAM J. Sci. Comput., 2003
Convex Matroid Optimization.
SIAM J. Discret. Math., 2003
Social network coordination and graph routing.
Networks, 2003
An Adaptive Algorithm for Vector Partitioning.
J. Glob. Optim., 2003
The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.
Adv. Appl. Math., 2003
2002
Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences.
Discret. Comput. Geom., 2002
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
Discret. Appl. Math., 2002
2001
The Vector Partition Problem for Convex Objective Functions.
Math. Oper. Res., 2001
2000
Linear-shaped partition problems.
Oper. Res. Lett., 2000
1999
A Polynomial Time Algorithm for Shaped Partition Problems.
SIAM J. Optim., 1999
Discret. Appl. Math., 1999
1997
Colourful Linear Programming and its Relatives.
Math. Oper. Res., 1997
Math. Methods Oper. Res., 1997
Strongly Signable and Partitionable Posets.
Eur. J. Comb., 1997
Determination of Social Laws for Multi-Agent Mobilization.
Artif. Intell., 1997
1996
Signable Posets and Partitionable Simplicial Complexes.
Discret. Comput. Geom., 1996
Colourful Linear Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Lattice-Free Polytopes and Their Diameter.
Discret. Comput. Geom., 1995
Oriented Matroid Polytopes and Polyhedral Fans are Signable.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
Approximating Oracle Machines for Combinatorial Optimization.
SIAM J. Optim., 1994
1993
Geometry, Complexity, and Combinatorics of Permutation Polytopes.
J. Comb. Theory A, 1993
1992
On the diameter of convex polytopes.
Discret. Math., 1992
1991
On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice.
SIAM J. Discret. Math., 1991
1990
On the Radon Number of the Integer Lattice.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990