Rom Pinchasi

698 total citations
64 papers, 274 citations indexed

About

Rom Pinchasi is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Rom Pinchasi has authored 64 papers receiving a total of 274 indexed citations (citations by other indexed papers that have themselves been cited), including 51 papers in Computer Graphics and Computer-Aided Design, 30 papers in Computational Theory and Mathematics and 15 papers in Computer Vision and Pattern Recognition. Recurrent topics in Rom Pinchasi's work include Computational Geometry and Mesh Generation (51 papers), Advanced Graph Theory Research (24 papers) and Point processes and geometric inequalities (15 papers). Rom Pinchasi is often cited by papers focused on Computational Geometry and Mesh Generation (51 papers), Advanced Graph Theory Research (24 papers) and Point processes and geometric inequalities (15 papers). Rom Pinchasi collaborates with scholars based in Israel, United States and Germany. Rom Pinchasi's co-authors include János Pach, Micha Sharir, Radoš Radoičić, Noga Alon, Shakhar Smorodinsky, Eran Nevo, Gézá Tóth, Pankaj K. Agarwal, M. Sharir and Eyal Ackerman and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and American Mathematical Monthly.

In The Last Decade

Rom Pinchasi

50 papers receiving 254 citations

Peers

Rom Pinchasi
Clemens Huemer Spain
Hannes Krasser Austria
Ruy Fabila‐Monroy Mexico
Birgit Vogtenhuber Austria
Joseph Zaks Israel
Gyula Károlyi Hungary
Attila Pór United States
Gelasio Salazar Mexico
Balázs Keszegh Hungary
Xavier Goaoc France
Clemens Huemer Spain
Rom Pinchasi
Citations per year, relative to Rom Pinchasi Rom Pinchasi (= 1×) peers Clemens Huemer

Countries citing papers authored by Rom Pinchasi

Since Specialization
Citations

This map shows the geographic impact of Rom Pinchasi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rom Pinchasi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rom Pinchasi more than expected).

Fields of papers citing papers by Rom Pinchasi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rom Pinchasi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rom Pinchasi. The network helps show where Rom Pinchasi may publish in the future.

Co-authorship network of co-authors of Rom Pinchasi

This figure shows the co-authorship network connecting the top 25 collaborators of Rom Pinchasi. A scholar is included among the top collaborators of Rom Pinchasi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rom Pinchasi. Rom Pinchasi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
2.
Pinchasi, Rom. (2013). Crossing by lines all edges of a line arrangement. Discrete Mathematics. 313(21). 2456–2462.
3.
Ackerman, Eyal & Rom Pinchasi. (2013). On coloring points with respect to rectangles. Journal of Combinatorial Theory Series A. 120(4). 811–815. 1 indexed citations
4.
Aronov, Boris, et al.. (2013). On the Union Complexity of Diametral Disks. The Electronic Journal of Combinatorics. 20(2).
5.
Ackerman, Eyal & Rom Pinchasi. (2013). Covering a chessboard with staircase walks. Discrete Mathematics. 313(22). 2547–2551.
6.
Ackerman, Eyal & Rom Pinchasi. (2012). On the light side of geometric graphs. Discrete Mathematics. 312(6). 1213–1217.
7.
Ackerman, Eyal, Tsachik Gelander, & Rom Pinchasi. (2012). Ice-creams and wedge graphs. Computational Geometry. 46(3). 213–218. 8 indexed citations
8.
Ackerman, Eyal, et al.. (2011). On inducing polygons and related problems. Computational Geometry. 46(7). 861–878. 1 indexed citations
9.
Kurz, Sascha & Rom Pinchasi. (2011). Regular Matchstick Graphs. American Mathematical Monthly. 118(3). 264–264. 2 indexed citations
10.
Pinchasi, Rom, et al.. (2010). On a problem about quadrant-depth. Computational Geometry. 43(6-7). 587–592. 1 indexed citations
11.
Alon, Noga, et al.. (2008). An isoperimetric inequality in the universal cover of the punctured plane. Discrete Mathematics. 308(23). 5691–5701. 1 indexed citations
12.
Pinchasi, Rom, et al.. (2008). Points with large α-depth. Journal of Combinatorial Theory Series A. 116(3). 747–755. 1 indexed citations
13.
Pinchasi, Rom. (2007). Linear algebra approach to geometric graphs. Journal of Combinatorial Theory Series A. 114(8). 1363–1374. 1 indexed citations
14.
Alon, Noga, János Pach, Rom Pinchasi, Radoš Radoičić, & Micha Sharir. (2005). Crossing patterns of semi-algebraic sets. Journal of Combinatorial Theory Series A. 111(2). 310–326. 55 indexed citations
15.
Pinchasi, Rom, Radoš Radoičić, & Micha Sharir. (2005). On empty convex polygons in a planar point set. Journal of Combinatorial Theory Series A. 113(3). 385–419. 15 indexed citations
16.
Pach, János, Rom Pinchasi, Gábor Tardos, & Gézá Tóth. (2004). Geometric graphs with no self-intersecting path of length three. European Journal of Combinatorics. 25(6). 793–811. 5 indexed citations
17.
Onn, Shmuel & Rom Pinchasi. (2004). A note on the minimum number of edge-directions of a convex polytope. Journal of Combinatorial Theory Series A. 107(1). 147–151. 2 indexed citations
18.
Pach, János, Rom Pinchasi, & Micha Sharir. (2003). A tight bound for the number of different directions in three dimensions. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 106–113. 4 indexed citations
19.
Pinchasi, Rom, et al.. (2003). Topological graphs with no self-intersecting cycle of length 4. 2 indexed citations
20.
Pach, János & Rom Pinchasi. (2000). Bichromatic Lines with Few Points. Journal of Combinatorial Theory Series A. 90(2). 326–335. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Clemens Huemer Breakdown of academic impact, for papers by Hannes Krasser Breakdown of academic impact, for papers by Ruy Fabila‐Monroy Breakdown of academic impact, for papers by Birgit Vogtenhuber Breakdown of academic impact, for papers by Joseph Zaks Breakdown of academic impact, for papers by Gyula Károlyi Breakdown of academic impact, for papers by Attila Pór Breakdown of academic impact, for papers by Gelasio Salazar Breakdown of academic impact, for papers by Balázs Keszegh Breakdown of academic impact, for papers by Xavier Goaoc
Rankless by CCL
2026