default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDImre Bárány
Person information
- affiliation: Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics, Budapest, Hungary
- affiliation: University College London, Department of Mathematics, London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j78]Imre Bárány
, Attila Pór:
Orientation Preserving Maps of the Square Grid II. Discret. Comput. Geom. 72(2): 569-602 (2024)- 2023
- [j77]Imre Bárány, Gil Kalai, Attila Pór:
Erdős-Szekeres Theorem for k-Flats. Discret. Comput. Geom. 69(4): 1232-1240 (2023) - [j76]Gergely Ambrus, Imre Bárány, Peter Frankl, Dániel Varga:
Piercing the Chessboard. SIAM J. Discret. Math. 37(3): 1457-1471 (2023) - 2021
- [j75]Imre Bárány, Attila Pór, Pavel Valtr:
Orientation preserving maps of the n × n grid. J. Comput. Geom. 13(2): 73-89 (2021) - [j74]Imre Bárány, Peter Frankl:
How (Not) to Cut Your Cheese. Am. Math. Mon. 128(6): 543-552 (2021) - [c16]Imre Bárány, Attila Pór, Pavel Valtr:
Orientation Preserving Maps of the Square Grid. SoCG 2021: 14:1-14:12 - 2020
- [j73]Imre Bárány, Nabil H. Mustafa:
An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets. Comput. Geom. 90: 101649 (2020) - [j72]Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa, Tamás Terpai:
Theorems of Carathéodory, Helly, and Tverberg Without Dimension. Discret. Comput. Geom. 64(2): 233-258 (2020)
2010 – 2019
- 2019
- [c15]Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa:
Theorems of Carathéodory, Helly, and Tverberg without dimension. SODA 2019: 2350-2360 - 2018
- [j71]Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Deborah Oliveros, Attila Pór:
Acknowledgement of priority - A fractional Helly theorem for boxes. Comput. Geom. 67: 1 (2018) - [j70]Imre Bárány, Roy Meshulam, Eran Nevo, Martin Tancer:
Pach's Selection Theorem Does Not Admit a Topological Extension. Discret. Comput. Geom. 60(2): 420-429 (2018) - [j69]Imre Bárány, Pablo Soberón:
Tverberg Plus Minus. Discret. Comput. Geom. 60(3): 588-598 (2018) - [i2]Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa:
Theorems of Carathéodory, Helly, and Tverberg without dimension. CoRR abs/1806.08725 (2018) - 2017
- [j68]Imre Bárány:
Helge Tverberg is eighty: A personal tribute. Eur. J. Comb. 66: 24-27 (2017) - [j67]Imre Bárány, Daniel Hug, Matthias Reitzner, Rolf Schneider:
Random points in halfspheres. Random Struct. Algorithms 50(1): 3-22 (2017) - 2015
- [j66]Imre Bárány, Ferenc Fodor, Álvaro Martínez-Pérez, Luis Montejano, Deborah Oliveros, Attila Pór:
A fractional Helly theorem for boxes. Comput. Geom. 48(3): 221-224 (2015) - [j65]Imre Bárány, Andreas F. Holmsen, Roman N. Karasev:
Topology of Geometric Joins. Discret. Comput. Geom. 53(2): 402-413 (2015) - [j64]Imre Bárány, Edgardo Roldán-Pensado, Géza Tóth:
Erdős-Szekeres Theorem for Lines. Discret. Comput. Geom. 54(3): 669-685 (2015) - 2014
- [j63]Imre Bárány, Edgardo Roldán-Pensado:
Longest convex lattice chains. Comput. Geom. 47(3): 367-376 (2014) - [j62]Imre Bárány, Ferenc Fodor, Luis Montejano, Deborah Oliveros, Attila Pór:
Colourful and Fractional (p, q)-theorems. Discret. Comput. Geom. 51(3): 628-642 (2014) - [j61]Imre Bárány, János Pach:
Homogeneous selections from hyperplanes. J. Comb. Theory B 104: 81-87 (2014) - [c14]Imre Bárány, Jirí Matousek, Attila Pór:
Curves in Rd intersecting every hyperplane at most d + 1 times. SoCG 2014: 565 - [p1]Imre Bárány:
Tensors, colours, octahedra. Geometry, Structure and Randomness in Combinatorics 2014: 1-17 - 2013
- [j60]Imre Bárány, William L. Steiger:
On the variance of random polygons. Comput. Geom. 46(2): 173-180 (2013) - [j59]Imre Bárány, Pavle V. M. Blagojevic, Aleksandra Dimitrijevic Blagojevic:
Functions, Measures, and Equipartitioning Convex k-Fans. Discret. Comput. Geom. 49(2): 382-401 (2013) - [j58]Imre Bárány, Jean-François Marckert, Matthias Reitzner:
Many Empty Triangles have a Common Edge. Discret. Comput. Geom. 50(1): 244-252 (2013) - [j57]Imre Bárány, Edgardo Roldán-Pensado:
A Question from a Famous Paper of Erdős. Discret. Comput. Geom. 50(1): 253-261 (2013) - [j56]Imre Bárány, Tudor Zamfirescu:
Holding Circles and Fixing Frames. Discret. Comput. Geom. 50(4): 1101-1111 (2013) - [j55]Imre Bárány, Boris D. Ginzburg, Victor S. Grinberg:
2013 unit vectors in the plane. Discret. Math. 313(15): 1600-1601 (2013) - [c13]Imre Bárány, Edgardo Roldán-Pensado:
On a forgotten conjecture from a famous paper of Erdös. SoCG 2013: 77-80 - 2012
- [j54]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) - [j53]Imre Bárány, Roman N. Karasev:
Notes About the Carathéodory Number. Discret. Comput. Geom. 48(3): 783-792 (2012) - 2011
- [j52]Imre Bárány, Luis Montejano, Deborah Oliveros:
Guest Editors' Foreword. Discret. Comput. Geom. 45(2): 221-222 (2011) - 2010
- [c12]William L. Steiger, Imre Bárány:
On the variance of random polygons. CCCG 2010: 211-214
2000 – 2009
- 2009
- [j51]Jorge L. Arocha, Imre Bárány, Javier Bracho, Ruy Fabila Monroy, Luis Montejano:
Very Colorful Theorems. Discret. Comput. Geom. 42(2): 142-154 (2009) - [j50]Gergely Ambrus, Imre Bárány:
Longest convex chains. Random Struct. Algorithms 35(2): 137-162 (2009) - [j49]Imre Bárány, Attila Pór, Pavel Valtr:
Paths with No Small Angles. SIAM J. Discret. Math. 23(4): 1655-1666 (2009) - 2008
- [j48]Imre Bárány, Alfredo Hubard, Jesús Jerónimo:
Slicing Convex Sets and Measures by a Hyperplane. Discret. Comput. Geom. 39(1-3): 67-75 (2008) - [c11]Imre Bárány, Attila Pór, Pavel Valtr:
Paths with no Small Angles. LATIN 2008: 654-663 - 2007
- [j47]Imre Bárány, János Pach:
Foreword. Discret. Comput. Geom. 38(2): 175-176 (2007) - [j46]Imre Bárány, Jirí Matousek:
Packing Cones and Their Negatives in Space. Discret. Comput. Geom. 38(2): 177-187 (2007) - [j45]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) - [j44]Imre Bárány, Santosh S. Vempala, Adrian Vetta:
Nash equilibria in random games. Random Struct. Algorithms 31(4): 391-405 (2007) - [j43]Imre Bárány, Jirí Matousek:
Quadratically Many Colorful Simplices. SIAM J. Discret. Math. 21(1): 191-198 (2007) - 2006
- [j42]Imre Bárány:
Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004. Comb. Probab. Comput. 15(6): 941-942 (2006) - [j41]Imre Bárány, Jirí Matousek:
Berge's theorem, fractional Helly, and art galleries. Discret. Math. 306(19-20): 2303-2313 (2006) - 2005
- [j40]Imre Bárány, Jirí Matousek:
The Randomized Integer Convex Hull. Discret. Comput. Geom. 33(1): 3-25 (2005) - [j39]Imre Bárány, Nandor Simányi:
A note on the size of the largest ball inside a convex polytope. Period. Math. Hung. 51(2): 15-18 (2005) - [c10]Imre Bárány, Santosh S. 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
- [j38]Imre Bárány, Norihide Tokushige:
The Minimum Area of Convex Lattice n-Gons. Comb. 24(2): 171-185 (2004) - [j37]Imre Bárány:
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp. Comb. Probab. Comput. 13(2): 280-282 (2004) - 2003
- [j36]Imre Bárány, Krystyna Trybulec Kuperberg, Tudor Zamfirescu:
Total Curvature and Spiralling Shortest Paths. Discret. Comput. Geom. 30(2): 167-176 (2003) - 2002
- [j35]Imre Bárány, Jirí Matousek:
Equipartition of Two Measures by a 4-Fan. Discret. Comput. Geom. 27(3): 293-301 (2002) - [j34]Imre Bárány, Gergely Harcos, János Pach, Gábor Tardos:
Covering lattice points by subspaces. Period. Math. Hung. 43(1-2): 93-103 (2002) - 2001
- [j33]Imre Bárány, Jirí Matousek:
Simultaneous Partitions of Measures by k-Fans. Discret. Comput. Geom. 25(3): 317-334 (2001) - [j32]Imre Bárány, Zoltán Füredi:
On the lattice diameter of a convex polygon. Discret. Math. 241(1-3): 41-50 (2001) - 2000
- [j31]Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang:
A Central Limit Theorem for Convex Chains in the Square. Discret. Comput. Geom. 23(1): 35-50 (2000) - [j30]Imre Bárány, Jean-Michel Kantor:
On the Number of Lattice Free Polytopes. Eur. J. Comb. 21(1): 103-110 (2000) - [c9]Imre Bárány, Gyula Károlyi:
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem. JCDCG 2000: 91-105
1990 – 1999
- 1998
- [j29]Imre Bárány, Pavel Valtr:
A Positive Fraction Erdos - Szekeres Theorem. Discret. Comput. Geom. 19(3): 335-342 (1998) - [j28]Imre Bárány, Herbert E. Scarf:
Matrices with Identical Sets of Neighbors. Math. Oper. Res. 23(4): 863-873 (1998) - [j27]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) - 1997
- [j26]Imre Bárány, Shmuel Onn:
Colourful Linear Programming and its Relatives. Math. Oper. Res. 22(3): 550-567 (1997) - 1996
- [c8]Imre Bárány, Shmuel Onn:
Colourful Linear Programming. IPCO 1996: 1-15 - 1995
- [j25]Imre Bárány, János Pach:
Guest Editor's Forword. Discret. Comput. Geom. 13: 243-244 (1995) - [j24]Imre Bárány:
The Limit Shape of Convex Lattice Polygons. Discret. Comput. Geom. 13: 279-295 (1995) - [c7]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
- [j23]Imre Bárány, William L. Steiger:
On the Expected Number of k-Sets. Discret. Comput. Geom. 11: 243-263 (1994) - [j22]Imre Bárány, Aladár Heppes:
On the Exact Constant i the Quantitative Steinitz Theorem in the Plane. Discret. Comput. Geom. 12: 387-398 (1994) - [j21]Imre Bárány, Roger Howe, Herbert E. Scarf:
The complex of maximal lattice free simplices. Math. Program. 66: 273-281 (1994) - 1993
- [j20]Imre Bárány, Peter Frankl, Hiroshi Maehara:
Reflecting a triangle in the plane. Graphs Comb. 9(2-4): 97-104 (1993) - [c6]Imre Bárány, Roger Howe, Herbert E. Scarf:
The complex of maximal lattice free simplices. IPCO 1993: 1-9 - 1992
- [j19]Imre Bárány, Roger Howe, László Lovász:
On integer points in polyhedra: a lower bound. Comb. 12(2): 135-142 (1992) - [j18]Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman:
Point Selections and Weak e-Nets for Convex Hulls. Comb. Probab. Comput. 1: 189-200 (1992) - [j17]Imre Bárány, János Pach:
On the Number of Convex Lattice Polygons. Comb. Probab. Comput. 1: 295-302 (1992) - [j16]Imre Bárány:
Fair Distribution Protocols or How the Players Replace Fortune. Math. Oper. Res. 17(2): 327-340 (1992) - 1991
- [c5]Antal Balog, Imre Bárány:
On the Convex Hull of the Integer Points in a Disc. SCG 1991: 162-165 - 1990
- [j15]Imre Bárány, Zoltán Füredi, László Lovász:
On the number of halving planes. Comb. 10(2): 175-183 (1990) - [j14]Imre Bárány, Micha Sharir:
The Caratheodory number for the k-core. Comb. 10(2): 185-194 (1990) - [j13]Imre Bárány, David G. Larman:
A Combinatorial Property of Points anf Ellipsoids. Discret. Comput. Geom. 5: 375-382 (1990) - [c4]Antal Balog, Imre Bárány:
On the Convex Hull of the Integer Points in a Disc. Discrete and Computational Geometry 1990: 39-44 - [c3]Imre Bárány, Jacob E. Goodman, Richard Pollack:
Do Projections Go to Infinity? Applied Geometry And Discrete Mathematics 1990: 51-62
1980 – 1989
- 1989
- [j12]Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space. Discret. Comput. Geom. 4: 259-262 (1989) - [c2]Imre Bárány, Zoltán Füredi, László Lovász:
On the Number of Halving Planes. SCG 1989: 140-144 - 1987
- [j11]Imre Bárány:
An extension of the Erdös - Szekeres theorem on large angles. Comb. 7(2): 161-169 (1987) - [j10]Imre Bárány, Zoltán Füredi:
Computing the Volume is Difficulte. Discret. Comput. Geom. 2: 319-326 (1987) - [j9]Imre Bárány, Jenö Lehel:
Covering with Euclidean Boxes. Eur. J. Comb. 8(2): 113-119 (1987) - 1986
- [j8]Imre Bárány, Jack Edmonds, Laurence A. Wolsey:
Packing and covering a tree by subtrees. Comb. 6(3): 221-233 (1986) - [j7]Károly J. Böröczky, Imre Bárány, Endre Makai, János Pach:
Maximal volume enclosed by plates and proof of the chessboard conjecture. Discret. Math. 60: 101-120 (1986) - [c1]Imre Bárány, Zoltán Füredi:
Computing the Volume Is Difficult. STOC 1986: 442-447 - 1983
- [j6]Imre Bárány, Zoltán Füredi:
Mental Poker with Three or More Players. Inf. Control. 59(1-3): 84-93 (1983) - 1982
- [j5]Imre Bárány:
A generalization of carathéodory's theorem. Discret. Math. 40(2-3): 141-152 (1982) - 1981
- [j4]Imre Bárány:
A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees. Math. Oper. Res. 6(3): 445-452 (1981) - 1980
- [j3]Imre Bárány:
Borsuk's theorem through complementary pivoting. Math. Program. 18(1): 84-88 (1980)
1970 – 1979
- 1979
- [j2]Imre Bárány:
On a Class of Balancing Games. J. Comb. Theory A 26(2): 115-126 (1979) - 1978
- [j1]Imre Bárány:
A Short Proof of Kneser's Conjecture. J. Comb. Theory A 25(3): 325-326 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
