Paz Carmi

According to our database, Paz Carmi authored at least 106 papers between 2003 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Online Range Assignment Problems.

Paz Carmi, Matthew J. Katz, Idan Tomer

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Dynamic Euclidean bottleneck matching.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

Theor. Comput. Sci., 2024

2023

Stabbing Pairwise Intersecting Disks by Four Points.

Paz Carmi, Matthew J. Katz, Pat Morin

Discret. Comput. Geom., December, 2023

Piercing pairwise intersecting geodesic disks by five points.

A. Karim Abu-Affash, Paz Carmi, Meytal Maman

Comput. Geom., 2023

Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees.

A. Karim Abu-Affash, Paz Carmi, Meytal Maman

Proceedings of the WALCOM: Algorithms and Computation, 2023

Geometric Spanning Trees Minimizing the Wiener Index.

A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

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

Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree.

A. Karim Abu-Affash, Paz Carmi, Meytal Maman

CoRR, 2022

<i>δ</i>-Greedy <i>t</i>-spanner.

A. Karim Abu-Affash, Gali Bar-On, Paz Carmi

Comput. Geom., 2022

$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number.

Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin

Electron. J. Comb., 2022

2021

2×n Grids have Unbounded Anagram-Free Chromatic Number.

Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin

CoRR, 2021

Piercing pairwise intersecting geodesic disks.

Prosenjit Bose, Paz Carmi, Thomas C. Shermer

Comput. Geom., 2021

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

Algorithmica, 2020

Parameterized Study of Steiner Tree on Unit Disk Graphs.

Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Planar Bichromatic Bottleneck Spanning Trees.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Non-Crossing Matching of Online Points.

Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Minimizing Total Interference in Asymmetric Sensor Networks.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz

Proceedings of the Algorithms for Sensor Systems, 2020

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

Minimizing the sum of distances to a server in a constraint network.

Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri

Comput. Geom., 2019

Bottleneck detour tree of points on a path.

Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman

Comput. Geom., 2019

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.

Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On the Minimum Consistent Subset Problem.

Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

Dual power assignment via second Hamiltonian cycle.

A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur

J. Comput. Syst. Sci., 2018

Unique Coverage with Rectangular Regions.

Rom Aschner, Paz Carmi, Yael Stein

Int. J. Comput. Geom. Appl., 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

Near-Optimal O(k)-Robust Geometric Spanners.

Prosenjit Bose, Paz Carmi, Vida Dujmovic, Pat Morin

CoRR, 2018

Bounded-Hop Communication Networks.

Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi

Algorithmica, 2018

Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.

Paz Carmi, Vida Dujmovic, Pat Morin

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Boundary Labeling for Rectangular Diagrams.

Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Geodesic Obstacle Representation of Graphs.

Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Faster Algorithms for some Optimization Problems on Collinear Points.

Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.

A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Approximability of Covering Cells with Line Segments.

Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

δ-Greedy t-spanner.

Gali Bar-On, Paz Carmi

CoRR, 2017

Efficient data retrieval in faulty sensor networks using a mobile mule.

Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal

Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Improved PTASs for Convex Barrier Coverage.

Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

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

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

\delta -Greedy t-spanner.

Gali Bar-On, Paz Carmi

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

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

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Bottleneck Bichromatic Full Steiner Trees.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Monochromatic Plane Matchings in Bicolored Point Set.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

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

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.

Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

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

Spiderman graph: Visibility in urban regions.

Paz Carmi, Eran Friedman, Matthew J. Katz

Comput. Geom., 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

On the Bounded-Hop Range Assignment Problem.

Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Compatible Connectivity-Augmentation of Planar Disconnected Graphs.

Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On the Minimum Cost Range Assignment Problem.

Paz Carmi, Lilach Chaitman-Yerushalmi

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Choice Is Hard.

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Conflict-free Covering.

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Strongly Connected Spanning Subgraph for Almost Symmetric Networks.

A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal

Discret. Comput. Geom., 2014

Locating Battery Charging Stations to Facilitate Almost Shortest Paths.

Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal

Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013

Minimum weight Euclidean t-spanner is NP-hard.

Paz Carmi, Lilach Chaitman-Yerushalmi

J. Discrete Algorithms, 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

Stable Roommates Spanner.

Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman

Comput. Geom., 2013

2012

Efficient model for indoor radio paths computation.

Boaz Ben-Moshe, Paz Carmi, Moti Shani, Nir Shvalb

Simul. Model. Pract. Theory, 2012

On bounded degree plane strong geometric spanners.

Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi

J. Discrete Algorithms, 2012

Editorial.

Prosenjit Bose, Paz Carmi

Comput. Geom., 2012

Bottleneck Non-crossing Matching in the Plane.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi

Proceedings of the Algorithms - ESA 2012, 2012

Unexplored Steiner Ratios in Geometric Networks.

Paz Carmi, Lilach Chaitman-Yerushalmi

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

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

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

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

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

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

The euclidean bottleneck steiner path problem.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Bottleneck Steiner Tree with Bounded Number of Steiner Vertices.

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Bounded Degree Planar Geometric Spanners

Paz Carmi, Lilach Chaitman

CoRR, 2010

Improved Methods For Generating Quasi-gray Codes.

Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid

Proceedings of the Algorithm Theory, 2010

The MST of Symmetric Disk Graphs Is Light.

A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz

Proceedings of the Algorithm Theory, 2010

Communication-Efficient Construction of the Plane Localized Delaunay Graph.

Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

An Optimal Algorithm for Computing Angle-Constrained Spanners.

Paz Carmi, Michiel H. M. Smid

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Minimum Power Energy Spanners in Wireless Ad Hoc Networks.

A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Computing Radio Paths in an Urban Environment.

Boaz Ben-Moshe, Nir Shvalb, Moti Shani, Paz Carmi, Elhanan Shifman

Proceedings of the 7th IEEE Consumer Communications and Networking Conference, 2010

Stable roommates and geometric spanners.

Paz Carmi, Lilach Chaitman

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Direction assignment in wireless networks.

Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

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

A linear-space algorithm for distance preserving graph embedding.

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer

Comput. Geom., 2009

On the Power of the Semi-Separated Pair Decomposition.

Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Bounding the locality of distributed routing algorithms.

Prosenjit Bose, Paz Carmi, Stephane Durocher

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

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

Distinct Distances in Graph Drawings.

Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood

Electron. J. Comb., 2008

NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.

Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh

Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Computing the Greedy Spanner in Near-Quadratic Time.

Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid

Proceedings of the Algorithm Theory, 2008

Spanners of Additively Weighted Point Sets.

Prosenjit Bose, Paz Carmi, Mathieu Couture

Proceedings of the Algorithm Theory, 2008

Spanners of Complete k -Partite Geometric Graphs.

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

On the Stretch Factor of Convex Delaunay Graphs.

Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times.

Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007

Geometric Spanners with Small Chromatic Number.

Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.

Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Location Oblivious Distributed Unit Disk Graph Coloring.

Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis

Proceedings of the Structural Information and Communication Complexity, 2007

Covering Points by Unit Disks of Fixed Location.

Paz Carmi, Matthew J. Katz, Nissan Lev-Tov

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Linear-Space Algorithms for Distance Preserving Embedding.

Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Private approximation of search problems.

Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Fault-Tolerant Power Assignment and Backbone in Wireless Networks.

Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Power Assignment in Radio Networks with Two Power Levels.

Paz Carmi, Matthew J. Katz

Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

Minimum-cost load-balancing partitions.

Boris Aronov, Paz Carmi, Matthew J. Katz

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

On the Fermat-Weber center of a convex object.

Paz Carmi, Sariel Har-Peled, Matthew J. Katz

Comput. Geom., 2005

Geographic Quorum System Approximations.

Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal

Algorithmica, 2005

The Minimum-Area Spanning Tree Problem.

Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

The minimum area spanning tree problem.

Paz Carmi, Matthew J. Katz

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Minimum-Cost Load-Balancing Partitions.

Paz Carmi, Matthew J. Katz

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Computing all large sums-of-pairs in _Rⁿ and the discrete planar two-watchtower problem.

Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz

Inf. Process. Lett., 2004

Approximating the Visible Region of a Point on a Terrain.

Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Greedy Edge-Disjoint Paths in Complete Graphs.

Paz Carmi, Thomas Erlebach, Yoshio Okamoto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003