Imre Bárány

  • Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics, Budapest, Hungary
  • University College London, Department of Mathematics, London, UK

According to our database1, Imre Bárány authored at least 85 papers between 1978 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



How (Not) to Cut Your Cheese.
Am. Math. Mon., 2021

Orientation Preserving Maps of the Square Grid.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Theorems of Carathéodory, Helly, and Tverberg Without Dimension.
Discret. Comput. Geom., 2020

An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets.
Comput. Geom., 2020

Theorems of Carathéodory, Helly, and Tverberg without dimension.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Tverberg Plus Minus.
Discret. Comput. Geom., 2018

Pach's Selection Theorem Does Not Admit a Topological Extension.
Discret. Comput. Geom., 2018

Acknowledgement of priority - A fractional Helly theorem for boxes.
Comput. Geom., 2018

Random points in halfspheres.
Random Struct. Algorithms, 2017

Helge Tverberg is eighty: A personal tribute.
Eur. J. Comb., 2017

Erdős-Szekeres Theorem for Lines.
Discret. Comput. Geom., 2015

Topology of Geometric Joins.
Discret. Comput. Geom., 2015

A fractional Helly theorem for boxes.
Comput. Geom., 2015

Homogeneous selections from hyperplanes.
J. Comb. Theory, Ser. B, 2014

Colourful and Fractional (p, q)-theorems.
Discret. Comput. Geom., 2014

Longest convex lattice chains.
Comput. Geom., 2014

Curves in Rd intersecting every hyperplane at most d + 1 times.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Tensors, colours, octahedra.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013 unit vectors in the plane.
Discret. Math., 2013

Holding Circles and Fixing Frames.
Discret. Comput. Geom., 2013

A Question from a Famous Paper of Erdős.
Discret. Comput. Geom., 2013

Many Empty Triangles have a Common Edge.
Discret. Comput. Geom., 2013

Functions, Measures, and Equipartitioning Convex k-Fans.
Discret. Comput. Geom., 2013

On the variance of random polygons.
Comput. Geom., 2013

On a forgotten conjecture from a famous paper of Erdös.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Notes About the Carathéodory Number.
Discret. Comput. Geom., 2012

Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame.
Comput. Geom., 2012

Guest Editors' Foreword.
Discret. Comput. Geom., 2011

Paths with No Small Angles.
SIAM J. Discret. Math., 2009

Longest convex chains.
Random Struct. Algorithms, 2009

Very Colorful Theorems.
Discret. Comput. Geom., 2009

Slicing Convex Sets and Measures by a Hyperplane.
Discret. Comput. Geom., 2008

Quadratically Many Colorful Simplices.
SIAM J. Discret. Math., 2007

Nash equilibria in random games.
Random Struct. Algorithms, 2007

The chance that a convex body is lattice-point free: A relative of Buffon's needle problem.
Random Struct. Algorithms, 2007

Discret. Comput. Geom., 2007

Packing Cones and Their Negatives in Space.
Discret. Comput. Geom., 2007

Berge's theorem, fractional Helly, and art galleries.
Discret. Math., 2006

Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004.
Comb. Probab. Comput., 2006

A note on the size of the largest ball inside a convex polytope.
Period. Math. Hung., 2005

The Randomized Integer Convex Hull.
Discret. Comput. Geom., 2005

Strictly convex drawings of planar graphs
CoRR, 2005

Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp.
Comb. Probab. Comput., 2004

The Minimum Area of Convex Lattice <i>n</i>-Gons.
Comb., 2004

Total Curvature and Spiralling Shortest Paths.
Discret. Comput. Geom., 2003

Covering lattice points by subspaces.
Period. Math. Hung., 2002

Equipartition of Two Measures by a 4-Fan.
Discret. Comput. Geom., 2002

On the lattice diameter of a convex polygon.
Discret. Math., 2001

Simultaneous Partitions of Measures by <i>k</i>-Fans.
Discret. Comput. Geom., 2001

On the Number of Lattice Free Polytopes.
Eur. J. Comb., 2000

A Central Limit Theorem for Convex Chains in the Square.
Discret. Comput. Geom., 2000

Problems and Results around the Erdös-Szekeres Convex Polygon Theorem.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

The topological structure of maximal lattice free convex bodies: The general case.
Math. Program., 1998

Matrices with Identical Sets of Neighbors.
Math. Oper. Res., 1998

A Positive Fraction Erdos - Szekeres Theorem.
Discret. Comput. Geom., 1998

Colourful Linear Programming and its Relatives.
Math. Oper. Res., 1997

Colourful Linear Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Guest Editor's Forword.
Discret. Comput. Geom., 1995

The Limit Shape of Convex Lattice Polygons.
Discret. Comput. Geom., 1995

The complex of maximal lattice free simplices.
Math. Program., 1994

On the Expected Number of k-Sets.
Discret. Comput. Geom., 1994

On the Exact Constant i the Quantitative Steinitz Theorem in the Plane.
Discret. Comput. Geom., 1994

Reflecting a triangle in the plane.
Graphs Comb., 1993

Fair Distribution Protocols or How the Players Replace Fortune.
Math. Oper. Res., 1992

On the Number of Convex Lattice Polygons.
Comb. Probab. Comput., 1992

Point Selections and Weak e-Nets for Convex Hulls.
Comb. Probab. Comput., 1992

On integer points in polyhedra: a lower bound.
Comb., 1992

On the Convex Hull of the Integer Points in a Disc.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

A Combinatorial Property of Points anf Ellipsoids.
Discret. Comput. Geom., 1990

The Caratheodory number for the k-core.
Comb., 1990

On the number of halving planes.
Comb., 1990

Do Projections Go to Infinity?
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

A Combinatorial Result About Points and Balls in Euclidean Space.
Discret. Comput. Geom., 1989

Covering with Euclidean Boxes.
Eur. J. Comb., 1987

Computing the Volume is Difficulte.
Discret. Comput. Geom., 1987

An extension of the Erdös - Szekeres theorem on large angles.
Comb., 1987

Maximal volume enclosed by plates and proof of the chessboard conjecture.
Discret. Math., 1986

Packing and covering a tree by subtrees.
Comb., 1986

Computing the Volume Is Difficult
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Mental Poker with Three or More Players
Inf. Control., 1983

A generalization of carathéodory's theorem.
Discret. Math., 1982

A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees.
Math. Oper. Res., 1981

Borsuk's theorem through complementary pivoting.
Math. Program., 1980

On a Class of Balancing Games.
J. Comb. Theory, Ser. A, 1979

A Short Proof of Kneser's Conjecture.
J. Comb. Theory, Ser. A, 1978