Greedy Edge-Disjoint Paths in Complete Graphs. - Paz Carmi; Thomas Erlebach; Yoshio Okamoto (WG, 2003)

Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. - Boaz Ben-Moshe; Paz Carmi; Matthew J. Katz (Inf. Process. Lett., 2004)

Minimum-Cost Load-Balancing Partitions. - Paz Carmi; Matthew J. Katz (CCCG, 2005)

The minimum area spanning tree problem. - Paz Carmi; Matthew J. Katz (EuroCG, 2005)

Geographic Quorum System Approximations. - Paz Carmi; Shlomi Dolev; Sariel Har-Peled; Matthew J. Katz; Michael Segal 001 (Algorithmica, 2005)

On the Fermat-Weber center of a convex object. - Paz Carmi; Sariel Har-Peled; Matthew J. Katz (Comput. Geom., 2005)

The minimum-area spanning tree problem. - Paz Carmi; Matthew J. Katz; Joseph S. B. Mitchell (Comput. Geom., 2006)

Linear-Space Algorithms for Distance Preserving Embedding. - Tetsuo Asano; Prosenjit Bose; Paz Carmi; Anil Maheshwari; Chang Shu 001; Michiel H. M. Smid; Stefanie Wuhrer (CCCG, 2007)

Covering Points by Unit Disks of Fixed Location. - Paz Carmi; Matthew J. Katz; Nissan Lev-Tov (ISAAC, 2007)

Fault-Tolerant Power Assignment and Backbone in Wireless Networks. - Paz Carmi; Matthew J. Katz; Michael Segal 001; Hanan Shpungin (Ad Hoc Sens. Wirel. Networks, 2007)

Power Assignment in Radio Networks with Two Power Levels. - Paz Carmi; Matthew J. Katz (Algorithmica, 2007)

Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. - Binay K. Bhattacharya; Paz Carmi; Yuzhuang Hu; Qiaosheng Shi (ISAAC, 2008)

NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. - Glenn Hickey; Paz Carmi; Anil Maheshwari; Norbert Zeh (WABI, 2008)

Distinct Distances in Graph Drawings. - Paz Carmi; Vida Dujmovic; Pat Morin; David R. Wood (Electron. J. Comb., 2008)

Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. - Paz Carmi; Matthew J. Katz; Nissan Lev-Tov (Comput. Geom., 2008)

Approximating the Visible Region of a Point on a Terrain. - Boaz Ben-Moshe; Paz Carmi; Matthew J. Katz (GeoInformatica, 2008)

Private Approximation of Search Problems. - Amos Beimel; Paz Carmi; Kobbi Nissim; Enav Weinreb (SIAM J. Comput., 2008)

Minimum-Cost Load-Balancing Partitions. - Boris Aronov; Paz Carmi; Matthew J. Katz (Algorithmica, 2009)

A linear-space algorithm for distance preserving graph embedding. - Tetsuo Asano; Prosenjit Bose; Paz Carmi; Anil Maheshwari; Chang Shu 001; Michiel H. M. Smid; Stefanie Wuhrer (Comput. Geom., 2009)

Geometric spanners with small chromatic number. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (Comput. Geom., 2009)

Spanners of Complete k-Partite Geometric Graphs. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (SIAM J. Comput., 2009)

Matrix columns allocation problems. - Amos Beimel; Boaz Ben-Moshe; Yehuda Ben-Shimol; Paz Carmi; Eldad Chai; Itzik Kitroser; Eran Omri (Theor. Comput. Sci., 2009)

Direction assignment in wireless networks. - Boaz Ben-Moshe; Paz Carmi; Lilach Chaitman; Matthew J. Katz; Gila Morgenstern; Yael Stein (CCCG, 2010)

Stable roommates and geometric spanners. - Paz Carmi; Lilach Chaitman (CCCG, 2010)

Computing Radio Paths in an Urban Environment. - Boaz Ben-Moshe; Nir Shvalb; Moti Shani; Paz Carmi; Elhanan Shifman (CCNC, 2010)

Communication-Efficient Construction of the Plane Localized Delaunay Graph. - Prosenjit Bose; Paz Carmi; Michiel H. M. Smid; Daming Xu (LATIN, 2010)

Improved Methods For Generating Quasi-gray Codes. - Prosenjit Bose; Paz Carmi; Dana Jansens; Anil Maheshwari; Pat Morin; Michiel H. M. Smid (SWAT, 2010)

Computing the Greedy Spanner in Near-Quadratic Time. - Prosenjit Bose; Paz Carmi; Mohammad Farshi; Anil Maheshwari; Michiel H. M. Smid (Algorithmica, 2010)

Bounded Degree Planar Geometric Spanners - Paz Carmi; Lilach Chaitman (CoRR, 2010)

On the Stretch Factor of Convex Delaunay Graphs. - Prosenjit Bose; Paz Carmi; Sébastien Collette; Michiel H. M. Smid (J. Comput. Geom., 2010)

The euclidean bottleneck steiner path problem. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Michael Segal 001 (SCG, 2011)

Location-Oblivious Distributed Unit Disk Graph Coloring. - Michel Barbeau; Prosenjit Bose; Paz Carmi; Mathieu Couture; Evangelos Kranakis (Algorithmica, 2011)

On a family of strong geometric spanners that admit local routing strategies. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Michiel H. M. Smid; Daming Xu (Comput. Geom., 2011)

Connectivity guarantees for wireless networks with directional antennas. - Paz Carmi; Matthew J. Katz; Zvi Lotker; Adi Rosén (Comput. Geom., 2011)

Multi Cover of a Polygon Minimizing the Sum of Areas. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Gila Morgenstern (Int. J. Comput. Geom. Appl., 2011)

Spanners of additively weighted point sets. - Prosenjit Bose; Paz Carmi; Mathieu Couture (J. Discrete Algorithms, 2011)

An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. - Glenn Hickey; Mathieu Blanchette; Paz Carmi; Anil Maheshwari; Norbert Zeh (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Minimum power energy spanners in wireless ad hoc networks. - A. Karim Abu-Affash; Rom Aschner; Paz Carmi; Matthew J. Katz (Wirel. Networks, 2011)

Unexplored Steiner Ratios in Geometric Networks. - Paz Carmi; Lilach Chaitman-Yerushalmi (COCOON, 2012)

The MST of symmetric disk graphs is light. - A. Karim Abu-Affash; Rom Aschner; Paz Carmi; Matthew J. Katz (Comput. Geom., 2012)

Editorial. - Prosenjit Bose; Paz Carmi (Comput. Geom., 2012)

On bounded degree plane strong geometric spanners. - Prosenjit Bose; Paz Carmi; Lilach Chaitman-Yerushalmi (J. Discrete Algorithms, 2012)

An optimal algorithm for computing angle-constrained spanners. - Paz Carmi; Michiel H. M. Smid (J. Comput. Geom., 2012)

Efficient model for indoor radio paths computation. - Boaz Ben-Moshe; Paz Carmi; Moti Shani; Nir Shvalb (Simul. Model. Pract. Theory, 2012)

On the power of the semi-separated pair decomposition. - Mohammad Ali Abam; Paz Carmi; Mohammad Farshi; Michiel H. M. Smid (Comput. Geom., 2013)

Stable Roommates Spanner. - Prosenjit Bose; Paz Carmi; Lilach Chaitman-Yerushalmi; Sébastien Collette; Matthew J. Katz; Stefan Langerman (Comput. Geom., 2013)

Bounding the locality of distributed routing algorithms. - Prosenjit Bose; Paz Carmi; Stephane Durocher (Distributed Comput., 2013)

Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. - Minati De; Gautam K. Das; Paz Carmi; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 2013)

Minimum weight Euclidean t-spanner is NP-hard. - Paz Carmi; Lilach Chaitman-Yerushalmi (J. Discrete Algorithms, 2013)

Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. - Prosenjit Bose; Paz Carmi; Mirela Damian; Robin Y. Flatland; Matthew J. Katz; Anil Maheshwari (Algorithmica, 2014)

Bottleneck non-crossing matching in the plane. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Yohai Trabelsi (Comput. Geom., 2014)

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Michael Segal 001 (Discret. Comput. Geom., 2014)

Conflict-free Covering. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (CCCG, 2015)

Choice Is Hard. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (ISAAC, 2015)

On the Minimum Cost Range Assignment Problem. - Paz Carmi; Lilach Chaitman-Yerushalmi (ISAAC, 2015)

On the Bounded-Hop Range Assignment Problem. - Paz Carmi; Lilach Chaitman-Yerushalmi; Ohad Trabelsi (WADS, 2015)

Approximating the bottleneck plane perfect matching of a point set. - A. Karim Abu-Affash; Ahmad Biniaz; Paz Carmi; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2015)

Spiderman graph: Visibility in urban regions. - Paz Carmi; Eran Friedman; Matthew J. Katz (Comput. Geom., 2015)

Compatible Connectivity Augmentation of Planar Disconnected Graphs. - Greg Aloupis; Luis Barba; Paz Carmi; Vida Dujmovic; Fabrizio Frati; Pat Morin (Discret. Comput. Geom., 2015)

Minimum Dominating Set Problem for Unit Disks Revisited. - Paz Carmi; Gautam K. Das; Ramesh K. Jallu; Subhas C. Nandy; Prajwal R. Prasad; Yael Stein (Int. J. Comput. Geom. Appl., 2015)

Bottleneck Steiner tree with bounded number of Steiner vertices. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz (J. Discrete Algorithms, 2015)

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. - Nicolas Bonichon; Prosenjit Bose; Paz Carmi; Irina Kostitsyna; Anna Lubiw; Sander Verdonschot (GD, 2016)

On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. - Michiel H. M. Smid; Prosenjit Bose; Paz Carmi; Mirela Damian; Jean-Lou De Carufel; Darryl Hill; Anil Maheshwari; Yuyang Liu (J. Comput. Geom., 2016)

Network Optimization on Partitioned Pairs of Points. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Su Jia; Matthew J. Katz; Tyler Mayer; Joseph S. B. Mitchell (ISAAC, 2017)

delta -Greedy t-spanner. - Gali Bar-On; Paz Carmi (WADS, 2017)

Efficient data retrieval in faulty sensor networks using a mobile mule. - Harel Yedidsion; Aritra Banik; Paz Carmi; Matthew J. Katz; Michael Segal 001 (WiOpt, 2017)

δ-Greedy t-spanner. - Gali Bar-On; Paz Carmi (CoRR, 2017)

Strongly Connected Spanning Subgraph for Almost Symmetric Networks. - A. Karim Abu-Affash; Paz Carmi; Anat Parush Tzur (Int. J. Comput. Geom. Appl., 2017)

Boundary Labeling for Rectangular Diagrams. - Prosenjit Bose; Paz Carmi; J. Mark Keil; Saeed Mehrabi 001; Debajyoti Mondal (SWAT, 2018)

Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. - Paz Carmi; Vida Dujmovic; Pat Morin (WG, 2018)

Bounded-Hop Communication Networks. - Paz Carmi; Lilach Chaitman-Yerushalmi; Ohad Trabelsi (Algorithmica, 2018)

Near-Optimal O(k)-Robust Geometric Spanners. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Pat Morin (CoRR, 2018)

Selecting and covering colored points. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (Discret. Appl. Math., 2018)

Unique Coverage with Rectangular Regions. - Rom Aschner; Paz Carmi; Yael Stein (Int. J. Comput. Geom. Appl., 2018)

Dual power assignment via second Hamiltonian cycle. - A. Karim Abu-Affash; Paz Carmi; Anat Parush Tzur (J. Comput. Syst. Sci., 2018)

Bottleneck detour tree of points on a path. - Greg Aloupis; Paz Carmi; Lilach Chaitman-Yerushalmi; Matthew J. Katz; Stefan Langerman (Comput. Geom., 2019)

Minimizing the sum of distances to a server in a constraint network. - Paz Carmi; Lilach Chaitman-Yerushalmi; Bat-Chen Ozeri (Comput. Geom., 2019)

Locating battery charging stations to facilitate almost shortest paths. - Esther M. Arkin; Paz Carmi; Matthew J. Katz; Joseph S. B. Mitchell; Michael Segal 001 (Discret. Appl. Math., 2019)

The Most Likely Object to be Seen Through a Window. - Paz Carmi; Farah Chanchary; Anil Maheshwari; Michiel H. M. Smid (Int. J. Comput. Geom. Appl., 2019)

Bottleneck bichromatic full Steiner trees. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi; Dibyayan Chakraborty (Inf. Process. Lett., 2019)

Approximability of covering cells with line segments. - Paz Carmi; Anil Maheshwari; Saeed Mehrabi 001; Luís Fernando Schultz Xavier da Silveira (Theor. Comput. Sci., 2019)

Non-Crossing Matching of Online Points. - Prosenjit Bose; Paz Carmi; Stephane Durocher; Shahin Kamali; Arezoo Sajadpour (CCCG, 2020)

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. - Harel Yedidsion; Stav Ashur; Aritra Banik; Paz Carmi; Matthew J. Katz; Michael Segal 001 (Algorithmica, 2020)

Balanced line separators of unit disk graphs. - Paz Carmi; Man-Kwun Chiu; Matthew J. Katz; Matias Korman; Yoshio Okamoto; André van Renssen; Marcel Roeloffzen; Taichi Shiitada; Shakhar Smorodinsky (Comput. Geom., 2020)

Monochromatic plane matchings in bicolored point set. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi (Inf. Process. Lett., 2020)

Faster algorithms for some optimization problems on collinear points. - Ahmad Biniaz; Prosenjit Bose; Paz Carmi; Anil Maheshwari; J. Ian Munro; Michiel H. M. Smid (J. Comput. Geom., 2020)

On the Minimum Consistent Subset Problem. - Ahmad Biniaz; Sergio Cabello; Paz Carmi; Jean-Lou De Carufel; Anil Maheshwari; Saeed Mehrabi 001; Michiel Smid (Algorithmica, 2021)

Piercing pairwise intersecting geodesic disks. - Prosenjit Bose; Paz Carmi; Thomas C. Shermer (Comput. Geom., 2021)

Improved PTASs for convex barrier coverage. - Paz Carmi; Matthew J. Katz; Rachel Saban; Yael Stein (Comput. Geom., 2021)

2×n Grids have Unbounded Anagram-Free Chromatic Number. - Saman Bazarghani; Paz Carmi; Vida Dujmovic; Pat Morin (CoRR, 2021)

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. - A. Karim Abu-Affash; Paz Carmi; Anil Maheshwari; Pat Morin; Michiel Smid; Shakhar Smorodinsky (Discret. Comput. Geom., 2021)

Planar bichromatic bottleneck spanning trees. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi; Joseph S. B. Mitchell (J. Comput. Geom., 2021)

Minimizing total interference in asymmetric sensor networks. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz (Theor. Comput. Sci., 2021)

$2 times n$ Grids have Unbounded Anagram-Free Chromatic Number. - Saman Bazarghani; Paz Carmi; Vida Dujmovic; Pat Morin (Electron. J. Comb., 2022)

δ-Greedy t-spanner. - A. Karim Abu-Affash; Gali Bar-On; Paz Carmi (Comput. Geom., 2022)

Computing maximum independent set on outerstring graphs and their relatives. - Prosenjit Bose; Paz Carmi; J. Mark Keil; Anil Maheshwari; Saeed Mehrabi 001; Debajyoti Mondal; Michiel Smid (Comput. Geom., 2022)

Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree. - A. Karim Abu-Affash; Paz Carmi; Meytal Maman (CoRR, 2022)

A linear-time algorithm for minimum k-hop dominating set of a cactus graph. - A. Karim Abu-Affash; Paz Carmi; Adi Krasin (Discret. Appl. Math., 2022)

Geometric Spanning Trees Minimizing the Wiener Index. - A. Karim Abu-Affash; Paz Carmi; Ori Luwisch; Joseph S. B. Mitchell (WADS, 2023)

Parameterized Study of Steiner Tree on Unit Disk Graphs. - Sujoy Bhore; Paz Carmi; Sudeshna Kolay; Meirav Zehavi (Algorithmica, 2023)

Piercing pairwise intersecting geodesic disks by five points. - A. Karim Abu-Affash; Paz Carmi; Meytal Maman (Comput. Geom., 2023)

Geodesic obstacle representation of graphs. - Prosenjit Bose; Paz Carmi; Vida Dujmovic; Saeed Mehrabi 001; Fabrizio Montecchiani; Pat Morin; Luís Fernando Schultz Xavier da Silveira (Comput. Geom., 2023)

Stabbing Pairwise Intersecting Disks by Four Points. - Paz Carmi; Matthew J. Katz; Pat Morin (Discret. Comput. Geom., 2023)

Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. - A. Karim Abu-Affash; Paz Carmi; Meytal Maman (J. Graph Algorithms Appl., 2024)

Dynamic Euclidean bottleneck matching. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi (Theor. Comput. Sci., 2024)

Online Range Assignment Problems. - Paz Carmi; Matthew J. Katz; Idan Tomer (CIAC (1), 2025)