Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Onn, Shmuel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphs of transportation polytopes
Jesús A. De Loera
,
Edward D. Kim
,
Shmuel Onn
,
Francisco Santos
Journal of Combinatorial Theory Series A
116
(8), 2009, pp. 1306-1325
Approximate nonlinear optimization over weighted independence systems
Jon Lee
,
Shmuel Onn
,
Robert Weismantel
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1667-1681
Nonlinear matroid optimization and experimental design
Yael Berstein
,
Jon Lee
,
Hugo Maruri-Aguilar
,
Shmuel Onn
,
Eva Riccomagno
,
Robert Weismantel
,
Henry Wynn
SIAM Journal on Discrete Mathematics
22
(3), 2008, pp. 901-919
Markov bases of three-way tables are arbitrarily complicated
Jesús A. De Loera
,
Shmuel Onn
Journal Symbolic Computation
41
(2), 2006, pp. 173-181
All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables
Jesus De Loera
,
Shmuel Onn
Lecture Notes in Computer Science
3064
, 2004, pp. 338-351
A note on the minimum number of edge-directions of a convex polytope
Shmuel Onn
,
Rom Pinchasi
Journal of Combinatorial Theory Series A
107
(1), 2004, pp. 147-151
Nowhere-zero flow polynomials
Shmuel Onn
Journal of Combinatorial Theory Series A
108
(2), 2004, pp. 205-215
The complexity of three-way statistical tables
Jesus de Loera
,
Shmuel Onn
SIAM Journal on Computing
33
(4), 2004, pp. 819-836
Social network coordination and graph routing
Shmuel Onn
,
Elisheva Sperber
Networks
41
(1), 2003, pp. 44-50
Convex matroid optimization
Shmuel Onn
SIAM Journal on Discrete Mathematics
17
(2), 2003, pp. 249-253
Solitaire lattices
Antoine Deza
,
Shmuel Onn
Graphs and Combinatorics
18
(2), 2002, pp. 227-243
Separable partitions
Noga Alon
,
Shmuel Onn
Discrete Applied Mathematics
91
(1-3), 1999, pp. 39-51
Colourful linear programming
Imre Bárány
,
Shmuel Onn
Lecture Notes in Computer Science
1084
, 1996, pp. 1-15
Oriented matroid polytopes and polyhedral fans are signable
Peter Kleinschmidt
,
Shmuel Onn
Lecture Notes in Computer Science
920
, 1995, pp. 198-211
Geometry, complexity, and combinatorics of permutation polytopes
Shmuel Onn
Journal of Combinatorial Theory Series A
64
(1), 1993, pp. 31-49
On the geometry and computational complexity of Radon partitions in the integer lattice
Shmuel Onn
SIAM Journal on Discrete Mathematics
4
(3), 1991, August, pp. 436-447