| 2008 |
|---|
| 49 | EE | Imre Bárány,
Attila Pór,
Pavel Valtr:
Paths with no Small Angles.
LATIN 2008: 654-663 |
| 48 | EE | Imre Bárány,
Alfredo Hubard,
Jesús Jerónimo:
Slicing Convex Sets and Measures by a Hyperplane.
Discrete & Computational Geometry 39(1-3): 67-75 (2008) |
| 2007 |
|---|
| 47 | EE | Imre Bárány,
János Pach:
Foreword.
Discrete & Computational Geometry 38(2): 175-176 (2007) |
| 46 | EE | Imre Bárány,
Jirí Matousek:
Packing Cones and Their Negatives in Space.
Discrete & Computational Geometry 38(2): 177-187 (2007) |
| 45 | EE | Imre Bárány:
The chance that a convex body is lattice-point free: A relative of Buffon's needle problem.
Random Struct. Algorithms 30(3): 414-426 (2007) |
| 44 | EE | Imre Bárány,
Santosh Vempala,
Adrian Vetta:
Nash equilibria in random games.
Random Struct. Algorithms 31(4): 391-405 (2007) |
| 43 | EE | Imre Bárány,
Jirí Matousek:
Quadratically Many Colorful Simplices.
SIAM J. Discrete Math. 21(1): 191-198 (2007) |
| 2006 |
|---|
| 42 | EE | Imre Bárány:
Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004.
Combinatorics, Probability & Computing 15(6): 941-942 (2006) |
| 41 | EE | Imre Bárány,
Jirí Matousek:
Berge's theorem, fractional Helly, and art galleries.
Discrete Mathematics 306(19-20): 2303-2313 (2006) |
| 2005 |
|---|
| 40 | EE | Imre Bárány,
Santosh Vempala,
Adrian Vetta:
Nash Equilibria in Random Games.
FOCS 2005: 123-131 |
| 39 | EE | Imre Bárány,
Günter Rote:
Strictly convex drawings of planar graphs
CoRR abs/cs/0507030: (2005) |
| 38 | EE | Imre Bárány,
Jirí Matousek:
The Randomized Integer Convex Hull.
Discrete & Computational Geometry 33(1): 3-25 (2005) |
| 2004 |
|---|
| 37 | EE | Imre Bárány,
Norihide Tokushige:
The Minimum Area of Convex Lattice n-Gons.
Combinatorica 24(2): 171-185 (2004) |
| 36 | | Imre Bárány:
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp.
Combinatorics, Probability & Computing 13(2): 280-282 (2004) |
| 2003 |
|---|
| 35 | EE | Imre Bárány,
Krystyna Kuperberg,
Tudor Zamfirescu:
Total Curvature and Spiralling Shortest Paths.
Discrete & Computational Geometry 30(2): 167-176 (2003) |
| 2002 |
|---|
| 34 | EE | Imre Bárány,
Jirí Matousek:
Equipartition of Two Measures by a 4-Fan.
Discrete & Computational Geometry 27(3): 293-301 (2002) |
| 2001 |
|---|
| 33 | EE | Imre Bárány,
Jirí Matousek:
Simultaneous Partitions of Measures by k-Fans.
Discrete & Computational Geometry 25(3): 317-334 (2001) |
| 32 | EE | Imre Bárány,
Zoltán Füredi:
On the lattice diameter of a convex polygon.
Discrete Mathematics 241(1-3): 41-50 (2001) |
| 2000 |
|---|
| 31 | EE | Imre Bárány,
Gyula Károlyi:
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem.
JCDCG 2000: 91-105 |
| 30 | EE | Imre Bárány,
Günter Rote,
William L. Steiger,
C.-H. Zhang:
A Central Limit Theorem for Convex Chains in the Square.
Discrete & Computational Geometry 23(1): 35-50 (2000) |
| 29 | EE | Imre Bárány,
Jean-Michel Kantor:
On the Number of Lattice Free Polytopes.
Eur. J. Comb. 21(1): 103-110 (2000) |
| 1998 |
|---|
| 28 | EE | Imre Bárány,
Pavel Valtr:
A Positive Fraction Erdos - Szekeres Theorem.
Discrete & Computational Geometry 19(3): 335-342 (1998) |
| 27 | | Imre Bárány,
Herbert E. Scarf,
David Shallcross:
The topological structure of maximal lattice free convex bodies: The general case.
Math. Program. 80: 1-15 (1998) |
| 1996 |
|---|
| 26 | | Imre Bárány,
Shmuel Onn:
Colourful Linear Programming.
IPCO 1996: 1-15 |
| 1995 |
|---|
| 25 | | Imre Bárány,
Herbert E. Scarf,
David Shallcross:
The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case.
IPCO 1995: 244-251 |
| 24 | | Imre Bárány,
János Pach:
Guest Editor's Forword.
Discrete & Computational Geometry 13: 243-244 (1995) |
| 23 | | Imre Bárány:
The Limit Shape of Convex Lattice Polygons.
Discrete & Computational Geometry 13: 279-295 (1995) |
| 1994 |
|---|
| 22 | | Imre Bárány,
William L. Steiger:
On the Expected Number of k-Sets.
Discrete & Computational Geometry 11: 243-263 (1994) |
| 21 | | Imre Bárány,
Aladár Heppes:
On the Exact Constant i the Quantitative Steinitz Theorem in the Plane.
Discrete & Computational Geometry 12: 387-398 (1994) |
| 20 | | Imre Bárány,
Roger Howe,
Herbert E. Scarf:
The complex of maximal lattice free simplices.
Math. Program. 66: 273-281 (1994) |
| 1993 |
|---|
| 19 | | Imre Bárány,
Roger Howe,
Herbert E. Scarf:
The complex of maximal lattice free simplices.
IPCO 1993: 1-9 |
| 1992 |
|---|
| 18 | | Imre Bárány,
Roger Howe,
László Lovász:
On integer points in polyhedra: a lower bound.
Combinatorica 12(2): 135-142 (1992) |
| 17 | | Noga Alon,
Imre Bárány,
Zoltán Füredi,
Daniel J. Kleitman:
Point Selections and Weak e-Nets for Convex Hulls.
Combinatorics, Probability & Computing 1: 189-200 (1992) |
| 16 | | Imre Bárány,
János Pach:
On the Number of Convex Lattice Polygons.
Combinatorics, Probability & Computing 1: 295-302 (1992) |
| 1991 |
|---|
| 15 | EE | Antal Balog,
Imre Bárány:
On the Convex Hull of the Integer Points in a Disc.
Symposium on Computational Geometry 1991: 162-165 |
| 1990 |
|---|
| 14 | | Imre Bárány,
Zoltán Füredi,
László Lovász:
On the number of halving planes.
Combinatorica 10(2): 175-183 (1990) |
| 13 | | Imre Bárány,
Micha Sharir:
The Caratheodory number for the k-core.
Combinatorica 10(2): 185-194 (1990) |
| 12 | | Imre Bárány,
D. G. Larman:
A Combinatorial Property of Points anf Ellipsoids.
Discrete & Computational Geometry 5: 375-382 (1990) |
| 1989 |
|---|
| 11 | EE | Imre Bárány,
Zoltán Füredi,
László Lovász:
On the Number of Halving Planes.
Symposium on Computational Geometry 1989: 140-144 |
| 10 | | Imre Bárány,
James H. Schmerl,
Stuart J. Sidney,
Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space.
Discrete & Computational Geometry 4: 259-262 (1989) |
| 1987 |
|---|
| 9 | | Imre Bárány:
An extension of the Erdös - Szekeres theorem on large angles.
Combinatorica 7(2): 161-169 (1987) |
| 8 | | Imre Bárány,
Zoltán Füredi:
Computing the Volume is Difficulte.
Discrete & Computational Geometry 2: 319-326 (1987) |
| 1986 |
|---|
| 7 | | Imre Bárány,
Zoltán Füredi:
Computing the Volume Is Difficult
STOC 1986: 442-447 |
| 6 | | Imre Bárány,
Jack Edmonds,
Laurence A. Wolsey:
Packing and covering a tree by subtrees.
Combinatorica 6(3): 221-233 (1986) |
| 5 | EE | Károly Böröczky,
Imre Bárány,
Endre Makai,
János Pach:
Maximal volume enclosed by plates and proof of the chessboard conjecture.
Discrete Mathematics 60: 101-120 (1986) |
| 1983 |
|---|
| 4 | | Imre Bárány,
Zoltán Füredi:
Mental Poker with Three or More Players
Information and Control 59(1-3): 84-93 (1983) |
| 1982 |
|---|
| 3 | EE | Imre Bárány:
A generalization of carathéodory's theorem.
Discrete Mathematics 40(2-3): 141-152 (1982) |
| 1979 |
|---|
| 2 | | Imre Bárány:
On a Class of Balancing Games.
J. Comb. Theory, Ser. A 26(2): 115-126 (1979) |
| 1978 |
|---|
| 1 | | Imre Bárány:
A Short Proof of Kneser's Conjecture.
J. Comb. Theory, Ser. A 25(3): 325-326 (1978) |
