Imre Bárány

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

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



In proceedings 
PhD thesis 




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

Tverberg Plus Minus.
Discrete & Computational Geometry, 2018

Pach's Selection Theorem Does Not Admit a Topological Extension.
Discrete & Computational Geometry, 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.
Discrete & Computational Geometry, 2015

Topology of Geometric Joins.
Discrete & Computational Geometry, 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.
Discrete & Computational Geometry, 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.
Discrete Mathematics, 2013

Holding Circles and Fixing Frames.
Discrete & Computational Geometry, 2013

A Question from a Famous Paper of Erdős.
Discrete & Computational Geometry, 2013

Many Empty Triangles have a Common Edge.
Discrete & Computational Geometry, 2013

Functions, Measures, and Equipartitioning Convex k-Fans.
Discrete & Computational Geometry, 2013

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

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

Notes About the Carathéodory Number.
Discrete & Computational Geometry, 2012

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

Guest Editors' Foreword.
Discrete & Computational Geometry, 2011

On the variance of random polygons.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Longest convex chains.
Random Struct. Algorithms, 2009

Very Colorful Theorems.
Discrete & Computational Geometry, 2009

Slicing Convex Sets and Measures by a Hyperplane.
Discrete & Computational Geometry, 2008

Paths with no Small Angles.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

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

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

Discrete & Computational Geometry, 2007

Packing Cones and Their Negatives in Space.
Discrete & Computational Geometry, 2007

Berge's theorem, fractional Helly, and art galleries.
Discrete Mathematics, 2006

Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004.
Combinatorics, Probability & Computing, 2006

A note on the size of the largest ball inside a convex polytope.
Periodica Mathematica Hungarica, 2005

The Randomized Integer Convex Hull.
Discrete & Computational Geometry, 2005

Nash Equilibria in Random Games.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

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

The Minimum Area of Convex Lattice n-Gons.
Combinatorica, 2004

Total Curvature and Spiralling Shortest Paths.
Discrete & Computational Geometry, 2003

Covering lattice points by subspaces.
Periodica Mathematica Hungarica, 2002

Equipartition of Two Measures by a 4-Fan.
Discrete & Computational Geometry, 2002

On the lattice diameter of a convex polygon.
Discrete Mathematics, 2001

Simultaneous Partitions of Measures by k-Fans.
Discrete & Computational Geometry, 2001

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

A Central Limit Theorem for Convex Chains in the Square.
Discrete & Computational Geometry, 2000

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

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

A Positive Fraction Erdos - Szekeres Theorem.
Discrete & Computational Geometry, 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.
Discrete & Computational Geometry, 1995

The Limit Shape of Convex Lattice Polygons.
Discrete & Computational Geometry, 1995

The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

On the Expected Number of k-Sets.
Discrete & Computational Geometry, 1994

On the Exact Constant i the Quantitative Steinitz Theorem in the Plane.
Discrete & Computational Geometry, 1994

Reflecting a triangle in the plane.
Graphs and Combinatorics, 1993

The complex of maximal lattice free simplices.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

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

On the Number of Convex Lattice Polygons.
Combinatorics, Probability & Computing, 1992

Point Selections and Weak e-Nets for Convex Hulls.
Combinatorics, Probability & Computing, 1992

On integer points in polyhedra: a lower bound.
Combinatorica, 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.
Discrete & Computational Geometry, 1990

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

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

On the Convex Hull of the Integer Points in a Disc.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

A Combinatorial Result About Points and Balls in Euclidean Space.
Discrete & Computational Geometry, 1989

On the Number of Halving Planes.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

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

Computing the Volume is Difficulte.
Discrete & Computational Geometry, 1987

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

Maximal volume enclosed by plates and proof of the chessboard conjecture.
Discrete Mathematics, 1986

Packing and covering a tree by subtrees.
Combinatorica, 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
Information and Control, 1983

A generalization of carathéodory's theorem.
Discrete Mathematics, 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