Shmuel Onn

From MaRDI portal
Person:314826

Available identifiers

zbMath Open onn.shmuelWikidataQ97323090 ScholiaQ97323090MaRDI QIDQ314826

List of research outcomes

PublicationDate of PublicationType
Asymptotic behavior of Markov complexity2024-02-23Paper
Degree sequence optimization in bounded treewidth2023-06-05Paper
Kissing polytopes2023-05-29Paper
High-multiplicity \(N\)-fold IP via configuration LP2023-05-25Paper
Separable and equatable hypergraphs2023-04-17Paper
Asymptotic behavior of Markov complexity of matrices2022-10-04Paper
Oriented matroid polytopes and polyhedral fans are signable2022-08-30Paper
The complexity of vector partition2022-07-15Paper
Approximate separable multichoice optimization over monotone systems2022-06-09Paper
Separable and Equatable Hypergraphs2022-06-06Paper
Matching orderable and separable hypergraphs2022-05-16Paper
https://portal.mardi4nfdi.de/entity/Q50710292022-04-19Paper
Parameterized complexity of configuration integer programs2022-03-11Paper
Optimization over Young diagrams2021-11-29Paper
The Complexity of Vector Partition2021-09-14Paper
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs2021-07-28Paper
Uniform and monotone line sum optimization2021-05-31Paper
Optimization over degree sequences of graphs2021-04-20Paper
On degree sequence optimization2021-04-07Paper
On line sum optimization2021-02-16Paper
On Degree Sequence Optimization2020-03-11Paper
Hypergraphic Degree Sequences are Hard2020-01-13Paper
Small primitive zonotopes2019-04-30Paper
On the Complexity of Toric Ideals2019-02-04Paper
Colourful linear programming2019-01-11Paper
Parameterized shifted combinatorial optimization2018-12-10Paper
Robust integer programming2018-09-28Paper
The unimodular intersection problem2018-09-28Paper
Optimization over Degree Sequences2018-08-10Paper
Primitive zonotopes2018-07-26Paper
Efficient solutions for weight-balanced partitioning problems2018-05-24Paper
Shifted matroid optimization2018-02-06Paper
Parameterized shifted combinatorial optimization2017-10-23Paper
On nonlinear multi-covering problems2017-02-22Paper
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory2016-09-16Paper
Minimal average degree aberration and the state polytope for experimental designs2016-02-19Paper
Huge Unimodular $n$-Fold Programs2015-12-04Paper
Huge multiway table problems2015-04-09Paper
Some efficiently solvable problems over integer partition polytopes2014-11-28Paper
https://portal.mardi4nfdi.de/entity/Q29287112014-11-10Paper
On the complexity of Hilbert refutations for partition2014-07-16Paper
Convex integer optimization by constantly many linear counterparts2014-06-04Paper
\(n\)-fold integer programming in cubic time2013-03-18Paper
The quadratic Graver cone, quadratic integer minimization, and extensions2012-12-19Paper
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes2012-11-02Paper
Theory and Applications of n-Fold Integer Programming2012-07-10Paper
Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes2012-03-08Paper
The Graver complexity of integer programming2012-01-24Paper
Intractability of approximate multi-dimensional nonlinear optimization on independence systems2011-05-06Paper
Accuracy Certificates for Computational Problems with Convex Structure2011-04-27Paper
\(N\)-fold integer programming and nonlinear multi-transshipment2011-03-14Paper
A polynomial oracle-time algorithm for convex integer minimization2011-02-14Paper
Approximate Nonlinear Optimization over Weighted Independence Systems2010-12-03Paper
Parametric nonlinear discrete optimization over well-described sets and matroid intersections2010-09-16Paper
Nonlinear discrete optimization. An algorithmic theory2010-09-10Paper
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum2010-04-23Paper
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz2010-04-22Paper
Two graph isomorphism polytopes2009-12-09Paper
Graphs of transportation polytopes2009-11-26Paper
Nonlinear Matroid Optimization and Experimental Design2009-08-20Paper
Nonlinear Optimization over a Weighted Independence System2009-07-02Paper
Convex integer maximization via Graver bases2009-05-12Paper
On test sets for nonlinear integer maximization2009-03-04Paper
\(N\)-fold integer programming2008-10-29Paper
Nonlinear optimization for matroid intersection and extensions2008-07-24Paper
Nonlinear bipartite matching2008-05-16Paper
The use of edge-directions and linear programming to enumerate vertices2008-02-18Paper
Markov bases of three-way tables are arbitrarily complicated2007-10-23Paper
All Linear and Integer Programs Are Slim 3‐Way Transportation Programs2007-09-06Paper
The convex dimension of a graph2007-07-19Paper
Edge-directions of standard polyhedra with applications to network flows2006-01-23Paper
Permutohedra and minimal matrices2005-12-27Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
Convex combinatorial optimization2005-02-23Paper
The Complexity of Three-Way Statistical Tables2005-02-21Paper
Nowhere-zero flow polynomials2005-01-11Paper
A note on the minimum number of edge-directions of a convex polytope2004-08-06Paper
Convex Matroid Optimization2004-01-08Paper
The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.2003-09-15Paper
An adaptive algorithm for vector partitioning2003-06-09Paper
Social network coordination and graph routing2003-03-10Paper
Automated Transformations for PDE Systems with Application to Multigrid Solvers2003-01-05Paper
The Radon-split and the Helly-core of a point configuration2002-12-16Paper
Vertex characterization of partition polytopes of bipartitions and of planar point sets2002-12-02Paper
Solitaire lattices2002-07-29Paper
Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences2002-05-30Paper
The Vector Partition Problem for Convex Objective Functions2001-11-26Paper
Cutting corners2001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q47619582001-02-21Paper
Explicit solution of partitioning problems over a 1-dimensional parameter space2000-12-07Paper
Linear-shaped partition problems2000-09-04Paper
Representations and characterizations of vertices of bounded-shape partition polytopes1999-12-19Paper
A Polynomial Time Algorithm for Shaped Partition Problems1999-11-24Paper
Separable partitions1999-11-02Paper
Determination of social laws for multi-agent mobilization1998-06-30Paper
Strongly signable and partitionable posets1998-05-06Paper
A Colorful Determinantal Identity, a Conjecture of Rota, and Latin Squares1998-04-14Paper
Colourful Linear Programming and its Relatives1997-10-28Paper
https://portal.mardi4nfdi.de/entity/Q43523111997-08-28Paper
Signable posets and partitionable simplicial complexes1996-05-27Paper
Hilbert series of group representations and Gröbner bases for generic modules1995-09-25Paper
Lattice-free polytopes and their diameter1995-08-13Paper
Approximating Oracle Machines for Combinatorial Optimization1995-01-12Paper
A Note on Lattice Simplices and Toric Varieties1995-01-02Paper
A quantitative Steinitz' theorem1994-12-12Paper
Geometry, complexity, and combinatorics of permutation polytopes1993-12-02Paper
On the diameter of convex polytopes1992-09-27Paper
On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice1992-06-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Shmuel Onn