dblp.uni-trier.dewww.uni-trier.de

Rom Pinchasi

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
33EESarit Buzaglo, Ron Holzman, Rom Pinchasi: On s-intersecting curves and related problems. Symposium on Computational Geometry 2008: 79-84
32EERom Pinchasi: Geometric graphs with no two parallel edges. Combinatorica 28(1): 127-130 (2008)
31EERon Holzman, Vsevolod F. Lev, Rom Pinchasi: Projecting Difference Sets on the Positive Orthant. Combinatorics, Probability & Computing 17(5): 681-688 (2008)
30EEEyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There Are Not Too Many Magic Configurations. Discrete & Computational Geometry 39(1-3): 3-16 (2008)
29EENoga Alon, Adi Pinchasi, Rom Pinchasi: An isoperimetric inequality in the universal cover of the punctured plane. Discrete Mathematics 308(23): 5691-5701 (2008)
28EERom Pinchasi: The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane. SIAM J. Discrete Math. 22(2): 828-831 (2008)
2007
27EEEyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There are not too many magic configurations. Symposium on Computational Geometry 2007: 142-149
26EEHagit Last, Rom Pinchasi: At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. Discrete & Computational Geometry 38(2): 321-354 (2007)
25EEJános Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. Discrete & Computational Geometry 38(2): 399-441 (2007)
24EERom Pinchasi: Linear algebra approach to geometric graphs. J. Comb. Theory, Ser. A 114(8): 1363-1374 (2007)
23EEMicha A. Perles, Rom Pinchasi: Forbidden k-Sets in the Plane. SIAM J. Discrete Math. 21(2): 385-395 (2007)
2006
22EERom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. J. Comb. Theory, Ser. A 113(3): 385-419 (2006)
2005
21EERom Pinchasi, Micha Sharir: On Graphs That Do Not Contain The Cube And Related Problems. Combinatorica 25(5): 615-623 (2005)
20EEDaniel J. Kleitman, Rom Pinchasi: A Note on Caterpillar-Embeddings with No Two Parallel Edges. Discrete & Computational Geometry 33(2): 223-229 (2005)
19EEJános Pach, Rom Pinchasi, Micha Sharir, Géza Tóth: Topological Graphs with No Large Grids. Graphs and Combinatorics 21(3): 355-364 (2005)
18EENoga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir: Crossing patterns of semi-algebraic sets. J. Comb. Theory, Ser. A 111(2): 310-326 (2005)
2004
17EERom Pinchasi, Shakhar Smorodinsky: On locally Delaunay geometric graphs. Symposium on Computational Geometry 2004: 378-382
16EERom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. Symposium on Computational Geometry 2004: 391-400
15EEJános Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's problem on the number of directions determined by a point set in 3-space. Symposium on Computational Geometry 2004: 76-85
14EEJános Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth: Geometric graphs with no self-intersecting path of length three. Eur. J. Comb. 25(6): 793-811 (2004)
13EEPankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. J. ACM 51(2): 139-186 (2004)
12EEShmuel Onn, Rom Pinchasi: A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory, Ser. A 107(1): 147-151 (2004)
11EEJános Pach, Rom Pinchasi, Micha Sharir: On the number of directions determined by a three-dimensional points set. J. Comb. Theory, Ser. A 108(1): 1-16 (2004)
2003
10EEJános Pach, Rom Pinchasi, Micha Sharir: A tight bound for the number of different directions in three dimensions. Symposium on Computational Geometry 2003: 106-113
9EERom Pinchasi, Rados Radoicic: Topological graphs with no self-intersecting cycle of lenth 4. Symposium on Computational Geometry 2003: 98-103
8EERom Pinchasi: Lines With Many Points On Both Sides. Discrete & Computational Geometry 30(3): 415-435 (2003)
2002
7EEJános Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth: Geometric Graphs with No Self-intersecting Path of Length Three. Graph Drawing 2002: 295-311
6EERom Pinchasi: On the Size of a Radial Set. JCDCG 2002: 233-245
5EEEran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. Symposium on Computational Geometry 2002: 123-132
4EERom Pinchasi: Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. Discrete & Computational Geometry 28(4): 607-624 (2002)
2001
3EEJános Pach, Rom Pinchasi: On the Number of Balanced Lines. Discrete & Computational Geometry 25(4): 611-628 (2001)
2EENoga Alon, Hagit Last, Rom Pinchasi, Micha Sharir: On the Complexity of Arrangements of Circles in the Plane. Discrete & Computational Geometry 26(4): 465-492 (2001)
2000
1EEJános Pach, Rom Pinchasi: Bichromatic Lines with Few Points. J. Comb. Theory, Ser. A 90(2): 326-335 (2000)

Coauthor Index

1Eyal Ackerman [27] [30]
2Pankaj K. Agarwal [13]
3Noga Alon [2] [18] [29]
4Kevin Buchin [27] [30]
5Sarit Buzaglo [33]
6Ron Holzman [31] [33]
7Daniel J. Kleitman [20]
8Christian Knauer [27] [30]
9Hagit Last [2] [26]
10Vsevolod F. Lev [31]
11Eran Nevo [5] [13]
12Shmuel Onn [12]
13János Pach [1] [3] [5] [7] [10] [11] [13] [14] [15] [18] [19] [25]
14Micha A. Perles [23]
15Adi Pinchasi [29]
16Rados Radoicic [9] [16] [18] [22]
17Günter Rote [27] [30]
18Micha Sharir [2] [5] [10] [11] [13] [15] [16] [18] [19] [21] [22] [25]
19Shakhar Smorodinsky [5] [13] [17]
20Gábor Tardos [7] [14]
21Géza Tóth [7] [14] [19]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)