| 2009 |
|---|
| 36 | EE | Shmuel Onn:
Convex Discrete Optimization.
Encyclopedia of Optimization 2009: 513-550 |
| 2008 |
|---|
| 35 | EE | Shmuel Onn:
Two graph isomorphism polytopes
CoRR abs/0801.1410: (2008) |
| 34 | EE | Jon Lee,
Shmuel Onn,
Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System
CoRR abs/0805.0954: (2008) |
| 33 | EE | Yael Berstein,
Shmuel Onn:
Nonlinear bipartite matching.
Discrete Optimization 5(1): 53-65 (2008) |
| 32 | EE | Jesús A. De Loera,
Raymond Hemmecke,
Shmuel Onn,
Robert Weismantel:
N-fold integer programming.
Discrete Optimization 5(2): 231-241 (2008) |
| 31 | EE | Jon Lee,
Shmuel Onn,
Robert Weismantel:
On test sets for nonlinear integer maximization.
Oper. Res. Lett. 36(4): 439-443 (2008) |
| 30 | EE | Yael Berstein,
Jon Lee,
Hugo Maruri-Aguilar,
Shmuel Onn,
Eva Riccomagno,
Robert Weismantel,
Henry P. Wynn:
Nonlinear Matroid Optimization and Experimental Design.
SIAM J. Discrete Math. 22(3): 901-919 (2008) |
| 2007 |
|---|
| 29 | EE | Nir Halman,
Shmuel Onn,
Uriel G. Rothblum:
The convex dimension of a graph.
Discrete Applied Mathematics 155(11): 1373-1383 (2007) |
| 28 | EE | Shmuel Onn,
Uriel G. Rothblum:
The use of edge-directions and linear programming to enumerate vertices.
J. Comb. Optim. 14(2-3): 153-164 (2007) |
| 2006 |
|---|
| 27 | EE | Shmuel Onn:
Entry Uniqueness in Margined Tables.
Privacy in Statistical Databases 2006: 94-101 |
| 26 | EE | Jesús A. De Loera,
Shmuel Onn:
Markov bases of three-way tables are arbitrarily complicated.
J. Symb. Comput. 41(2): 173-181 (2006) |
| 2004 |
|---|
| 25 | EE | Jesús A. De Loera,
Shmuel Onn:
All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables.
IPCO 2004: 338-351 |
| 24 | EE | Shmuel Onn,
Uriel G. Rothblum:
Convex Combinatorial Optimization.
Discrete & Computational Geometry 32(4): 549-566 (2004) |
| 23 | EE | Shmuel Onn,
Rom Pinchasi:
A note on the minimum number of edge-directions of a convex polytope.
J. Comb. Theory, Ser. A 107(1): 147-151 (2004) |
| 22 | EE | Shmuel Onn:
Nowhere-zero flow polynomials.
J. Comb. Theory, Ser. A 108(2): 205-215 (2004) |
| 21 | EE | Jesús A. De Loera,
Shmuel Onn:
The Complexity of Three-Way Statistical Tables.
SIAM J. Comput. 33(4): 819-836 (2004) |
| 2003 |
|---|
| 20 | EE | Shmuel Onn,
Uriel G. Rothblum:
Convex Combinatorial Optimization
CoRR math.CO/0309083: (2003) |
| 19 | EE | Shmuel Onn:
Nowhere-Zero Flow Polynomials
CoRR math.CO/0309347: (2003) |
| 18 | EE | Shmuel Onn,
Elisheva Sperber:
Social network coordination and graph routing.
Networks 41(1): 44-50 (2003) |
| 17 | EE | Shmuel Onn:
Convex Matroid Optimization.
SIAM J. Discrete Math. 17(2): 249-253 (2003) |
| 2002 |
|---|
| 16 | EE | Sharon Aviran,
Shmuel Onn:
Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences.
Discrete & Computational Geometry 27(3): 409-417 (2002) |
| 15 | | Sharon Aviran,
Nissan Lev-Tov,
Shmuel Onn,
Uriel G. Rothblum:
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
Discrete Applied Mathematics 124(1-3): 1-15 (2002) |
| 14 | EE | Antoine Deza,
Shmuel Onn:
Solitaire Lattices.
Graphs and Combinatorics 18(2): 227-243 (2002) |
| 2001 |
|---|
| 13 | EE | Shmuel Onn,
Leonard J. Schulman:
The Vector Partition Problem for Convex Objective Functions.
Math. Oper. Res. 26(3): 583-590 (2001) |
| 2000 |
|---|
| 12 | EE | Frank K. Hwang,
Shmuel Onn,
Uriel G. Rothblum:
Linear-shaped partition problems.
Oper. Res. Lett. 26(4): 159-163 (2000) |
| 1999 |
|---|
| 11 | EE | Noga Alon,
Shmuel Onn:
Separable Partitions.
Discrete Applied Mathematics 91(1-3): 39-51 (1999) |
| 1997 |
|---|
| 10 | EE | Shmuel Onn,
Moshe Tennenholtz:
Determination of Social Laws for Multi-Agent Mobilization.
Artif. Intell. 95(1): 155-167 (1997) |
| 9 | EE | Shmuel Onn:
Strongly Signable and Partitionable Posets.
Eur. J. Comb. 18(8): 921-938 (1997) |
| 1996 |
|---|
| 8 | | Imre Bárány,
Shmuel Onn:
Colourful Linear Programming.
IPCO 1996: 1-15 |
| 7 | EE | Peter Kleinschmidt,
Shmuel Onn:
Signable Posets and Partitionable Simplicial Complexes.
Discrete & Computational Geometry 15(4): 443-466 (1996) |
| 1995 |
|---|
| 6 | | Peter Kleinschmidt,
Shmuel Onn:
Oriented Matroid Polytopes and Polyhedral Fans are Signable.
IPCO 1995: 198-211 |
| 5 | | Michel Deza,
Shmuel Onn:
Lattice-Free Polytopes and Their Diameter.
Discrete & Computational Geometry 13: 59-75 (1995) |
| 1993 |
|---|
| 4 | | Shmuel Onn:
Geometry, Complexity, and Combinatorics of Permutation Polytopes.
J. Comb. Theory, Ser. A 64(1): 31-49 (1993) |
| 1992 |
|---|
| 3 | EE | Peter Kleinschmidt,
Shmuel Onn:
On the diameter of convex polytopes.
Discrete Mathematics 102(1): 75-77 (1992) |
| 1991 |
|---|
| 2 | | Shmuel Onn:
On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice.
SIAM J. Discrete Math. 4(3): 436-447 (1991) |
| 1990 |
|---|
| 1 | | Shmuel Onn:
On the Radon Number of the Integer Lattice.
IPCO 1990: 385-396 |
