Imre Bárány

According to our database, Imre Bárány authored at least 89 papers between 1978 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Orientation Preserving Maps of the Square Grid II.

Imre Bárány, Attila Pór

Discret. Comput. Geom., September, 2024

2023

Piercing the Chessboard.

Gergely Ambrus, Imre Bárány, Peter Frankl, Dániel Varga

SIAM J. Discret. Math., September, 2023

Erdős-Szekeres Theorem for k-Flats.

Imre Bárány, Gil Kalai, Attila Pór

Discret. Comput. Geom., June, 2023

2021

How (Not) to Cut Your Cheese.

Imre Bárány, Peter Frankl

Am. Math. Mon., 2021

Orientation preserving maps of the n × n grid.

Imre Bárány, Attila Pór, Pavel Valtr

J. Comput. Geom., 2021

Orientation Preserving Maps of the Square Grid.

Imre Bárány, Attila Pór, Pavel Valtr

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Theorems of Carathéodory, Helly, and Tverberg Without Dimension.

Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai

Discret. Comput. Geom., 2020

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

Imre Bárány, Nabil H. Mustafa

Comput. Geom., 2020

2019

Theorems of Carathéodory, Helly, and Tverberg without dimension.

Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Tverberg Plus Minus.

Imre Bárány, Pablo Soberón

Discret. Comput. Geom., 2018

Pach's Selection Theorem Does Not Admit a Topological Extension.

Imre Bárány, Roy Meshulam, Eran Nevo, Martin Tancer

Discret. Comput. Geom., 2018

Acknowledgement of priority - A fractional Helly theorem for boxes.

Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Déborah Oliveros, Attila Pór

Comput. Geom., 2018

2017

Random points in halfspheres.

Imre Bárány, Daniel Hug, Matthias Reitzner, Rolf Schneider

Random Struct. Algorithms, 2017

Helge Tverberg is eighty: A personal tribute.

Imre Bárány

Eur. J. Comb., 2017

2015

Erdős-Szekeres Theorem for Lines.

Imre Bárány, Edgardo Roldán-Pensado, Géza Tóth

Discret. Comput. Geom., 2015

Topology of Geometric Joins.

Imre Bárány, Andreas F. Holmsen, Roman N. Karasev

Discret. Comput. Geom., 2015

A fractional Helly theorem for boxes.

Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Déborah Oliveros, Attila Pór

Comput. Geom., 2015

2014

Homogeneous selections from hyperplanes.

Imre Bárány, János Pach

J. Comb. Theory B, 2014

Colourful and Fractional (p, q)-theorems.

Imre Bárány, Ferenc Fodor, Luis Montejano, Déborah Oliveros, Attila Pór

Discret. Comput. Geom., 2014

Longest convex lattice chains.

Imre Bárány, Edgardo Roldán-Pensado

Comput. Geom., 2014

Curves in Rd intersecting every hyperplane at most d + 1 times.

Imre Bárány, Jirí Matousek, Attila Pór

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Tensors, colours, octahedra.

Imre Bárány

Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013

2013 unit vectors in the plane.

Imre Bárány, Boris D. Ginzburg, Victor S. Grinberg

Discret. Math., 2013

Holding Circles and Fixing Frames.

Imre Bárány, Tudor Zamfirescu

Discret. Comput. Geom., 2013

A Question from a Famous Paper of Erdős.

Imre Bárány, Edgardo Roldán-Pensado

Discret. Comput. Geom., 2013

Many Empty Triangles have a Common Edge.

Imre Bárány, Jean-François Marckert, Matthias Reitzner

Discret. Comput. Geom., 2013

Functions, Measures, and Equipartitioning Convex k-Fans.

Imre Bárány, Pavle V. M. Blagojevic, Aleksandra Dimitrijevic Blagojevic

Discret. Comput. Geom., 2013

On a forgotten conjecture from a famous paper of Erdös.

Imre Bárány, Edgardo Roldán-Pensado

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Notes About the Carathéodory Number.

Imre Bárány, Roman N. Karasev

Discret. Comput. Geom., 2012

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

Imre Bárány, Hiroshi Maehara, Norihide Tokushige

Comput. Geom., 2012

2011

Guest Editors' Foreword.

Imre Bárány, Luis Montejano, Déborah Oliveros

Discret. Comput. Geom., 2011

2010

On the variance of random polygons.

William L. Steiger, Imre Bárány

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Longest convex chains.

Gergely Ambrus, Imre Bárány

Random Struct. Algorithms, 2009

Very Colorful Theorems.

Jorge L. Arocha, Imre Bárány, Javier Bracho, Ruy Fabila Monroy, Luis Montejano

Discret. Comput. Geom., 2009

2008

Slicing Convex Sets and Measures by a Hyperplane.

Imre Bárány, Alfredo Hubard, Jesús Jerónimo

Discret. Comput. Geom., 2008

Paths with no Small Angles.

Imre Bárány, Attila Pór, Pavel Valtr

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Quadratically Many Colorful Simplices.

Imre Bárány, Jirí Matousek

SIAM J. Discret. Math., 2007

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

Imre Bárány

Random Struct. Algorithms, 2007

Foreword.

Imre Bárány, János Pach

Discret. Comput. Geom., 2007

Packing Cones and Their Negatives in Space.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2007

2006

Berge's theorem, fractional Helly, and art galleries.

Imre Bárány, Jirí Matousek

Discret. Math., 2006

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

Imre Bárány

Comb. Probab. Comput., 2006

2005

A note on the size of the largest ball inside a convex polytope.

Imre Bárány, Nandor Simányi

Period. Math. Hung., 2005

The Randomized Integer Convex Hull.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2005

Strictly convex drawings of planar graphs

Imre Bárány, Günter Rote

CoRR, 2005

Nash Equilibria in Random Games.

Imre Bárány, Santosh S. Vempala, Adrian Vetta

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

2004

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

Imre Bárány

Comb. Probab. Comput., 2004

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

Imre Bárány, Norihide Tokushige

Comb., 2004

2003

Total Curvature and Spiralling Shortest Paths.

Imre Bárány, Krystyna Trybulec Kuperberg, Tudor Zamfirescu

Discret. Comput. Geom., 2003

2002

Covering lattice points by subspaces.

Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos

Period. Math. Hung., 2002

Equipartition of Two Measures by a 4-Fan.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2002

2001

On the lattice diameter of a convex polygon.

Imre Bárány, Zoltán Füredi

Discret. Math., 2001

Simultaneous Partitions of Measures by <i>k</i>-Fans.

Imre Bárány, Jirí Matousek

Discret. Comput. Geom., 2001

2000

On the Number of Lattice Free Polytopes.

Imre Bárány, Jean-Michel Kantor

Eur. J. Comb., 2000

A Central Limit Theorem for Convex Chains in the Square.

Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang

Discret. Comput. Geom., 2000

Problems and Results around the Erdös-Szekeres Convex Polygon Theorem.

Imre Bárány, Gyula Károlyi

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998

Matrices with Identical Sets of Neighbors.

Imre Bárány, Herbert E. Scarf

Math. Oper. Res., 1998

A Positive Fraction Erdos - Szekeres Theorem.

Imre Bárány, Pavel Valtr

Discret. Comput. Geom., 1998

1997

Colourful Linear Programming and its Relatives.

Imre Bárány, Shmuel Onn

Math. Oper. Res., 1997

1996

Colourful Linear Programming.

Imre Bárány, Shmuel Onn

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

Guest Editor's Forword.

Imre Bárány, János Pach

Discret. Comput. Geom., 1995

The Limit Shape of Convex Lattice Polygons.

Imre Bárány

Discret. Comput. Geom., 1995

The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case.

Imre Bárány, Herbert E. Scarf, David Shallcross

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

On the Expected Number of k-Sets.

Imre Bárány, William L. Steiger

Discret. Comput. Geom., 1994

On the Exact Constant i the Quantitative Steinitz Theorem in the Plane.

Imre Bárány, Aladár Heppes

Discret. Comput. Geom., 1994

1993

Reflecting a triangle in the plane.

Imre Bárány, Peter Frankl, Hiroshi Maehara

Graphs Comb., 1993

The complex of maximal lattice free simplices.

Imre Bárány, Roger Howe, Herbert E. Scarf

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

Fair Distribution Protocols or How the Players Replace Fortune.

Imre Bárány

Math. Oper. Res., 1992

On the Number of Convex Lattice Polygons.

Imre Bárány, János Pach

Comb. Probab. Comput., 1992

Point Selections and Weak e-Nets for Convex Hulls.

Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman

Comb. Probab. Comput., 1992

On integer points in polyhedra: a lower bound.

Imre Bárány, Roger Howe, László Lovász

Comb., 1992

1991

On the Convex Hull of the Integer Points in a Disc.

Antal Balog, Imre Bárány

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

A Combinatorial Property of Points anf Ellipsoids.

Imre Bárány, David G. Larman

Discret. Comput. Geom., 1990

The Caratheodory number for the k-core.

Imre Bárány, Micha Sharir

Comb., 1990

Do Projections Go to Infinity?

Imre Bárány, Jacob E. Goodman, Richard Pollack

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

A Combinatorial Result About Points and Balls in Euclidean Space.

Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia

Discret. Comput. Geom., 1989

On the Number of Halving Planes.

Imre Bárány, Zoltán Füredi, László Lovász

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1987

Covering with Euclidean Boxes.

Imre Bárány, Jenö Lehel

Eur. J. Comb., 1987

Computing the Volume is Difficulte.

Imre Bárány, Zoltán Füredi

Discret. Comput. Geom., 1987

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

Imre Bárány

Comb., 1987

1986

Maximal volume enclosed by plates and proof of the chessboard conjecture.

Károly J. Böröczky, Imre Bárány, Endre Makai, János Pach

Discret. Math., 1986

Packing and covering a tree by subtrees.

Imre Bárány, Jack Edmonds, Laurence A. Wolsey

Comb., 1986

Computing the Volume Is Difficult

Imre Bárány, Zoltán Füredi

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

1983

Mental Poker with Three or More Players

Imre Bárány, Zoltán Füredi

Inf. Control., 1983

1982

A generalization of carathéodory's theorem.

Imre Bárány

Discret. Math., 1982

1981

A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees.

Imre Bárány

Math. Oper. Res., 1981

1980

Borsuk's theorem through complementary pivoting.

Imre Bárány

Math. Program., 1980

1979

On a Class of Balancing Games.

Imre Bárány

J. Comb. Theory A, 1979

1978

A Short Proof of Kneser's Conjecture.

Imre Bárány

J. Comb. Theory A, 1978