The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rom Pinchasi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:123-132 [Conf]
  2. János Pach, Rom Pinchasi, Micha Sharir
    A tight bound for the number of different directions in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:106-113 [Conf]
  3. János Pach, Rom Pinchasi, Micha Sharir
    Solution of Scott's problem on the number of directions determined by a point set in 3-space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:76-85 [Conf]
  4. Rom Pinchasi, Rados Radoicic
    Topological graphs with no self-intersecting cycle of lenth 4. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:98-103 [Conf]
  5. Rom Pinchasi, Rados Radoicic, Micha Sharir
    On empty convex polygons in a planar point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:391-400 [Conf]
  6. Rom Pinchasi, Shakhar Smorodinsky
    On locally Delaunay geometric graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:378-382 [Conf]
  7. Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
    There are not too many magic configurations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:142-149 [Conf]
  8. János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
    Geometric Graphs with No Self-intersecting Path of Length Three. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:295-311 [Conf]
  9. Rom Pinchasi
    On the Size of a Radial Set. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:233-245 [Conf]
  10. Rom Pinchasi, Micha Sharir
    On Graphs That Do Not Contain The Cube And Related Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:5, pp:615-623 [Journal]
  11. Noga Alon, H. Last, Rom Pinchasi, Micha Sharir
    On the Complexity of Arrangements of Circles in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:4, pp:465-492 [Journal]
  12. Daniel J. Kleitman, Rom Pinchasi
    A Note on Caterpillar-Embeddings with No Two Parallel Edges. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:223-229 [Journal]
  13. János Pach, Rom Pinchasi
    On the Number of Balanced Lines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:611-628 [Journal]
  14. Rom Pinchasi
    Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:607-624 [Journal]
  15. Rom Pinchasi
    Lines With Many Points On Both Sides. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:3, pp:415-435 [Journal]
  16. János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
    Geometric graphs with no self-intersecting path of length three. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:793-811 [Journal]
  17. János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
    Topological Graphs with No Large Grids. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:355-364 [Journal]
  18. Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:139-186 [Journal]
  19. Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
    Crossing patterns of semi-algebraic sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:111, n:2, pp:310-326 [Journal]
  20. Shmuel Onn, Rom Pinchasi
    A note on the minimum number of edge-directions of a convex polytope. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:107, n:1, pp:147-151 [Journal]
  21. János Pach, Rom Pinchasi
    Bichromatic Lines with Few Points. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:90, n:2, pp:326-335 [Journal]
  22. János Pach, Rom Pinchasi, Micha Sharir
    On the number of directions determined by a three-dimensional points set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:108, n:1, pp:1-16 [Journal]
  23. Rom Pinchasi, Rados Radoicic, Micha Sharir
    On empty convex polygons in a planar point set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:3, pp:385-419 [Journal]

  24. On s-intersecting curves and related problems. [Citation Graph (, )][DBLP]


  25. Halving lines and measure concentration in the plane. [Citation Graph (, )][DBLP]


  26. Points with large quadrant-depth. [Citation Graph (, )][DBLP]


  27. On Inducing Polygons and Related Problems. [Citation Graph (, )][DBLP]


  28. Crossings between Curves with Many Tangencies. [Citation Graph (, )][DBLP]


  29. Geometric graphs with no two parallel edges. [Citation Graph (, )][DBLP]


  30. On a problem about quadrant-depth. [Citation Graph (, )][DBLP]


  31. Projecting Difference Sets on the Positive Orthant. [Citation Graph (, )][DBLP]


  32. Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. [Citation Graph (, )][DBLP]


  33. At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. [Citation Graph (, )][DBLP]


  34. There Are Not Too Many Magic Configurations. [Citation Graph (, )][DBLP]


  35. An isoperimetric inequality in the universal cover of the punctured plane. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.031secs
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