Paz Carmi

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 74

Top Venues

Publications

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Dynamic Euclidean bottleneck matching. Theor. Comput. Sci. 1013 (2024)
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
Geodesic obstacle representation of graphs. Comput. Geom. 109 (2023)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing pairwise intersecting geodesic disks by five points. Comput. Geom. 109 (2023)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85 (1) (2023)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Dynamic Euclidean Bottleneck Matching. CoRR (2023)
Paz Carmi, Matthew J. Katz, Pat Morin
Stabbing Pairwise Intersecting Disks by Four Points. Discret. Comput. Geom. 70 (4) (2023)
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
Geometric Spanning Trees Minimizing the Wiener Index. WADS (2023)
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
Geometric Spanning Trees Minimizing the Wiener Index. CoRR (2023)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. WALCOM (2023)
A. Karim Abu-Affash, Gali Bar-On, Paz Carmi
-spanner. Comput. Geom. 100 (2022)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103 (2022)
A. Karim Abu-Affash, Paz Carmi, Adi Krasin
A linear-time algorithm for minimum k-hop dominating set of a cactus graph. Discret. Appl. Math. 320 (2022)
Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number. Electron. J. Comb. 29 (3) (2022)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree. CoRR (2022)
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
Piercing Pairwise Intersecting Geodesic Disks by Five Points. CoRR (2021)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
On the Minimum Consistent Subset Problem. Algorithmica 83 (7) (2021)
Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin
2×n Grids have Unbounded Anagram-Free Chromatic Number. CoRR (2021)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing total interference in asymmetric sensor networks. Theor. Comput. Sci. 889 (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12 (1) (2021)
Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein
Improved PTASs for convex barrier coverage. Comput. Geom. 92 (2021)
Prosenjit Bose, Paz Carmi, Thomas C. Shermer
Piercing pairwise intersecting geodesic disks. Comput. Geom. 98 (2021)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66 (4) (2021)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. ESA (2020)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced line separators of unit disk graphs. Comput. Geom. 86 (2020)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing Total Interference in Asymmetric Sensor Networks. ALGOSENSORS (2020)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR (2020)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT (2020)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster algorithms for some optimization problems on collinear points. J. Comput. Geom. 11 (1) (2020)
A. Karim Abu-Affash, Paz Carmi, Adi Krasin
A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph. CoRR (2020)
Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Algorithmica 82 (10) (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Monochromatic plane matchings in bicolored point set. Inf. Process. Lett. 153 (2020)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
Planar Bichromatic Bottleneck Spanning Trees. CoRR (2020)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Minimizing Total Interference in Asymmetric Sensor Networks. CoRR (2020)
Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour
Non-Crossing Matching of Online Points. CCCG (2020)
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
Approximability of covering cells with line segments. Theor. Comput. Sci. 784 (2019)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142 (2019)
Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. 29 (4) (2019)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. WADS (2019)
Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri
Minimizing the sum of distances to a server in a constraint network. Comput. Geom. 80 (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS (2019)
Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman
Bottleneck detour tree of points on a path. Comput. Geom. 79 (2019)
Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
Locating battery charging stations to facilitate almost shortest paths. Discret. Appl. Math. 254 (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR (2019)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Dual power assignment via second Hamiltonian cycle. J. Comput. Syst. Sci. 93 (2018)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Boundary Labeling for Rectangular Diagrams. SWAT (2018)
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
Geodesic Obstacle Representation of Graphs. ICALP (2018)
Rom Aschner, Paz Carmi, Yael Stein
Unique Coverage with Rectangular Regions. Int. J. Comput. Geom. Appl. 28 (4) (2018)
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG (2018)
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
Approximability of Covering Cells with Line Segments. CoRR (2018)
Paz Carmi, Vida Dujmovic, Pat Morin
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. WG (2018)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Selecting and covering colored points. Discret. Appl. Math. 250 (2018)
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
Approximability of Covering Cells with Line Segments. COCOA (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. CoRR (2018)
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Pat Morin
Near-Optimal O(k)-Robust Geometric Spanners. CoRR (2018)
Paz Carmi, Matthew J. Katz, Pat Morin
Stabbing Pairwise Intersecting Disks by Four Points. CoRR (2018)
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
Bounded-Hop Communication Networks. Algorithmica 80 (11) (2018)
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
Faster Algorithms for some Optimization Problems on Collinear Points. SoCG (2018)
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
Geodesic Obstacle Representation of Graphs. CoRR (2018)
Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. CoRR (2018)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Boundary Labeling for Rectangular Diagrams. CoRR (2018)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. Int. J. Comput. Geom. Appl. 27 (3) (2017)
Gali Bar-On, Paz Carmi
δ-Greedy t-spanner. CoRR (2017)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
Network Optimization on Partitioned Pairs of Points. CoRR (2017)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck Bichromatic Full Steiner Trees. CCCG (2017)
Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein
Improved PTASs for Convex Barrier Coverage. WAOA (2017)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced Line Separators of Unit Disk Graphs. WADS (2017)
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
Balanced Line Separators of Unit Disk Graphs. CoRR (2017)
Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Efficient data retrieval in faulty sensor networks using a mobile mule. WiOpt (2017)
Gali Bar-On, Paz Carmi
\delta -Greedy t-spanner. WADS (2017)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
Network Optimization on Partitioned Pairs of Points. ISAAC (2017)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Monochromatic Plane Matchings in Bicolored Point Set. CCCG (2017)
Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. Graph Drawing (2016)
Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. J. Comput. Geom. 7 (1) (2016)
Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. CoRR (2016)
Paz Carmi, Eran Friedman, Matthew J. Katz
Spiderman graph: Visibility in urban regions. Comput. Geom. 48 (3) (2015)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Conflict-free Covering. CCCG (2015)
A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid
Approximating the bottleneck plane perfect matching of a point set. Comput. Geom. 48 (9) (2015)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Choice Is Hard. ISAAC (2015)
Paz Carmi, Lilach Chaitman-Yerushalmi
On the Minimum Cost Range Assignment Problem. CoRR (2015)
Paz Carmi, Lilach Chaitman-Yerushalmi
On the Minimum Cost Range Assignment Problem. ISAAC (2015)
Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. CoRR (2015)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. CCCG (2015)
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. SODA (2015)
Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein
Minimum Dominating Set Problem for Unit Disks Revisited. Int. J. Comput. Geom. Appl. 25 (3) (2015)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
Bottleneck Steiner tree with bounded number of Steiner vertices. J. Discrete Algorithms 30 (2015)
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin
Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discret. Comput. Geom. 54 (2) (2015)
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
On the Bounded-Hop Range Assignment Problem. WADS (2015)
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. CoRR (2014)
Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
Locating Battery Charging Stations to Facilitate Almost Shortest Paths. ATMOS (2014)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition. Discret. Comput. Geom. 51 (1) (2014)
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
Dual Power Assignment via Second Hamiltonian Cycle. CoRR (2014)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck non-crossing matching in the plane. Comput. Geom. 47 (3) (2014)
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69 (2) (2014)
Paz Carmi, Lilach Chaitman-Yerushalmi
Minimum weight Euclidean t-spanner is NP-hard. J. Discrete Algorithms 22 (2013)
Prosenjit Bose, Paz Carmi, Stephane Durocher
Bounding the locality of distributed routing algorithms. Distributed Comput. 26 (1) (2013)
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman
Stable Roommates Spanner. Comput. Geom. 46 (2) (2013)
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid
On the power of the semi-separated pair decomposition. Comput. Geom. 46 (6) (2013)
Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. 23 (6) (2013)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-crossing Matching in the Plane. ESA (2012)
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-Crossing Matching in the Plane CoRR (2012)

Paz Carmi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paz Carmi