The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shmuel Onn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  30. Nonlinear Optimization over a Weighted Independence System. [Citation Graph (, )][DBLP]


  31. Two graph isomorphism polytopes [Citation Graph (, )][DBLP]


  32. Nonlinear Optimization over a Weighted Independence System [Citation Graph (, )][DBLP]


  33. The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions [Citation Graph (, )][DBLP]


  34. Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. [Citation Graph (, )][DBLP]


  35. Two graph isomorphism polytopes. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002