DBLP: Imre Bárány

	2013
j51		Imre Bárány, William L. Steiger: On the variance of random polygons. Comput. Geom. 46(2): 173-180 (2013)
j50		Imre Bárány, Pavle V. M. Blagojevic, Aleksandra Dimitrijevic Blagojevic: Functions, Measures, and Equipartitioning Convex k-Fans. Discrete & Computational Geometry 49(2): 382-401 (2013)
j49		Imre Bárány, Boris D. Ginzburg, Victor S. Grinberg: 2013 unit vectors in the plane. Discrete Mathematics 313(15): 1600-1601 (2013)
	2012
j48		Imre Bárány, Hiroshi Maehara, Norihide Tokushige: Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame. Comput. Geom. 45(1-2): 14-20 (2012)
j47		Imre Bárány, Roman N. Karasev: Notes About the Carathéodory Number. Discrete & Computational Geometry 48(3): 783-792 (2012)
	2011
j46		Imre Bárány, Luis Montejano, Deborah Oliveros: Guest Editors' Foreword. Discrete & Computational Geometry 45(2): 221-222 (2011)
	2010
c10		William L. Steiger, Imre Bárány: On the variance of random polygons. CCCG 2010: 211-214
	2009
j45		Jorge L. Arocha, Imre Bárány, Javier Bracho, Ruy Fabila, Luis Montejano: Very Colorful Theorems. Discrete & Computational Geometry 42(2): 142-154 (2009)
j44		Gergely Ambrus, Imre Bárány: Longest convex chains. Random Struct. Algorithms 35(2): 137-162 (2009)
j43		Imre Bárány, Attila Pór, Pavel Valtr: Paths with No Small Angles. SIAM J. Discrete Math. 23(4): 1655-1666 (2009)
	2008
j42		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)
c9		Imre Bárány, Attila Pór, Pavel Valtr: Paths with no Small Angles. LATIN 2008: 654-663
	2007
j41		Imre Bárány, János Pach: Foreword. Discrete & Computational Geometry 38(2): 175-176 (2007)
j40		Imre Bárány, Jirí Matousek: Packing Cones and Their Negatives in Space. Discrete & Computational Geometry 38(2): 177-187 (2007)
j39		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)
j38		Imre Bárány, Santosh Vempala, Adrian Vetta: Nash equilibria in random games. Random Struct. Algorithms 31(4): 391-405 (2007)
j37		Imre Bárány, Jirí Matousek: Quadratically Many Colorful Simplices. SIAM J. Discrete Math. 21(1): 191-198 (2007)
	2006
j36		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)
j35		Imre Bárány, Jirí Matousek: Berge's theorem, fractional Helly, and art galleries. Discrete Mathematics 306(19-20): 2303-2313 (2006)
	2005
j34		Imre Bárány, Jirí Matousek: The Randomized Integer Convex Hull. Discrete & Computational Geometry 33(1): 3-25 (2005)
j33		Imre Bárány, Nandor Simányi: A note on the size of the largest ball inside a convex polytope. Periodica Mathematica Hungarica 51(2): 15-18 (2005)
c8		Imre Bárány, Santosh Vempala, Adrian Vetta: Nash Equilibria in Random Games. FOCS 2005: 123-131
i1		Imre Bárány, Günter Rote: Strictly convex drawings of planar graphs. CoRR abs/cs/0507030 (2005)
	2004
j32		Imre Bárány, Norihide Tokushige: The Minimum Area of Convex Lattice n-Gons. Combinatorica 24(2): 171-185 (2004)
j31		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
j30		Imre Bárány, Krystyna Kuperberg, Tudor Zamfirescu: Total Curvature and Spiralling Shortest Paths. Discrete & Computational Geometry 30(2): 167-176 (2003)
	2002
j29		Imre Bárány, Jirí Matousek: Equipartition of Two Measures by a 4-Fan. Discrete & Computational Geometry 27(3): 293-301 (2002)
j28		Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos: Covering lattice points by subspaces. Periodica Mathematica Hungarica 43(1-2): 93-103 (2002)
	2001
j27		Imre Bárány, Jirí Matousek: Simultaneous Partitions of Measures by k-Fans. Discrete & Computational Geometry 25(3): 317-334 (2001)
j26		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
j25		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)
j24		Imre Bárány, Jean-Michel Kantor: On the Number of Lattice Free Polytopes. Eur. J. Comb. 21(1): 103-110 (2000)
c7		Imre Bárány, Gyula Károlyi: Problems and Results around the Erdös-Szekeres Convex Polygon Theorem. JCDCG 2000: 91-105
	1998
j23		Imre Bárány, Pavel Valtr: A Positive Fraction Erdos - Szekeres Theorem. Discrete & Computational Geometry 19(3): 335-342 (1998)
j22		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
c6		Imre Bárány, Shmuel Onn: Colourful Linear Programming. IPCO 1996: 1-15
	1995
j21		Imre Bárány, János Pach: Guest Editor's Forword. Discrete & Computational Geometry 13: 243-244 (1995)
j20		Imre Bárány: The Limit Shape of Convex Lattice Polygons. Discrete & Computational Geometry 13: 279-295 (1995)
c5		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
	1994
j19		Imre Bárány, William L. Steiger: On the Expected Number of k-Sets. Discrete & Computational Geometry 11: 243-263 (1994)
j18		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)
j17		Imre Bárány, Roger Howe, Herbert E. Scarf: The complex of maximal lattice free simplices. Math. Program. 66: 273-281 (1994)
	1993
j16		Imre Bárány, Peter Frankl, Hiroshi Maehara: Reflecting a triangle in the plane. Graphs and Combinatorics 9(2-4): 97-104 (1993)
c4		Imre Bárány, Roger Howe, Herbert E. Scarf: The complex of maximal lattice free simplices. IPCO 1993: 1-9
	1992
j15		Imre Bárány, Roger Howe, László Lovász: On integer points in polyhedra: a lower bound. Combinatorica 12(2): 135-142 (1992)
j14		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)
j13		Imre Bárány, János Pach: On the Number of Convex Lattice Polygons. Combinatorics, Probability & Computing 1: 295-302 (1992)
	1991
c3		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
j12		Imre Bárány, Zoltán Füredi, László Lovász: On the number of halving planes. Combinatorica 10(2): 175-183 (1990)
j11		Imre Bárány, Micha Sharir: The Caratheodory number for the k-core. Combinatorica 10(2): 185-194 (1990)
j10		Imre Bárány, D. G. Larman: A Combinatorial Property of Points anf Ellipsoids. Discrete & Computational Geometry 5: 375-382 (1990)
	1989
j9		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)
c2		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
	1987
j8		Imre Bárány: An extension of the Erdös - Szekeres theorem on large angles. Combinatorica 7(2): 161-169 (1987)
j7		Imre Bárány, Zoltán Füredi: Computing the Volume is Difficulte. Discrete & Computational Geometry 2: 319-326 (1987)
	1986
j6		Imre Bárány, Jack Edmonds, Laurence A. Wolsey: Packing and covering a tree by subtrees. Combinatorica 6(3): 221-233 (1986)
j5		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)
c1		Imre Bárány, Zoltán Füredi: Computing the Volume Is Difficult. STOC 1986: 442-447
	1983
j4		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
j3		Imre Bárány: A generalization of carathéodory's theorem. Discrete Mathematics 40(2-3): 141-152 (1982)
	1979
j2		Imre Bárány: On a Class of Balancing Games. J. Comb. Theory, Ser. A 26(2): 115-126 (1979)
	1978
j1		Imre Bárány: A Short Proof of Kneser's Conjecture. J. Comb. Theory, Ser. A 25(3): 325-326 (1978)

2013

j51

Imre Bárány, William L. Steiger: On the variance of random polygons. Comput. Geom. 46(2): 173-180 (2013)

j50

Imre Bárány, Pavle V. M. Blagojevic, Aleksandra Dimitrijevic Blagojevic: Functions, Measures, and Equipartitioning Convex k-Fans. Discrete & Computational Geometry 49(2): 382-401 (2013)

j49

Imre Bárány, Boris D. Ginzburg, Victor S. Grinberg: 2013 unit vectors in the plane. Discrete Mathematics 313(15): 1600-1601 (2013)

2012

j48

Imre Bárány, Hiroshi Maehara, Norihide Tokushige: Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame. Comput. Geom. 45(1-2): 14-20 (2012)

j47

Imre Bárány, Roman N. Karasev: Notes About the Carathéodory Number. Discrete & Computational Geometry 48(3): 783-792 (2012)

2011

j46

Imre Bárány, Luis Montejano, Deborah Oliveros: Guest Editors' Foreword. Discrete & Computational Geometry 45(2): 221-222 (2011)

2010

c10

William L. Steiger, Imre Bárány: On the variance of random polygons. CCCG 2010: 211-214

2009

j45

Jorge L. Arocha, Imre Bárány, Javier Bracho, Ruy Fabila, Luis Montejano: Very Colorful Theorems. Discrete & Computational Geometry 42(2): 142-154 (2009)

j44

Gergely Ambrus, Imre Bárány: Longest convex chains. Random Struct. Algorithms 35(2): 137-162 (2009)

j43

Imre Bárány, Attila Pór, Pavel Valtr: Paths with No Small Angles. SIAM J. Discrete Math. 23(4): 1655-1666 (2009)

2008

j42

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)

Imre Bárány, Attila Pór, Pavel Valtr: Paths with no Small Angles. LATIN 2008: 654-663

2007

j41

Imre Bárány, János Pach: Foreword. Discrete & Computational Geometry 38(2): 175-176 (2007)

j40

Imre Bárány, Jirí Matousek: Packing Cones and Their Negatives in Space. Discrete & Computational Geometry 38(2): 177-187 (2007)

j39

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)

j38

Imre Bárány, Santosh Vempala, Adrian Vetta: Nash equilibria in random games. Random Struct. Algorithms 31(4): 391-405 (2007)

j37

Imre Bárány, Jirí Matousek: Quadratically Many Colorful Simplices. SIAM J. Discrete Math. 21(1): 191-198 (2007)

2006

j36

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)

j35

Imre Bárány, Jirí Matousek: Berge's theorem, fractional Helly, and art galleries. Discrete Mathematics 306(19-20): 2303-2313 (2006)

2005

j34

Imre Bárány, Jirí Matousek: The Randomized Integer Convex Hull. Discrete & Computational Geometry 33(1): 3-25 (2005)

j33

Imre Bárány, Nandor Simányi: A note on the size of the largest ball inside a convex polytope. Periodica Mathematica Hungarica 51(2): 15-18 (2005)

Imre Bárány, Santosh Vempala, Adrian Vetta: Nash Equilibria in Random Games. FOCS 2005: 123-131

Imre Bárány, Günter Rote: Strictly convex drawings of planar graphs. CoRR abs/cs/0507030 (2005)

2004

j32

Imre Bárány, Norihide Tokushige: The Minimum Area of Convex Lattice n-Gons. Combinatorica 24(2): 171-185 (2004)

j31

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

j30

Imre Bárány, Krystyna Kuperberg, Tudor Zamfirescu: Total Curvature and Spiralling Shortest Paths. Discrete & Computational Geometry 30(2): 167-176 (2003)

2002

j29

Imre Bárány, Jirí Matousek: Equipartition of Two Measures by a 4-Fan. Discrete & Computational Geometry 27(3): 293-301 (2002)

j28

Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos: Covering lattice points by subspaces. Periodica Mathematica Hungarica 43(1-2): 93-103 (2002)

2001

j27

Imre Bárány, Jirí Matousek: Simultaneous Partitions of Measures by k-Fans. Discrete & Computational Geometry 25(3): 317-334 (2001)

j26

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

j25

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)

j24

Imre Bárány, Jean-Michel Kantor: On the Number of Lattice Free Polytopes. Eur. J. Comb. 21(1): 103-110 (2000)

Imre Bárány, Gyula Károlyi: Problems and Results around the Erdös-Szekeres Convex Polygon Theorem. JCDCG 2000: 91-105

1998

j23

Imre Bárány, Pavel Valtr: A Positive Fraction Erdos - Szekeres Theorem. Discrete & Computational Geometry 19(3): 335-342 (1998)

j22

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

Imre Bárány, Shmuel Onn: Colourful Linear Programming. IPCO 1996: 1-15

1995

j21

Imre Bárány, János Pach: Guest Editor's Forword. Discrete & Computational Geometry 13: 243-244 (1995)

j20

Imre Bárány: The Limit Shape of Convex Lattice Polygons. Discrete & Computational Geometry 13: 279-295 (1995)

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

1994

j19

Imre Bárány, William L. Steiger: On the Expected Number of k-Sets. Discrete & Computational Geometry 11: 243-263 (1994)

j18

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)

j17

Imre Bárány, Roger Howe, Herbert E. Scarf: The complex of maximal lattice free simplices. Math. Program. 66: 273-281 (1994)

1993

j16

Imre Bárány, Peter Frankl, Hiroshi Maehara: Reflecting a triangle in the plane. Graphs and Combinatorics 9(2-4): 97-104 (1993)

Imre Bárány, Roger Howe, Herbert E. Scarf: The complex of maximal lattice free simplices. IPCO 1993: 1-9

1992

j15

Imre Bárány, Roger Howe, László Lovász: On integer points in polyhedra: a lower bound. Combinatorica 12(2): 135-142 (1992)

j14

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)

j13

Imre Bárány, János Pach: On the Number of Convex Lattice Polygons. Combinatorics, Probability & Computing 1: 295-302 (1992)

1991

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

j12

Imre Bárány, Zoltán Füredi, László Lovász: On the number of halving planes. Combinatorica 10(2): 175-183 (1990)

j11

Imre Bárány, Micha Sharir: The Caratheodory number for the k-core. Combinatorica 10(2): 185-194 (1990)

j10

Imre Bárány, D. G. Larman: A Combinatorial Property of Points anf Ellipsoids. Discrete & Computational Geometry 5: 375-382 (1990)

1989

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)

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

1987

Imre Bárány: An extension of the Erdös - Szekeres theorem on large angles. Combinatorica 7(2): 161-169 (1987)

Imre Bárány, Zoltán Füredi: Computing the Volume is Difficulte. Discrete & Computational Geometry 2: 319-326 (1987)

1986

Imre Bárány, Jack Edmonds, Laurence A. Wolsey: Packing and covering a tree by subtrees. Combinatorica 6(3): 221-233 (1986)

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)

Imre Bárány, Zoltán Füredi: Computing the Volume Is Difficult. STOC 1986: 442-447

1983

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

Imre Bárány: A generalization of carathéodory's theorem. Discrete Mathematics 40(2-3): 141-152 (1982)

1979

Imre Bárány: On a Class of Balancing Games. J. Comb. Theory, Ser. A 26(2): 115-126 (1979)

1978

Imre Bárány: A Short Proof of Kneser's Conjecture. J. Comb. Theory, Ser. A 25(3): 325-326 (1978)

1	Noga Alon	[j14]
2	Gergely Ambrus	[j44]
3	Jorge L. Arocha	[j45]
4	Antal Balog	[c3]
5	Aleksandra Dimitrijevic Blagojevic	[j50]
6	Pavle V. M. Blagojevic	[j50]
7	Javier Bracho	[j45]
8	Károly Böröczky	[j5]
9	Jack Edmonds	[j6]
10	Ruy Fabila	[j45]
11	Peter Frankl	[j16]
12	Zoltán Füredi	[j26] [j14] [j12] [c2] [j7] [c1] [j4]
13	Boris D. Ginzburg	[j49]
14	Victor S. Grinberg	[j49]
15	Gergely Harcos	[j28]
16	Aladár Heppes	[j18]
17	Roger Howe	[j17] [c4] [j15]
18	Alfredo Hubard	[j42]
19	Jesús Jerónimo	[j42]
20	Jean-Michel Kantor	[j24]
21	Roman N. Karasev	[j47]
22	Daniel J. Kleitman	[j14]
23	Krystyna Kuperberg	[j30]
24	Gyula Károlyi	[c7]
25	David G. Larman (D. G. Larman)	[j10]
26	László Lovász	[j15] [j12] [c2]
27	Hiroshi Maehara	[j48] [j16]
28	Endre Makai	[j5]
29	Jirí Matousek	[j40] [j37] [j35] [j34] [j29] [j27]
30	Luis Montejano	[j46] [j45]
31	Deborah Oliveros	[j46]
32	Shmuel Onn	[c6]
33	János Pach	[j41] [j28] [j21] [j13] [j5]
34	Attila Pór	[j43] [c9]
35	Günter Rote	[i1] [j25]
36	Herbert E. Scarf	[j22] [c5] [j17] [c4]
37	James H. Schmerl	[j9]
38	David Shallcross	[j22] [c5]
39	Micha Sharir	[j11]
40	Stuart J. Sidney	[j9]
41	Nandor Simányi	[j33]
42	William L. Steiger	[j51] [c10] [j25] [j19]
43	Gábor Tardos	[j28]
44	Norihide Tokushige	[j48] [j32]
45	Jorge Urrutia	[j9]
46	Pavel Valtr	[j43] [c9] [j23]
47	Santosh Vempala	[j38] [c8]
48	Adrian Vetta	[j38] [c8]
49	Laurence A. Wolsey	[j6]
50	Tudor Zamfirescu	[j30]
51	C.-H. Zhang	[j25]

Imre Bárány

Coauthor Index