Paz Carmi

179 papers A* 7A 3B 26C 5Misc 1Journal 111Unranked 26
YearRankTypeTitle / Venue / Authors
2025 — conf
Approximating 2-Clique in Unit Disk Graphs.
CCCG
A. Karim Abu-Affash, Paz Carmi, Iliya Lisin
2025 — conf
Online Range Assignment Problems.
CIAC (1)
Paz Carmi, Matthew J. Katz, Idan Tomer
2024 J jnl
Dynamic Euclidean bottleneck matching.
Theor. Comput. Sci.
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
2024 J jnl
Geometric Spanning Trees Minimizing the Wiener Index.
Comput. Geom. Topol.
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
2024 J jnl
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees.
J. Graph Algorithms Appl.
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
2023 J jnl
Dynamic Euclidean Bottleneck Matching.
CoRR
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
2023 J jnl
Geodesic obstacle representation of graphs.
Comput. Geom.
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
2023 B conf
Geometric Spanning Trees Minimizing the Wiener Index.
WADS
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
2023 J jnl
Geometric Spanning Trees Minimizing the Wiener Index.
CoRR
A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell
2023 J jnl
Parameterized Study of Steiner Tree on Unit Disk Graphs.
Algorithmica
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2023 B conf
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees.
WALCOM
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
2023 J jnl
Piercing pairwise intersecting geodesic disks by five points.
Comput. Geom.
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
2023 J jnl
Stabbing Pairwise Intersecting Disks by Four Points.
Discret. Comput. Geom.
Paz Carmi, Matthew J. Katz, Pat Morin
2022 J jnl
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number.
Electron. J. Comb.
Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin
2022 J jnl
A linear-time algorithm for minimum k-hop dominating set of a cactus graph.
Discret. Appl. Math.
A. Karim Abu-Affash, Paz Carmi, Adi Krasin
2022 J jnl
Computing maximum independent set on outerstring graphs and their relatives.
Comput. Geom.
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid
2022 J jnl
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree.
CoRR
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
2021 J jnl
2×n Grids have Unbounded Anagram-Free Chromatic Number.
CoRR
Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin
2021 J jnl
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
Discret. Comput. Geom.
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, Shakhar Smorodinsky
2021 J jnl
Improved PTASs for convex barrier coverage.
Comput. Geom.
Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein
2021 J jnl
Minimizing total interference in asymmetric sensor networks.
Theor. Comput. Sci.
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
2021 J jnl
On the Minimum Consistent Subset Problem.
Algorithmica
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
2021 J jnl
Piercing Pairwise Intersecting Geodesic Disks by Five Points.
CoRR
A. Karim Abu-Affash, Paz Carmi, Meytal Maman
2021 J jnl
Piercing pairwise intersecting geodesic disks.
Comput. Geom.
Prosenjit Bose, Paz Carmi, Thomas C. Shermer
2021 J jnl
Planar bichromatic bottleneck spanning trees.
J. Comput. Geom.
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
2020 J jnl
A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph.
CoRR
A. Karim Abu-Affash, Paz Carmi, Adi Krasin
2020 J jnl
Balanced line separators of unit disk graphs.
Comput. Geom.
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2020 J jnl
Faster algorithms for some optimization problems on collinear points.
J. Comput. Geom.
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2020 C conf
Minimizing Total Interference in Asymmetric Sensor Networks.
ALGOSENSORS
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
2020 J jnl
Minimizing Total Interference in Asymmetric Sensor Networks.
CoRR
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
2020 J jnl
Monochromatic plane matchings in bicolored point set.
Inf. Process. Lett.
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
2020 — conf
Non-Crossing Matching of Online Points.
CCCG
Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour
2020 — conf
Parameterized Study of Steiner Tree on Unit Disk Graphs.
SWAT
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2020 J jnl
Parameterized Study of Steiner Tree on Unit Disk Graphs.
CoRR
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
2020 A conf
Planar Bichromatic Bottleneck Spanning Trees.
ESA
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
2020 J jnl
Planar Bichromatic Bottleneck Spanning Trees.
CoRR
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell
2020 J jnl
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule.
Algorithmica
Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
2019 J jnl
Approximability of covering cells with line segments.
Theor. Comput. Sci.
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
2019 J jnl
Bottleneck bichromatic full Steiner trees.
Inf. Process. Lett.
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
2019 J jnl
Bottleneck detour tree of points on a path.
Comput. Geom.
Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman
2019 B conf
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.
WADS
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
2019 J jnl
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives.
CoRR
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
2019 J jnl
Locating battery charging stations to facilitate almost shortest paths.
Discret. Appl. Math.
Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
2019 J jnl
Minimizing the sum of distances to a server in a constraint network.
Comput. Geom.
Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri
2019 B conf
On the Minimum Consistent Subset Problem.
WADS
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
2019 J jnl
The Most Likely Object to be Seen Through a Window.
Int. J. Comput. Geom. Appl.
Paz Carmi, Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid
2018 B conf
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.
WG
Paz Carmi, Vida Dujmovic, Pat Morin
2018 C conf
Approximability of Covering Cells with Line Segments.
COCOA
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
2018 J jnl
Approximability of Covering Cells with Line Segments.
CoRR
Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira
2018 A* conf
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs.
SoCG
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid, Shakhar Smorodinsky
2018 — conf
Boundary Labeling for Rectangular Diagrams.
SWAT
Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
2018 J jnl
Boundary Labeling for Rectangular Diagrams.
CoRR
Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
2018 J jnl
Bounded-Hop Communication Networks.
Algorithmica
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
2018 J jnl
Dual power assignment via second Hamiltonian cycle.
J. Comput. Syst. Sci.
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
2018 A* conf
Faster Algorithms for some Optimization Problems on Collinear Points.
SoCG
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018 J jnl
Faster Algorithms for some Optimization Problems on Collinear Points.
CoRR
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, J. Ian Munro, Michiel H. M. Smid
2018 A* conf
Geodesic Obstacle Representation of Graphs.
ICALP
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
2018 J jnl
Geodesic Obstacle Representation of Graphs.
CoRR
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira
2018 J jnl
Near-Optimal O(k)-Robust Geometric Spanners.
CoRR
Prosenjit Bose, Paz Carmi, Vida Dujmovic, Pat Morin
2018 J jnl
On the Minimum Consistent Subset Problem.
CoRR
Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
2018 J jnl
Selecting and covering colored points.
Discret. Appl. Math.
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
2018 J jnl
Stabbing Pairwise Intersecting Disks by Four Points.
CoRR
Paz Carmi, Matthew J. Katz, Pat Morin
2018 J jnl
Unique Coverage with Rectangular Regions.
Int. J. Comput. Geom. Appl.
Rom Aschner, Paz Carmi, Yael Stein
2017 B conf
Balanced Line Separators of Unit Disk Graphs.
WADS
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2017 J jnl
Balanced Line Separators of Unit Disk Graphs.
CoRR
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky
2017 — conf
Bottleneck Bichromatic Full Steiner Trees.
CCCG
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
2017 B conf
Efficient data retrieval in faulty sensor networks using a mobile mule.
WiOpt
Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
2017 B conf
Improved PTASs for Convex Barrier Coverage.
WAOA
Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein
2017 — conf
Monochromatic Plane Matchings in Bicolored Point Set.
CCCG
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
2017 B conf
Network Optimization on Partitioned Pairs of Points.
ISAAC
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
2017 J jnl
Network Optimization on Partitioned Pairs of Points.
CoRR
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
2017 J jnl
Strongly Connected Spanning Subgraph for Almost Symmetric Networks.
Int. J. Comput. Geom. Appl.
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
2017 B conf
\delta -Greedy t-spanner.
WADS
Gali Bar-On, Paz Carmi
2017 J jnl
δ-Greedy t-spanner.
CoRR
Gali Bar-On, Paz Carmi
2016 A conf
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.
GD
Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot
2016 J jnl
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.
CoRR
Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot
2016 J jnl
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere.
J. Comput. Geom.
Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu
2015 J jnl
Approximating the bottleneck plane perfect matching of a point set.
Comput. Geom.
A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid
2015 J jnl
Bottleneck Steiner tree with bounded number of Steiner vertices.
J. Discrete Algorithms
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
2015 B conf
Choice Is Hard.
ISAAC
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
2015 J jnl
Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discret. Comput. Geom.
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin
2015 A* conf
Compatible Connectivity-Augmentation of Planar Disconnected Graphs.
SODA
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin
2015 — conf
Conflict-free Covering.
CCCG
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
2015 J jnl
Minimum Dominating Set Problem for Unit Disks Revisited.
Int. J. Comput. Geom. Appl.
Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein
2015 B conf
On the Bounded-Hop Range Assignment Problem.
WADS
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
2015 B conf
On the Minimum Cost Range Assignment Problem.
ISAAC
Paz Carmi, Lilach Chaitman-Yerushalmi
2015 J jnl
On the Minimum Cost Range Assignment Problem.
CoRR
Paz Carmi, Lilach Chaitman-Yerushalmi
2015 J jnl
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere.
CoRR
Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid
2015 J jnl
Spiderman graph: Visibility in urban regions.
Comput. Geom.
Paz Carmi, Eran Friedman, Matthew J. Katz
2015 — conf
Strongly Connected Spanning Subgraph for Almost Symmetric Networks.
CCCG
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
2014 J jnl
Bottleneck non-crossing matching in the plane.
Comput. Geom.
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
2014 J jnl
Compatible Connectivity-Augmentation of Planar Disconnected Graphs.
CoRR
Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin
2014 J jnl
Dual Power Assignment via Second Hamiltonian Cycle.
CoRR
A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur
2014 C conf
Locating Battery Charging Stations to Facilitate Almost Shortest Paths.
ATMOS
Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal
2014 J jnl
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.
Algorithmica
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari
2014 J jnl
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition.
Discret. Comput. Geom.
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
2013 J jnl
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks.
Int. J. Comput. Geom. Appl.
Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy
2013 J jnl
Bounding the locality of distributed routing algorithms.
Distributed Comput.
Prosenjit Bose, Paz Carmi, Stephane Durocher
2013 J jnl
Minimum weight Euclidean t-spanner is NP-hard.
J. Discrete Algorithms
Paz Carmi, Lilach Chaitman-Yerushalmi
2013 J jnl
On the power of the semi-separated pair decomposition.
Comput. Geom.
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid
2013 J jnl
Stable Roommates Spanner.
Comput. Geom.
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman
2012 J jnl
An optimal algorithm for computing angle-constrained spanners.
J. Comput. Geom.
Paz Carmi, Michiel H. M. Smid
2012 J jnl
Bottleneck Non-Crossing Matching in the Plane
CoRR
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
2012 A conf
Bottleneck Non-crossing Matching in the Plane.
ESA
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
2012 J jnl
Editorial.
Comput. Geom.
Prosenjit Bose, Paz Carmi
2012 J jnl
Efficient model for indoor radio paths computation.
Simul. Model. Pract. Theory
Boaz Ben-Moshe, Paz Carmi, Moti Shani, Nir Shvalb
2012 J jnl
Minimum Weight Euclidean t-spanner is NP-Hard
CoRR
Paz Carmi, Lilach Chaitman-Yerushalmi
2012 J jnl
On bounded degree plane strong geometric spanners.
J. Discrete Algorithms
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi
2012 J jnl
The MST of symmetric disk graphs is light.
Comput. Geom.
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
2012 Misc conf
Unexplored Steiner Ratios in Geometric Networks.
COCOON
Paz Carmi, Lilach Chaitman-Yerushalmi
2011 J jnl
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss.
IEEE ACM Trans. Comput. Biol. Bioinform.
Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh
2011 — conf
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices.
CCCG
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz
2011 J jnl
Connectivity guarantees for wireless networks with directional antennas.
Comput. Geom.
Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén
2011 J jnl
Location-Oblivious Distributed Unit Disk Graph Coloring.
Algorithmica
Michel Barbeau, Prosenjit Bose, Paz Carmi, Mathieu Couture, Evangelos Kranakis
2011 J jnl
Minimum power energy spanners in wireless ad hoc networks.
Wirel. Networks
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
2011 B conf
Multi Cover of a Polygon Minimizing the Sum of Areas.
WALCOM
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern
2011 J jnl
Multi Cover of a Polygon Minimizing the Sum of Areas.
Int. J. Comput. Geom. Appl.
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern
2011 J jnl
On a family of strong geometric spanners that admit local routing strategies.
Comput. Geom.
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
2011 J jnl
Spanners of additively weighted point sets.
J. Discrete Algorithms
Prosenjit Bose, Paz Carmi, Mathieu Couture
2011 B conf
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.
WADS
Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari
2011 — conf
The euclidean bottleneck steiner path problem.
SCG
A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
2010 — conf
An Optimal Algorithm for Computing Angle-Constrained Spanners.
ISAAC (1)
Paz Carmi, Michiel H. M. Smid
2010 J jnl
Bounded Degree Planar Geometric Spanners
CoRR
Paz Carmi, Lilach Chaitman
2010 B conf
Communication-Efficient Construction of the Plane Localized Delaunay Graph.
LATIN
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu
2010 — conf
Computing Radio Paths in an Urban Environment.
CCNC
Boaz Ben-Moshe, Nir Shvalb, Moti Shani, Paz Carmi, Elhanan Shifman
2010 J jnl
Computing the Greedy Spanner in Near-Quadratic Time.
Algorithmica
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
2010 — conf
Direction assignment in wireless networks.
CCCG
Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein
2010 J jnl
Improved Methods For Generating Quasi-Gray Codes
CoRR
Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2010 — conf
Improved Methods For Generating Quasi-gray Codes.
SWAT
Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2010 A* conf
Minimum Power Energy Spanners in Wireless Ad Hoc Networks.
INFOCOM
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
2010 J jnl
On the Stretch Factor of Convex Delaunay Graphs.
J. Comput. Geom.
Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid
2010 — conf
Stable roommates and geometric spanners.
CCCG
Paz Carmi, Lilach Chaitman
2010 — conf
The MST of Symmetric Disk Graphs Is Light.
SWAT
A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz
2009 J jnl
A linear-space algorithm for distance preserving graph embedding.
Comput. Geom.
Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2009 A* conf
Bounding the locality of distributed routing algorithms.
PODC
Prosenjit Bose, Paz Carmi, Stephane Durocher
2009 J jnl
Geometric spanners with small chromatic number.
Comput. Geom.
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2009 J jnl
Matrix columns allocation problems.
Theor. Comput. Sci.
Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri
2009 J jnl
Minimum-Cost Load-Balancing Partitions.
Algorithmica
Boris Aronov, Paz Carmi, Matthew J. Katz
2009 B conf
On the Power of the Semi-Separated Pair Decomposition.
WADS
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid
2009 J jnl
Spanners of Complete k-Partite Geometric Graphs.
SIAM J. Comput.
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2008 J jnl
Approximating the Visible Region of a Point on a Terrain.
GeoInformatica
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
2008 J jnl
Communication-Efficient Construction of the Plane Localized Delaunay Graph
CoRR
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu
2008 — conf
Computing the Greedy Spanner in Near-Quadratic Time.
SWAT
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid
2008 J jnl
Distinct Distances in Graph Drawings.
Electron. J. Comb.
Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood
2008 J jnl
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem
CoRR
Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh
2008 C conf
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.
WABI
Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh
2008 J jnl
On the Stretch Factor of Convex Delaunay Graphs
CoRR
Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid
2008 B conf
On the Stretch Factor of Convex Delaunay Graphs.
ISAAC
Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid
2008 J jnl
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks.
Comput. Geom.
Paz Carmi, Matthew J. Katz, Nissan Lev-Tov
2008 J jnl
Private Approximation of Search Problems.
SIAM J. Comput.
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2008 B conf
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times.
ISAAC
Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi
2008 J jnl
Spanners of Additively Weighted Point Sets
CoRR
Prosenjit Bose, Paz Carmi, Mathieu Couture
2008 — conf
Spanners of Additively Weighted Point Sets.
SWAT
Prosenjit Bose, Paz Carmi, Mathieu Couture
2008 B conf
Spanners of Complete k -Partite Geometric Graphs.
LATIN
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2007 B conf
Covering Points by Unit Disks of Fixed Location.
ISAAC
Paz Carmi, Matthew J. Katz, Nissan Lev-Tov
2007 J jnl
Fault-Tolerant Power Assignment and Backbone in Wireless Networks.
Ad Hoc Sens. Wirel. Networks
Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin
2007 J jnl
Geometric Spanners With Small Chromatic Number
CoRR
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2007 B conf
Geometric Spanners with Small Chromatic Number.
WAOA
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
2007 — conf
Linear-Space Algorithms for Distance Preserving Embedding.
CCCG
Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
2007 B conf
Location Oblivious Distributed Unit Disk Graph Coloring.
SIROCCO
Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis
2007 B conf
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.
WADS
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
2007 J jnl
On a family of strong geometric spanners that admit local routing strategies
CoRR
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
2007 J jnl
Power Assignment in Radio Networks with Two Power Levels.
Algorithmica
Paz Carmi, Matthew J. Katz
2007 J jnl
Spanners of Complete $k$-Partite Geometric Graphs
CoRR
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid
2006 — conf
Fault-Tolerant Power Assignment and Backbone in Wireless Networks.
PerCom Workshops
Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin
2006 — conf
Minimum-cost load-balancing partitions.
SCG
Boris Aronov, Paz Carmi, Matthew J. Katz
2006 — conf
Power Assignment in Radio Networks with Two Power Levels.
Geometric Networks and Metric Space Embeddings
Paz Carmi, Matthew J. Katz
2006 A* conf
Private approximation of search problems.
STOC
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2006 J jnl
The minimum-area spanning tree problem.
Comput. Geom.
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
2005 J jnl
Geographic Quorum System Approximations.
Algorithmica
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal
2005 — conf
Minimum-Cost Load-Balancing Partitions.
CCCG
Paz Carmi, Matthew J. Katz
2005 J jnl
On the Fermat-Weber center of a convex object.
Comput. Geom.
Paz Carmi, Sariel Har-Peled, Matthew J. Katz
2005 J jnl
Private Approximation of Search Problems
Electron. Colloquium Comput. Complex.
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2005 B conf
The Minimum-Area Spanning Tree Problem.
WADS
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
2005 C conf
The minimum area spanning tree problem.
EuroCG
Paz Carmi, Matthew J. Katz
2004 — conf
Approximating the Visible Region of a Point on a Terrain.
ALENEX/ANALC
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
2004 J jnl
Computing all large sums-of-pairs in
Inf. Process. Lett.
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
2004 — conf
Power Assignment in Radio Networks with Two Power Levels.
SWAT
Paz Carmi, Matthew J. Katz
2003 B conf
Greedy Edge-Disjoint Paths in Complete Graphs.
WG
Paz Carmi, Thomas Erlebach, Yoshio Okamoto