Imre Bárány

97 papers A* 6B 4Journal 80Unranked 6
YearRankTypeTitle / Venue / Authors
2024 J jnl
Orientation Preserving Maps of the Square Grid II.
Discret. Comput. Geom.
Imre Bárány, Attila Pór
2023 J jnl
Erdős-Szekeres Theorem for k-Flats.
Discret. Comput. Geom.
Imre Bárány, Gil Kalai, Attila Pór
2023 J jnl
Piercing the Chessboard.
SIAM J. Discret. Math.
Gergely Ambrus, Imre Bárány, Peter Frankl, Dániel Varga
2021 J jnl
How (Not) to Cut Your Cheese.
Am. Math. Mon.
Imre Bárány, Peter Frankl
2021 A* conf
Orientation Preserving Maps of the Square Grid.
SoCG
Imre Bárány, Attila Pór, Pavel Valtr
2021 J jnl
Orientation preserving maps of the n × n grid.
J. Comput. Geom.
Imre Bárány, Attila Pór, Pavel Valtr
2020 J jnl
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets.
Comput. Geom.
Imre Bárány, Nabil H. Mustafa
2020 J jnl
Theorems of Carathéodory, Helly, and Tverberg Without Dimension.
Discret. Comput. Geom.
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai
2019 A* conf
Theorems of Carathéodory, Helly, and Tverberg without dimension.
SODA
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa
2018 J jnl
Acknowledgement of priority - A fractional Helly theorem for boxes.
Comput. Geom.
Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Déborah Oliveros, Attila Pór
2018 J jnl
Pach's Selection Theorem Does Not Admit a Topological Extension.
Discret. Comput. Geom.
Imre Bárány, Roy Meshulam, Eran Nevo, Martin Tancer
2018 J jnl
Theorems of Carathéodory, Helly, and Tverberg without dimension.
CoRR
Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa
2018 J jnl
Tverberg Plus Minus.
Discret. Comput. Geom.
Imre Bárány, Pablo Soberón
2017 J jnl
Helge Tverberg is eighty: A personal tribute.
Eur. J. Comb.
Imre Bárány
2017 J jnl
Random points in halfspheres.
Random Struct. Algorithms
Imre Bárány, Daniel Hug, Matthias Reitzner, Rolf Schneider
2015 J jnl
A fractional Helly theorem for boxes.
Comput. Geom.
Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Déborah Oliveros, Attila Pór
2015 J jnl
Erdős-Szekeres Theorem for Lines.
Discret. Comput. Geom.
Imre Bárány, Edgardo Roldán-Pensado, Géza Tóth
2015 J jnl
Topology of Geometric Joins.
Discret. Comput. Geom.
Imre Bárány, Andreas F. Holmsen, Roman N. Karasev
2014 J jnl
Colourful and Fractional (p, q)-theorems.
Discret. Comput. Geom.
Imre Bárány, Ferenc Fodor, Luis Montejano, Déborah Oliveros, Attila Pór
2014 A* conf
Curves in Rd intersecting every hyperplane at most d + 1 times.
SoCG
Imre Bárány, Jirí Matousek, Attila Pór
2014 J jnl
Homogeneous selections from hyperplanes.
J. Comb. Theory B
Imre Bárány, János Pach
2014 J jnl
Longest convex lattice chains.
Comput. Geom.
Imre Bárány, Edgardo Roldán-Pensado
2014 — ch.
Tensors, colours, octahedra.
Geometry, Structure and Randomness in Combinatorics
Imre Bárány
2013 J jnl
2013 unit vectors in the plane.
Discret. Math.
Imre Bárány, Boris D. Ginzburg, Victor S. Grinberg
2013 J jnl
A Question from a Famous Paper of Erdős.
Discret. Comput. Geom.
Imre Bárány, Edgardo Roldán-Pensado
2013 J jnl
Functions, Measures, and Equipartitioning Convex k-Fans.
Discret. Comput. Geom.
Imre Bárány, Pavle V. M. Blagojevic, Aleksandra Dimitrijevic Blagojevic
2013 J jnl
Holding Circles and Fixing Frames.
Discret. Comput. Geom.
Imre Bárány, Tudor Zamfirescu
2013 J jnl
Many Empty Triangles have a Common Edge.
Discret. Comput. Geom.
Imre Bárány, Jean-François Marckert, Matthias Reitzner
2013 A* conf
On a forgotten conjecture from a famous paper of Erdös.
SoCG
Imre Bárány, Edgardo Roldán-Pensado
2013 J jnl
On the variance of random polygons.
Comput. Geom.
Imre Bárány, William L. Steiger
2012 J jnl
Notes About the Carathéodory Number.
Discret. Comput. Geom.
Imre Bárány, Roman N. Karasev
2012 J jnl
Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame.
Comput. Geom.
Imre Bárány, Hiroshi Maehara, Norihide Tokushige
2011 J jnl
Guest Editors' Foreword.
Discret. Comput. Geom.
Imre Bárány, Luis Montejano, Déborah Oliveros
2010 — conf
On the variance of random polygons.
CCCG
William L. Steiger, Imre Bárány
2009 J jnl
Longest convex chains.
Random Struct. Algorithms
Gergely Ambrus, Imre Bárány
2009 J jnl
Paths with No Small Angles.
SIAM J. Discret. Math.
Imre Bárány, Attila Pór, Pavel Valtr
2009 J jnl
Very Colorful Theorems.
Discret. Comput. Geom.
Jorge L. Arocha, Imre Bárány, Javier Bracho, Ruy Fabila-Monroy, Luis Montejano
2008 B conf
Paths with no Small Angles.
LATIN
Imre Bárány, Attila Pór, Pavel Valtr
2008 J jnl
Slicing Convex Sets and Measures by a Hyperplane.
Discret. Comput. Geom.
Imre Bárány, Alfredo Hubard, Jesús Jerónimo
2007 J jnl
Foreword.
Discret. Comput. Geom.
Imre Bárány, János Pach
2007 J jnl
Nash equilibria in random games.
Random Struct. Algorithms
Imre Bárány, Santosh S. Vempala, Adrian Vetta
2007 J jnl
Packing Cones and Their Negatives in Space.
Discret. Comput. Geom.
Imre Bárány, Jirí Matousek
2007 J jnl
Quadratically Many Colorful Simplices.
SIAM J. Discret. Math.
Imre Bárány, Jirí Matousek
2007 J jnl
The chance that a convex body is lattice-point free: A relative of Buffon's needle problem.
Random Struct. Algorithms
Imre Bárány
2006 J jnl
Berge's theorem, fractional Helly, and art galleries.
Discret. Math.
Imre Bárány, Jirí Matousek
2006 J jnl
Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004.
Comb. Probab. Comput.
Imre Bárány
2005 J jnl
A note on the size of the largest ball inside a convex polytope.
Period. Math. Hung.
Imre Bárány, Nandor Simányi
2005 A* conf
Nash Equilibria in Random Games.
FOCS
Imre Bárány, Santosh S. Vempala, Adrian Vetta
2005 J jnl
Strictly convex drawings of planar graphs
CoRR
Imre Bárány, Günter Rote
2005 J jnl
The Randomized Integer Convex Hull.
Discret. Comput. Geom.
Imre Bárány, Jirí Matousek
2004 J jnl
The Minimum Area of Convex Lattice
Comb.
Imre Bárány, Norihide Tokushige
2004 J jnl
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp.
Comb. Probab. Comput.
Imre Bárány
2003 J jnl
Total Curvature and Spiralling Shortest Paths.
Discret. Comput. Geom.
Imre Bárány, Krystyna Trybulec Kuperberg, Tudor Zamfirescu
2002 J jnl
Covering lattice points by subspaces.
Period. Math. Hung.
Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos
2002 J jnl
Equipartition of Two Measures by a 4-Fan.
Discret. Comput. Geom.
Imre Bárány, Jirí Matousek
2001 J jnl
On the lattice diameter of a convex polygon.
Discret. Math.
Imre Bárány, Zoltán Füredi
2001 J jnl
Simultaneous Partitions of Measures by
Discret. Comput. Geom.
Imre Bárány, Jirí Matousek
2000 J jnl
A Central Limit Theorem for Convex Chains in the Square.
Discret. Comput. Geom.
Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang
2000 J jnl
On the Number of Lattice Free Polytopes.
Eur. J. Comb.
Imre Bárány, Jean-Michel Kantor
2000 — conf
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem.
JCDCG
Imre Bárány, Gyula Károlyi
1998 J jnl
A Positive Fraction Erdos - Szekeres Theorem.
Discret. Comput. Geom.
Imre Bárány, Pavel Valtr
1998 J jnl
Matrices with Identical Sets of Neighbors.
Math. Oper. Res.
Imre Bárány, Herbert E. Scarf
1998 J jnl
The topological structure of maximal lattice free convex bodies: The general case.
Math. Program.
Imre Bárány, Herbert E. Scarf, David Shallcross
1997 J jnl
Colourful Linear Programming and its Relatives.
Math. Oper. Res.
Imre Bárány, Shmuel Onn
1996 B conf
Colourful Linear Programming.
IPCO
Imre Bárány, Shmuel Onn
1995 J jnl
Guest Editor's Forword.
Discret. Comput. Geom.
Imre Bárány, János Pach
1995 J jnl
The Limit Shape of Convex Lattice Polygons.
Discret. Comput. Geom.
Imre Bárány
1995 B conf
The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case.
IPCO
Imre Bárány, Herbert E. Scarf, David Shallcross
1994 J jnl
On the Exact Constant i the Quantitative Steinitz Theorem in the Plane.
Discret. Comput. Geom.
Imre Bárány, Aladár Heppes
1994 J jnl
On the Expected Number of k-Sets.
Discret. Comput. Geom.
Imre Bárány, William L. Steiger
1994 J jnl
The complex of maximal lattice free simplices.
Math. Program.
Imre Bárány, Roger Howe, Herbert E. Scarf
1993 J jnl
Reflecting a triangle in the plane.
Graphs Comb.
Imre Bárány, Peter Frankl, Hiroshi Maehara
1993 B conf
The complex of maximal lattice free simplices.
IPCO
Imre Bárány, Roger Howe, Herbert E. Scarf
1992 J jnl
Fair Distribution Protocols or How the Players Replace Fortune.
Math. Oper. Res.
Imre Bárány
1992 J jnl
On integer points in polyhedra: a lower bound.
Comb.
Imre Bárány, Roger Howe, László Lovász
1992 J jnl
On the Number of Convex Lattice Polygons.
Comb. Probab. Comput.
Imre Bárány, János Pach
1992 J jnl
Point Selections and Weak e-Nets for Convex Hulls.
Comb. Probab. Comput.
Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
1991 — conf
On the Convex Hull of the Integer Points in a Disc.
SCG
Antal Balog, Imre Bárány
1990 J jnl
A Combinatorial Property of Points anf Ellipsoids.
Discret. Comput. Geom.
Imre Bárány, David G. Larman
1990 — conf
Do Projections Go to Infinity?
Applied Geometry And Discrete Mathematics
Imre Bárány, Jacob E. Goodman, Richard Pollack
1990 — conf
On the Convex Hull of the Integer Points in a Disc.
Discrete and Computational Geometry
Antal Balog, Imre Bárány
1990 J jnl
On the number of halving planes.
Comb.
Imre Bárány, Zoltán Füredi, László Lovász
1990 J jnl
The Caratheodory number for the k-core.
Comb.
Imre Bárány, Micha Sharir
1989 J jnl
A Combinatorial Result About Points and Balls in Euclidean Space.
Discret. Comput. Geom.
Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia
1989 — conf
On the Number of Halving Planes.
SCG
Imre Bárány, Zoltán Füredi, László Lovász
1987 J jnl
An extension of the Erdös - Szekeres theorem on large angles.
Comb.
Imre Bárány
1987 J jnl
Computing the Volume is Difficulte.
Discret. Comput. Geom.
Imre Bárány, Zoltán Füredi
1987 J jnl
Covering with Euclidean Boxes.
Eur. J. Comb.
Imre Bárány, Jenö Lehel
1986 A* conf
Computing the Volume Is Difficult
STOC
Imre Bárány, Zoltán Füredi
1986 J jnl
Maximal volume enclosed by plates and proof of the chessboard conjecture.
Discret. Math.
Károly J. Böröczky, Imre Bárány, Endre Makai, János Pach
1986 J jnl
Packing and covering a tree by subtrees.
Comb.
Imre Bárány, Jack Edmonds, Laurence A. Wolsey
1983 J jnl
Mental Poker with Three or More Players
Inf. Control.
Imre Bárány, Zoltán Füredi
1982 J jnl
A generalization of carathéodory's theorem.
Discret. Math.
Imre Bárány
1981 J jnl
A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees.
Math. Oper. Res.
Imre Bárány
1980 J jnl
Borsuk's theorem through complementary pivoting.
Math. Program.
Imre Bárány
1979 J jnl
On a Class of Balancing Games.
J. Comb. Theory A
Imre Bárány
1978 J jnl
A Short Proof of Kneser's Conjecture.
J. Comb. Theory A
Imre Bárány