Shmuel Onn

Discret. Appl. Math., 2025

2024

Kissing Polytopes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Circuit and Graver walks and linear and integer programming.

[BibT_eX]

[DOI]

Discret. Optim., 2024

2023

Reducibility bounds of objective functions over the integers.

[BibT_eX]

[DOI]

Friedrich Eisenbrand

Christoph Hunkenschröder

Oper. Res. Lett., November, 2023

Degree sequence optimization in bounded treewidth.

[BibT_eX]

[DOI]

Optim. Lett., June, 2023

Separable and equatable hypergraphs.

[BibT_eX]

[DOI]

Daniel Deza

Discret. Appl. Math., June, 2023

High-multiplicity N-fold IP via configuration LP.

[BibT_eX]

[DOI]

Math. Program., 2023

On Supmodular Matrices.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Matching orderable and separable hypergraphs.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Approximate separable multichoice optimization over monotone systems.

[BibT_eX]

[DOI]

Discret. Optim., 2022

2021

Parameterized complexity of configuration integer programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Sparse Integer Programming is FPT.

[BibT_eX]

[DOI]

Martin Koutecký

Bull. EATCS, 2021

Uniform and monotone line sum optimization.

[BibT_eX]

[DOI]

Martin Koutecký

Discret. Appl. Math., 2021

Optimization over degree sequences of graphs.

[BibT_eX]

[DOI]

Gabriel Deza

Discret. Appl. Math., 2021

The Complexity of Vector Partition.

[BibT_eX]

[DOI]

CoRR, 2021

2020

On degree sequence optimization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

On Line Sum Optimization.

[BibT_eX]

[DOI]

CoRR, 2020

Optimization over Young Diagrams.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Hypergraphic Degree Sequences are Hard.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Multitype Integer Monoid Optimization and Applications.

[BibT_eX]

[DOI]

CoRR, 2019

An Algorithmic Theory of Integer Programming.

[BibT_eX]

[DOI]

Friedrich Eisenbrand

Christoph Hunkenschröder

CoRR, 2019

On the Complexity of Toric Ideals.

[BibT_eX]

[DOI]

Diego Cifuentes

CoRR, 2019

2018

Optimization over Degree Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Primitive Zonotopes.

[BibT_eX]

[DOI]

Antoine Deza

George Manoussakis

Discret. Comput. Geom., 2018

A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs.

[BibT_eX]

[DOI]

Martin Koutecký

Asaf Levin

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.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

On nonlinear multi-covering problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Approximate Shifted Combinatorial Optimization.

[BibT_eX]

[DOI]

CoRR, 2017

Parameterized Shifted Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Shifted matroid optimization.

[BibT_eX]

[DOI]

Asaf Levin

Oper. Res. Lett., 2016

Efficient solutions for weight-balanced partitioning problems.

[BibT_eX]

[DOI]

Steffen Borgwardt

Discret. Optim., 2016

2015

Huge Unimodular n-Fold Programs.

[BibT_eX]

[DOI]

Pauline Sarrabezolles

SIAM J. Discret. Math., 2015

The unimodular intersection problem.

[BibT_eX]

[DOI]

Volker Kaibel

Pauline Sarrabezolles

Oper. Res. Lett., 2015

On the complexity of Hilbert refutations for partition.

[BibT_eX]

[DOI]

Susan Margulies

Dmitrii V. Pasechnik

J. Symb. Comput., 2015

Some efficiently solvable problems over integer partition polytopes.

[BibT_eX]

[DOI]

Vladimir A. Shlyk

Discret. Appl. Math., 2015

The Unimodular Intersection Problem.

[BibT_eX]

[DOI]

Pauline Sarrabezolles

CoRR, 2015

Unimodular Integer Caratheodory is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2015

Lexicographic Matroid Optimization.

[BibT_eX]

[DOI]

Asaf Levin

CoRR, 2015

2014

Robust integer programming.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Huge multiway table problems.

[BibT_eX]

[DOI]

Discret. Optim., 2014

2013

n-Fold integer programming in cubic time.

[BibT_eX]

[DOI]

Lyubov Romanchuk

Math. Program., 2013

2012

The quadratic Graver cone, quadratic integer minimization, and extensions.

[BibT_eX]

[DOI]

Math. Program., 2012

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.

[BibT_eX]

[DOI]

Math. Program., 2012

Convex Integer Optimization by Constantly Many Linear Counterparts

[BibT_eX]

[DOI]

Michal Rozenblit

CoRR, 2012

2011

Convex Discrete Optimization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Methods and Applications, 2011

<i>N</i>-fold integer programming and nonlinear multi-transshipment.

[BibT_eX]

[DOI]

Optim. Lett., 2011

A polynomial oracle-time algorithm for convex integer minimization.

[BibT_eX]

[DOI]

Math. Program., 2011

Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes.

[BibT_eX]

[DOI]

Ishay Weissman

Ann. Oper. Res., 2011

2010

Parametric nonlinear discrete optimization over well-described sets and matroid intersections.

[BibT_eX]

[DOI]

Math. Program., 2010

Accuracy Certificates for Computational Problems with Convex Structure.

[BibT_eX]

[DOI]

Arkadi Nemirovski

Math. Oper. Res., 2010

Intractability of approximate multi-dimensional nonlinear optimization on independence systems.

[BibT_eX]

[DOI]

CoRR, 2010

2009

Convex Discrete Optimization.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Approximate Nonlinear Optimization over Weighted Independence Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Graphs of transportation polytopes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2009

Two graph isomorphism polytopes.

[BibT_eX]

[DOI]

Discret. Math., 2009

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

Theory and Applications of N-Fold Integer Programming.

[BibT_eX]

[DOI]

CoRR, 2009

Multicommodity Flow in Polynomial Time.

[BibT_eX]

[DOI]

CoRR, 2009

Nonlinear Optimization over a Weighted Independence System.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Nonlinear Matroid Optimization and Experimental Design.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

On test sets for nonlinear integer maximization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

N-fold integer programming.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Nonlinear bipartite matching.

[BibT_eX]

[DOI]

Yael Berstein

Discret. Optim., 2008

2007

The use of edge-directions and linear programming to enumerate vertices.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

The convex dimension of a graph.

[BibT_eX]

[DOI]

Nir Halman

Discret. Appl. Math., 2007

Convex Discrete Optimization.

[BibT_eX]

[DOI]

CoRR, 2007

The Graver Complexity of Integer Programming.

[BibT_eX]

[DOI]

Yael Berstein

CoRR, 2007

2006

All Linear and Integer Programs Are Slim 3-Way Transportation Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

Markov bases of three-way tables are arbitrarily complicated.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Entry Uniqueness in Margined Tables.

[BibT_eX]

[DOI]

Proceedings of the Privacy in Statistical Databases, 2006

2005

Edge-Directions of Standard Polyhedra with Applications to Network Flows.

[BibT_eX]

[DOI]

Yoav Tangir

J. Glob. Optim., 2005

2004

The Complexity of Three-Way Statistical Tables.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

A note on the minimum number of edge-directions of a convex polytope.

[BibT_eX]

[DOI]

Rom Pinchasi

J. Comb. Theory A, 2004

Nowhere-zero flow polynomials.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2004

Convex Combinatorial Optimization.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Automated Transformations for PDE Systems with Application to Multigrid Solvers.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2003

Convex Matroid Optimization.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Social network coordination and graph routing.

[BibT_eX]

[DOI]

Elisheva Sperber

Networks, 2003

An Adaptive Algorithm for Vector Partitioning.

[BibT_eX]

[DOI]

Komei Fukuda

Vera Rosta

J. Glob. Optim., 2003

The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.

[BibT_eX]

[DOI]

Eric Babson

Rekha R. Thomas

Adv. Appl. Math., 2003

2002

Solitaire Lattices.

[BibT_eX]

[DOI]

Antoine Deza

Graphs Comb., 2002

Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences.

[BibT_eX]

[DOI]

Sharon Aviran

Discret. Comput. Geom., 2002

Vertex characterization of partition polytopes of bipartitions and of planar point sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

The Vector Partition Problem for Convex Objective Functions.

[BibT_eX]

[DOI]

Leonard J. Schulman

Math. Oper. Res., 2001

2000

Linear-shaped partition problems.

[BibT_eX]

[DOI]

Frank K. Hwang

Oper. Res. Lett., 2000

1999

A Polynomial Time Algorithm for Shaped Partition Problems.

[BibT_eX]

[DOI]

Frank K. Hwang

SIAM J. Optim., 1999

Separable Partitions.

[BibT_eX]

[DOI]

Noga Alon

Discret. Appl. Math., 1999

1997

Colourful Linear Programming and its Relatives.

[BibT_eX]

[DOI]

Imre Bárány

Math. Oper. Res., 1997

Book reviews.

[BibT_eX]

[DOI]

Peter Brucker

Math. Methods Oper. Res., 1997

Strongly Signable and Partitionable Posets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1997

Determination of Social Laws for Multi-Agent Mobilization.

[BibT_eX]

[DOI]

Moshe Tennenholtz

Artif. Intell., 1997

1996

Signable Posets and Partitionable Simplicial Complexes.

[BibT_eX]

[DOI]

Peter Kleinschmidt

Discret. Comput. Geom., 1996

Colourful Linear Programming.

[BibT_eX]

[DOI]

Imre Bárány

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Lattice-Free Polytopes and Their Diameter.

[BibT_eX]

[DOI]

Michel Deza

Discret. Comput. Geom., 1995

Oriented Matroid Polytopes and Polyhedral Fans are Signable.

[BibT_eX]

[DOI]

Peter Kleinschmidt

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Approximating Oracle Machines for Combinatorial Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 1994

1993

Geometry, Complexity, and Combinatorics of Permutation Polytopes.

[BibT_eX]

J. Comb. Theory A, 1993

1992

On the diameter of convex polytopes.

[BibT_eX]

[DOI]

Peter Kleinschmidt

Discret. Math., 1992

1991

On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

1990

On the Radon Number of the Integer Lattice.

[BibT_eX]