default search action
Rom Pinchasi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j63]Rom Pinchasi:
A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane. Electron. J. Comb. 31(2) (2024) - [j62]Rom Pinchasi
, Oren Yerushalmi:
Covering the Edges of a Complete Geometric Graph with Convex Polygons. Discret. Comput. Geom. 72(2): 957-974 (2024) - [j61]Eyal Ackerman, Rom Pinchasi:
On partitions of two-dimensional discrete boxes. Discret. Math. 347(4): 113848 (2024) - [c17]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the Number of Digons in Arrangements of Pairwise Intersecting Circles. SoCG 2024: 3:1-3:14 - [i10]Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay:
On the number of digons in arrangements of pairwise intersecting circles. CoRR abs/2406.02276 (2024) - 2023
- [j60]Amir Carmel, Rom Pinchasi:
Some notes about the odd area of unit discs centered at points on a circle. Australas. J Comb. 87: 148-159 (2023) - [i9]Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi:
Integer points in the degree-sequence polytope. CoRR abs/2305.06732 (2023) - 2021
- [j59]Rom Pinchasi:
A theorem about vectors in $\mathbb{R}^2$ and an algebraic proof of a conjecture of Erdős and Purdy. Australas. J Comb. 81: 170-186 (2021) - [j58]Boris Aronov
On pseudo-disk hypergraphs. Comput. Geom. 92: 101687 (2021) - 2020
- [j57]Rom Pinchasi
A One-Page Solution of a Problem of Erdős and Purdy. Discret. Comput. Geom. 64(2): 382-385 (2020) - [j56]Chaya Keller
On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points. Discret. Comput. Geom. 64(3): 905-915 (2020) - [j55]Yaakov S. Kupitz, Hagit Last
Crossing matchings and circuits have maximal length. J. Graph Theory 94(1): 159-169 (2020)
2010 – 2019
- 2019
- [i8]Chaya Keller, Rom Pinchasi:
On sets of n points in general position that determine lines that can be pierced by n points. CoRR abs/1908.06390 (2019) - 2018
- [j54]Rom Pinchasi:
A Theorem on Unit Segments on the Real Line. Am. Math. Mon. 125(2): 164-168 (2018) - [i7]Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi:
On Pseudo-disk Hypergraphs. CoRR abs/1802.08799 (2018) - 2017
- [j53]Rom Pinchasi:
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane. Comb. 37(1): 99-125 (2017) - 2016
- [j52]Assaf Oren, Igor Pak, Rom Pinchasi:
On the Odd Area of Planar Sets. Discret. Comput. Geom. 55(3): 715-724 (2016) - [j51]Rom Pinchasi:
Crossing edges and faces of line arrangements in the plane. J. Comb. Optim. 31(2): 533-545 (2016) - 2015
- [j50]Rom Pinchasi:
A Note on Smaller Fractional Helly Numbers. Discret. Comput. Geom. 54(3): 663-668 (2015) - [c16]Guy Grebla, Alon Efrat
Data recovery after geographic correlated attacks. DRCN 2015: 65-72 - [c15]Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella:
Node-Balancing by Edge-Increments. ESA 2015: 450-458 - [i6]Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella:
Node-balancing by edge-increments. CoRR abs/1504.06919 (2015) - [i5]Shay Moran, Rom Pinchasi:
Matchings vs hitting sets among half-spaces in low dimensional euclidean spaces. CoRR abs/1507.02504 (2015) - 2014
- [j49]Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth:
A Note on Coloring Line Arrangements. Electron. J. Comb. 21(2): 2 (2014) - [j48]Amit Ophir, Rom Pinchasi:
Nearly equal distances in metric spaces. Discret. Appl. Math. 174: 122-127 (2014) - [j47]Eyal Ackerman, Noa Nitzan, Rom Pinchasi:
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. Graphs Comb. 30(5): 1065-1072 (2014) - [j46]Shoni Gilboa, Rom Pinchasi:
On the Union of Arithmetic Progressions. SIAM J. Discret. Math. 28(3): 1062-1073 (2014) - [j45]Rom Pinchasi:
A Finite Family of Pseudodiscs Must Include a "Small" Pseudodisc. SIAM J. Discret. Math. 28(4): 1930-1934 (2014) - [j44]Rom Pinchasi:
Points Covered an Odd Number of Times by Translates. Am. Math. Mon. 121(7): 632-636 (2014) - 2013
- [j43]Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir:
On the Union Complexity of Diametral Disks. Electron. J. Comb. 20(2): 53 (2013) - [j42]Eyal Ackerman, Tsachik Gelander
Ice-creams and wedge graphs. Comput. Geom. 46(3): 213-218 (2013) - [j41]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On inducing polygons and related problems. Comput. Geom. 46(7): 861-878 (2013) - [j40]Eyal Ackerman, Rom Pinchasi:
On the Degenerate Crossing Number. Discret. Comput. Geom. 49(3): 695-702 (2013) - [j39]Eyal Ackerman, Jacob Fox, Rom Pinchasi:
A note on light geometric graphs. Discret. Math. 313(11): 1281-1283 (2013) - [j38]Rom Pinchasi:
Crossing by lines all edges of a line arrangement. Discret. Math. 313(21): 2456-2462 (2013) - [j37]Eyal Ackerman, Rom Pinchasi:
Covering a chessboard with staircase walks. Discret. Math. 313(22): 2547-2551 (2013) - [j36]Eyal Ackerman, Rom Pinchasi:
On coloring points with respect to rectangles. J. Comb. Theory A 120(4): 811-815 (2013) - [j35]Gabriel Nivasch
The number of distinct distances from a vertex of a convex polygon. J. Comput. Geom. 4(1): 1-12 (2013) - [i4]Piotr Micek, Rom Pinchasi:
On the number of edges in families of pseudo-discs. CoRR abs/1312.1678 (2013) - 2012
- [j34]Eyal Ackerman, Rom Pinchasi:
On the light side of geometric graphs. Discret. Math. 312(6): 1213-1217 (2012) - [j33]Igor Pak, Rom Pinchasi:
Collapsing Walls Theorem. Am. Math. Mon. 119(2): 156-160 (2012) - [i3]Eyal Ackerman, Rom Pinchasi:
A note on coloring line arrangements. CoRR abs/1207.0080 (2012) - [i2]Gabriel Nivasch, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. CoRR abs/1207.1266 (2012) - 2011
- [j32]Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster
On graphs and algebraic graphs that do not contain cycles of length 4. J. Graph Theory 68(2): 91-102 (2011) - [j31]Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv:
Points with Large Quadrant Depth. J. Comput. Geom. 2(1): 128-143 (2011) - [j30]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon. Am. Math. Mon. 118(2): 164-167 (2011) - [j29]Sascha Kurz, Rom Pinchasi:
Regular Matchstick Graphs. Am. Math. Mon. 118(3): 264-267 (2011) - [i1]Eyal Ackerman, Tsachik Gelander, Rom Pinchasi:
Ice-Creams and Wedge Graphs. CoRR abs/1106.0855 (2011) - 2010
- [j28]Itay Ben-Dan, Rom Pinchasi, Ran Ziv:
On a problem about quadrant-depth. Comput. Geom. 43(6-7): 587-592 (2010) - [j27]Rom Pinchasi, Allan Pinkus:
Dominating Subsets under Projections. SIAM J. Discret. Math. 24(3): 910-920 (2010) - [c14]Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow:
Points with large quadrant-depth. SCG 2010: 358-364 - [c13]Jacob Fox, Fabrizio Frati
Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8
2000 – 2009
- 2009
- [j26]Itay Ben-Dan, Rom Pinchasi, Ran Ziv:
Points with large alpha-depth. J. Comb. Theory A 116(3): 747-755 (2009) - [c12]Rom Pinchasi:
Halving lines and measure concentration in the plane. SCG 2009: 141-147 - [c11]Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On Inducing Polygons and Related Problems. ESA 2009: 47-58 - 2008
- [j25]Rom Pinchasi:
Geometric graphs with no two parallel edges. Comb. 28(1): 127-130 (2008) - [j24]Ron Holzman, Vsevolod F. Lev, Rom Pinchasi:
Projecting Difference Sets on the Positive Orthant. Comb. Probab. Comput. 17(5): 681-688 (2008) - [j23]Eyal Ackerman, Kevin Buchin
There Are Not Too Many Magic Configurations. Discret. Comput. Geom. 39(1-3): 3-16 (2008) - [j22]Noga Alon, Adi Pinchasi, Rom Pinchasi:
An isoperimetric inequality in the universal cover of the punctured plane. Discret. Math. 308(23): 5691-5701 (2008) - [j21]Amitai Perlstein, Rom Pinchasi:
Generalized Thrackles and Geometric Graphs in \mathbbR3{\mathbb{R}}^3 with No Pair of Strongly Avoiding Edges. Graphs Comb. 24(4): 373-389 (2008) - [j20]Rom Pinchasi:
The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane. SIAM J. Discret. Math. 22(2): 828-831 (2008) - [c10]Sarit Buzaglo, Ron Holzman, Rom Pinchasi:
On s-intersecting curves and related problems. SCG 2008: 79-84 - 2007
- [j19]Hagit Last, Rom Pinchasi:
At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. Discret. Comput. Geom. 38(2): 321-354 (2007) - [j18]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. Discret. Comput. Geom. 38(2): 399-441 (2007) - [j17]Rom Pinchasi:
Linear algebra approach to geometric graphs. J. Comb. Theory A 114(8): 1363-1374 (2007) - [j16]Micha A. Perles, Rom Pinchasi:
Forbidden k-Sets in the Plane. SIAM J. Discret. Math. 21(2): 385-395 (2007) - [c9]Eyal Ackerman, Kevin Buchin
There are not too many magic configurations. SCG 2007: 142-149 - 2006
- [j15]Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. J. Comb. Theory A 113(3): 385-419 (2006) - 2005
- [j14]Rom Pinchasi, Micha Sharir:
On Graphs That Do Not Contain The Cube And Related Problems. Comb. 25(5): 615-623 (2005) - [j13]Daniel J. Kleitman, Rom Pinchasi:
A Note on Caterpillar-Embeddings with No Two Parallel Edges. Discret. Comput. Geom. 33(2): 223-229 (2005) - [j12]János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth:
Topological Graphs with No Large Grids. Graphs Comb. 21(3): 355-364 (2005) - [j11]Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir:
Crossing patterns of semi-algebraic sets. J. Comb. Theory A 111(2): 310-326 (2005) - 2004
- [j10]János Pach, Rom Pinchasi, Gábor Tardos
Geometric graphs with no self-intersecting path of length three. Eur. J. Comb. 25(6): 793-811 (2004) - [j9]Pankaj 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) - [j8]Shmuel Onn
A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory A 107(1): 147-151 (2004) - [j7]János Pach, Rom Pinchasi, Micha Sharir:
On the number of directions determined by a three-dimensional points set. J. Comb. Theory A 108(1): 1-16 (2004) - [c8]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. SCG 2004: 76-85 - [c7]Rom Pinchasi, Shakhar Smorodinsky
On locally Delaunay geometric graphs. SCG 2004: 378-382 - [c6]Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. SCG 2004: 391-400 - 2003
- [j6]Rom Pinchasi:
Lines With Many Points On Both Sides. Discret. Comput. Geom. 30(3): 415-435 (2003) - [j5]János Pach, Rom Pinchasi:
How Many Unit Equilateral Triangles Can Be Generated by N Points in Convex Position? Am. Math. Mon. 110(5): 400-406 (2003) - [c5]Rom Pinchasi, Rados Radoicic:
Topological graphs with no self-intersecting cycle of lenth 4. SCG 2003: 98-103 - [c4]János Pach, Rom Pinchasi, Micha Sharir:
A tight bound for the number of different directions in three dimensions. SCG 2003: 106-113 - 2002
- [j4]Rom Pinchasi:
Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. Discret. Comput. Geom. 28(4): 607-624 (2002) - [c3]Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
Lenses in arrangements of pseudo-circles and their applications. SCG 2002: 123-132 - [c2]János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth:
Geometric Graphs with No Self-intersecting Path of Length Three. GD 2002: 295-311 - [c1]Rom Pinchasi:
On the Size of a Radial Set. JCDCG 2002: 233-245 - 2001
- [j3]János Pach, Rom Pinchasi:
On the Number of Balanced Lines. Discret. Comput. Geom. 25(4): 611-628 (2001) - [j2]Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir:
On the Complexity of Arrangements of Circles in the Plane. Discret. Comput. Geom. 26(4): 465-492 (2001) - 2000
- [j1]János Pach, Rom Pinchasi:
Bichromatic Lines with Few Points. J. Comb. Theory A 90(2): 326-335 (2000)
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 2024-10-23 21:21 CEST 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: