The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Imre Bárány: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Imre Bárány, Zoltán Füredi
    Computing the Volume Is Difficult [Citation Graph (1, 0)][DBLP]
    STOC, 1986, pp:442-447 [Conf]
  2. Antal Balog, Imre Bárány
    On the Convex Hull of the Integer Points in a Disc. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:162-165 [Conf]
  3. Imre Bárány, Zoltán Füredi, László Lovász
    On the Number of Halving Planes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:140-144 [Conf]
  4. Imre Bárány, Santosh Vempala, Adrian Vetta
    Nash Equilibria in Random Games. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:123-131 [Conf]
  5. Imre Bárány, Roger Howe, Herbert E. Scarf
    The complex of maximal lattice free simplices. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:1-9 [Conf]
  6. Imre Bárány, Shmuel Onn
    Colourful Linear Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:1-15 [Conf]
  7. Imre Bárány, Herbert E. Scarf, David Shallcross
    The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:244-251 [Conf]
  8. Imre Bárány, Gyula Károlyi
    Problems and Results around the Erdös-Szekeres Convex Polygon Theorem. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:91-105 [Conf]
  9. Imre Bárány
    An extension of the Erdös - Szekeres theorem on large angles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:2, pp:161-169 [Journal]
  10. Imre Bárány, Jack Edmonds, Laurence A. Wolsey
    Packing and covering a tree by subtrees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:3, pp:221-233 [Journal]
  11. Imre Bárány, Zoltán Füredi, László Lovász
    On the number of halving planes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:175-183 [Journal]
  12. Imre Bárány, Roger Howe, László Lovász
    On integer points in polyhedra: a lower bound. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:2, pp:135-142 [Journal]
  13. Imre Bárány, Micha Sharir
    The Caratheodory number for the k-core. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:185-194 [Journal]
  14. Imre Bárány, Norihide Tokushige
    The Minimum Area of Convex Lattice n-Gons. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:2, pp:171-185 [Journal]
  15. Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
    Point Selections and Weak e-Nets for Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:189-200 [Journal]
  16. Imre Bárány
    Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:2, pp:280-282 [Journal]
  17. Imre Bárány, János Pach
    On the Number of Convex Lattice Polygons. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:295-302 [Journal]
  18. Imre Bárány
    The Limit Shape of Convex Lattice Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:279-295 [Journal]
  19. Imre Bárány, Zoltán Füredi
    Computing the Volume is Difficulte. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:319-326 [Journal]
  20. Imre Bárány, Aladár Heppes
    On the Exact Constant i the Quantitative Steinitz Theorem in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:387-398 [Journal]
  21. Imre Bárány, Krystyna Kuperberg, Tudor Zamfirescu
    Total Curvature and Spiralling Shortest Paths. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:2, pp:167-176 [Journal]
  22. Imre Bárány, D. G. Larman
    A Combinatorial Property of Points anf Ellipsoids. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:375-382 [Journal]
  23. Imre Bárány, Jirí Matousek
    Simultaneous Partitions of Measures by k-Fans. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:3, pp:317-334 [Journal]
  24. Imre Bárány, Jirí Matousek
    Equipartition of Two Measures by a 4-Fan. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:3, pp:293-301 [Journal]
  25. Imre Bárány, Jirí Matousek
    The Randomized Integer Convex Hull. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:1, pp:3-25 [Journal]
  26. Imre Bárány, János Pach
    Guest Editor's Forword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:243-244 [Journal]
  27. Imre Bárány, Günter Rote, William L. Steiger, C.-H. Zhang
    A Central Limit Theorem for Convex Chains in the Square. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:1, pp:35-50 [Journal]
  28. Imre Bárány, William L. Steiger
    On the Expected Number of k-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:243-263 [Journal]
  29. Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia
    A Combinatorial Result About Points and Balls in Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:259-262 [Journal]
  30. Imre Bárány, Pavel Valtr
    A Positive Fraction Erdos - Szekeres Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:335-342 [Journal]
  31. Imre Bárány, Zoltán Füredi
    On the lattice diameter of a convex polygon. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:41-50 [Journal]
  32. Imre Bárány, Jirí Matousek
    Berge's theorem, fractional Helly, and art galleries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2303-2313 [Journal]
  33. Imre Bárány, Jean-Michel Kantor
    On the Number of Lattice Free Polytopes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:1, pp:103-110 [Journal]
  34. Imre Bárány, Zoltán Füredi
    Mental Poker with Three or More Players [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:59, n:1-3, pp:84-93 [Journal]
  35. Imre Bárány
    A Short Proof of Kneser's Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:3, pp:325-326 [Journal]
  36. Imre Bárány
    On a Class of Balancing Games. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:26, n:2, pp:115-126 [Journal]
  37. Imre Bárány, Herbert E. Scarf, David Shallcross
    The topological structure of maximal lattice free convex bodies: The general case. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:1-15 [Journal]
  38. Imre Bárány, Roger Howe, Herbert E. Scarf
    The complex of maximal lattice free simplices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:66, n:, pp:273-281 [Journal]
  39. Imre Bárány
    A generalization of carathéodory's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:40, n:2-3, pp:141-152 [Journal]
  40. Károly Böröczky, Imre Bárány, Endre Makai, János Pach
    Maximal volume enclosed by plates and proof of the chessboard conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:101-120 [Journal]

  41. On the variance of random polygons. [Citation Graph (, )][DBLP]


  42. Paths with no Small Angles. [Citation Graph (, )][DBLP]


  43. Strictly convex drawings of planar graphs [Citation Graph (, )][DBLP]


  44. Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, by Stefan Felsner, Vieweg Verlag, 2004. [Citation Graph (, )][DBLP]


  45. Packing Cones and Their Negatives in Space. [Citation Graph (, )][DBLP]


  46. Foreword. [Citation Graph (, )][DBLP]


  47. Slicing Convex Sets and Measures by a Hyperplane. [Citation Graph (, )][DBLP]


  48. Very Colorful Theorems. [Citation Graph (, )][DBLP]


Search in 0.134secs, Finished in 0.136secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002