Paz Carmi

923 total citations
66 papers, 271 citations indexed

About

Paz Carmi is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Paz Carmi has authored 66 papers receiving a total of 271 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computer Graphics and Computer-Aided Design, 23 papers in Computational Theory and Mathematics and 18 papers in Computer Networks and Communications. Recurrent topics in Paz Carmi's work include Computational Geometry and Mesh Generation (42 papers), Advanced Graph Theory Research (19 papers) and Complexity and Algorithms in Graphs (14 papers). Paz Carmi is often cited by papers focused on Computational Geometry and Mesh Generation (42 papers), Advanced Graph Theory Research (19 papers) and Complexity and Algorithms in Graphs (14 papers). Paz Carmi collaborates with scholars based in Israel, Canada and United States. Paz Carmi's co-authors include Matthew J. Katz, Prosenjit Bose, Michael Segal, Boris Aronov, Sariel Har-Peled, Michiel Smid, Joseph S. B. Mitchell, Anil Maheshwari, Zvi Lotker and Boaz Ben‐Moshe and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Paz Carmi

52 papers receiving 256 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Paz Carmi Israel	9	128	106	76	52	44	66	271
Sandip Das India	10	143 1.1×	50 0.5×	72 0.9×	42 0.8×	69 1.6×	71	289
Sébastien Collette Belgium	8	95 0.7×	81 0.8×	46 0.6×	18 0.3×	45 1.0×	34	237
Javier Tejel Spain	7	123 1.0×	43 0.4×	92 1.2×	26 0.5×	36 0.8×	32	200
Manuel Abellanas Spain	8	140 1.1×	39 0.4×	67 0.9×	16 0.3×	60 1.4×	29	220
Wolfgang Mulzer Germany	10	178 1.4×	45 0.4×	96 1.3×	27 0.5×	69 1.6×	56	286
Leonidas Palios Greece	8	146 1.1×	37 0.3×	84 1.1×	15 0.3×	71 1.6×	27	252
Maarten Löffler Netherlands	9	219 1.7×	51 0.5×	63 0.8×	9 0.2×	85 1.9×	46	291
Menelaos I. Karavelas Greece	10	142 1.1×	38 0.4×	51 0.7×	12 0.2×	87 2.0×	26	285
Elmar Langetepe Germany	10	114 0.9×	86 0.8×	25 0.3×	7 0.1×	81 1.8×	34	230
Inmaculada Ventura Spain	9	84 0.7×	75 0.7×	17 0.2×	11 0.2×	83 1.9×	26	234

Countries citing papers authored by Paz Carmi

Since Specialization

Citations

This map shows the geographic impact of Paz Carmi'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 Paz Carmi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paz Carmi more than expected).

Fields of papers citing papers by Paz Carmi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Paz Carmi. 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 Paz Carmi. The network helps show where Paz Carmi may publish in the future.

Co-authorship network of co-authors of Paz Carmi

This figure shows the co-authorship network connecting the top 25 collaborators of Paz Carmi. A scholar is included among the top collaborators of Paz Carmi 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 Paz Carmi. Paz Carmi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Carmi, Paz, et al.. (2024). Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. Journal of Graph Algorithms and Applications. 28(3). 3–10.

Carmi, Paz, Matthew J. Katz, & Pat Morin. (2023). Stabbing Pairwise Intersecting Disks by Four Points. Discrete & Computational Geometry. 70(4). 1751–1784.

Carmi, Paz, et al.. (2019). Minimizing the sum of distances to a server in a constraint network. Computational Geometry. 80. 1–12. 1 indexed citations

Arkin, Esther M., et al.. (2018). Selecting and covering colored points. Discrete Applied Mathematics. 250. 75–86. 5 indexed citations

Carmi, Paz, et al.. (2017). Dual power assignment via second Hamiltonian cycle. Journal of Computer and System Sciences. 93. 41–53. 4 indexed citations

Aloupis, Greg, Luis Barba, Paz Carmi, et al.. (2015). Compatible connectivity-augmentation of planar disconnected graphs. Symposium on Discrete Algorithms. 1602–1615. 1 indexed citations

Carmi, Paz, et al.. (2015). Approximating the bottleneck plane perfect matching of a point set. Computational Geometry. 48(9). 718–731. 2 indexed citations

Carmi, Paz, et al.. (2013). Bottleneck non-crossing matching in the plane. Computational Geometry. 47(3). 447–457. 6 indexed citations

Bose, Prosenjit, et al.. (2012). On bounded degree plane strong geometric spanners. Journal of Discrete Algorithms. 15. 16–31. 9 indexed citations

10.

Bose, Prosenjit, et al.. (2011). On a family of strong geometric spanners that admit local routing strategies. Computational Geometry. 44(6-7). 319–328.

11.

Carmi, Paz, Matthew J. Katz, Zvi Lotker, & Adi Rosén. (2011). Connectivity guarantees for wireless networks with directional antennas. Computational Geometry. 44(9). 477–485. 20 indexed citations

12.

Bose, Prosenjit, et al.. (2011). Spanners of additively weighted point sets. Journal of Discrete Algorithms. 9(3). 287–298. 1 indexed citations

13.

Ben‐Moshe, Boaz, et al.. (2010). Direction Assignment in Wireless Networks. Canadian Conference on Computational Geometry. 39–42. 4 indexed citations

14.

Bose, Prosenjit, et al.. (2008). Geometric spanners with small chromatic number. Computational Geometry. 42(2). 134–146. 3 indexed citations

15.

Asano, Tetsuo, Prosenjit Bose, Paz Carmi, et al.. (2008). A linear-space algorithm for distance preserving graph embedding. Computational Geometry. 42(4). 289–304. 7 indexed citations

16.

Carmi, Paz, et al.. (2007). Fault-Tolerant Power Assignment and Backbone in Wireless Networks.. Ad Hoc & Sensor Wireless Networks. 4. 355–366. 1 indexed citations

17.

Asano, Tetsuo, Prosenjit Bose, Paz Carmi, et al.. (2007). Linear-Space Algorithms for Distance Preserving Embedding. NPARC. 185–188.

18.

Carmi, Paz, Matthew J. Katz, & Joseph S. B. Mitchell. (2006). The minimum-area spanning tree problem. Computational Geometry. 35(3). 218–225. 8 indexed citations

19.

Carmi, Paz & Matthew J. Katz. (2005). Minimum-Cost Load-Balancing Partitions.. Canadian Conference on Computational Geometry. 65–67. 2 indexed citations

20.

Carmi, Paz, Sariel Har-Peled, & Matthew J. Katz. (2005). On the Fermat–Weber center of a convex object. Computational Geometry. 32(3). 188–195. 15 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