default search action
Paz Carmi
Person information
- affiliation: Ben-Gurion University of the Negev, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j74]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. J. Graph Algorithms Appl. 28(3): 3-10 (2024) - [j73]A. Karim Abu-Affash, Sujoy Bhore
, Paz Carmi:
Dynamic Euclidean bottleneck matching. Theor. Comput. Sci. 1013: 114727 (2024) - 2023
- [j72]Sujoy Bhore
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85(1): 133-152 (2023) - [j71]Prosenjit Bose
Geodesic obstacle representation of graphs. Comput. Geom. 109: 101946 (2023) - [j70]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing pairwise intersecting geodesic disks by five points. Comput. Geom. 109: 101947 (2023) - [j69]Paz Carmi
Stabbing Pairwise Intersecting Disks by Four Points. Discret. Comput. Geom. 70(4): 1751-1784 (2023) - [c64]A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. WADS 2023: 1-14 - [c63]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. WALCOM 2023: 71-77 - [i39]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Dynamic Euclidean Bottleneck Matching. CoRR abs/2302.10513 (2023) - [i38]A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell:
Geometric Spanning Trees Minimizing the Wiener Index. CoRR abs/2303.01096 (2023) - 2022
- [j68]Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin:
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number. Electron. J. Comb. 29(3) (2022) - [j67]A. Karim Abu-Affash, Gali Bar-On, Paz Carmi
δ-Greedy t-spanner. Comput. Geom. 100: 101807 (2022) - [j66]Prosenjit Bose, Paz Carmi
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103: 101852 (2022) - [j65]A. Karim Abu-Affash
A linear-time algorithm for minimum k-hop dominating set of a cactus graph. Discret. Appl. Math. 320: 488-499 (2022) - [i37]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree. CoRR abs/2209.11260 (2022) - 2021
- [j64]Ahmad Biniaz
On the Minimum Consistent Subset Problem. Algorithmica 83(7): 2273-2302 (2021) - [j63]Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein:
Improved PTASs for convex barrier coverage. Comput. Geom. 92: 101684 (2021) - [j62]Prosenjit Bose
Piercing pairwise intersecting geodesic disks. Comput. Geom. 98: 101774 (2021) - [j61]A. Karim Abu-Affash, Paz Carmi
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. Discret. Comput. Geom. 66(4): 1401-1414 (2021) - [j60]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar bichromatic bottleneck spanning trees. J. Comput. Geom. 12(1): 109-127 (2021) - [j59]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing total interference in asymmetric sensor networks. Theor. Comput. Sci. 889: 171-181 (2021) - [i36]Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin:
2×n Grids have Unbounded Anagram-Free Chromatic Number. CoRR abs/2105.01916 (2021) - [i35]A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Pairwise Intersecting Geodesic Disks by Five Points. CoRR abs/2112.05962 (2021) - 2020
- [j58]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): 2784-2808 (2020) - [j57]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) - [j56]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Monochromatic plane matchings in bicolored point set. Inf. Process. Lett. 153 (2020) - [j55]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): 418-432 (2020) - [c62]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing Total Interference in Asymmetric Sensor Networks. ALGOSENSORS 2020: 1-16 - [c61]Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour:
Non-Crossing Matching of Online Points. CCCG 2020: 233-239 - [c60]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. ESA 2020: 1:1-1:16 - [c59]Sujoy Bhore
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT 2020: 13:1-13:18 - [i34]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Minimizing Total Interference in Asymmetric Sensor Networks. CoRR abs/2004.08847 (2020) - [i33]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell:
Planar Bichromatic Bottleneck Spanning Trees. CoRR abs/2004.08854 (2020) - [i32]Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR abs/2004.09220 (2020) - [i31]A. Karim Abu-Affash, Paz Carmi, Adi Krasin:
A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph. CoRR abs/2012.05869 (2020)
2010 – 2019
- 2019
- [j54]Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman:
Bottleneck detour tree of points on a path. Comput. Geom. 79: 30-36 (2019) - [j53]Paz Carmi, Lilach Chaitman-Yerushalmi, Bat-Chen Ozeri:
Minimizing the sum of distances to a server in a constraint network. Comput. Geom. 80: 1-12 (2019) - [j52]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: 10-16 (2019) - [j51]Paz Carmi
The Most Likely Object to be Seen Through a Window. Int. J. Comput. Geom. Appl. 29(4): 269-287 (2019) - [j50]A. Karim Abu-Affash
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142: 14-19 (2019) - [j49]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of covering cells with line segments. Theor. Comput. Sci. 784: 133-141 (2019) - [c58]Ahmad Biniaz, Sergio Cabello
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [c57]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: 211-224 - [i30]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 abs/1903.07024 (2019) - 2018
- [j48]Paz Carmi, Lilach Chaitman-Yerushalmi
Bounded-Hop Communication Networks. Algorithmica 80(11): 3050-3077 (2018) - [j47]Esther M. Arkin, Aritra Banik
Selecting and covering colored points. Discret. Appl. Math. 250: 75-86 (2018) - [j46]Rom Aschner, Paz Carmi
Unique Coverage with Rectangular Regions. Int. J. Comput. Geom. Appl. 28(4): 341-363 (2018) - [j45]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Dual power assignment via second Hamiltonian cycle. J. Comput. Syst. Sci. 93: 41-53 (2018) - [c56]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. COCOA 2018: 436-448 - [c55]A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin
Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. SoCG 2018: 2:1-2:12 - [c54]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: 8:1-8:14 - [c53]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani
Geodesic Obstacle Representation of Graphs. ICALP 2018: 23:1-23:13 - [c52]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. SWAT 2018: 12:1-12:14 - [c51]Paz Carmi, Vida Dujmovic, Pat Morin
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. WG 2018: 91-99 - [i29]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 abs/1802.09505 (2018) - [i28]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 abs/1803.03705 (2018) - [i27]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. CoRR abs/1803.10812 (2018) - [i26]Paz Carmi, Anil Maheshwari, Saeed Mehrabi, Luís Fernando Schultz Xavier da Silveira:
Approximability of Covering Cells with Line Segments. CoRR abs/1809.09979 (2018) - [i25]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 abs/1810.09232 (2018) - [i24]Paz Carmi, Matthew J. Katz, Pat Morin:
Stabbing Pairwise Intersecting Disks by Four Points. CoRR abs/1812.06907 (2018) - [i23]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Pat Morin:
Near-Optimal O(k)-Robust Geometric Spanners. CoRR abs/1812.09913 (2018) - 2017
- [j44]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. Int. J. Comput. Geom. Appl. 27(3): 207-220 (2017) - [c50]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi:
Monochromatic Plane Matchings in Bicolored Point Set. CCCG 2017: 7-12 - [c49]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck Bichromatic Full Steiner Trees. CCCG 2017: 13-18 - [c48]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: 6:1-6:12 - [c47]Gali Bar-On, Paz Carmi:
\delta -Greedy t-spanner. WADS 2017: 85-96 - [c46]Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto
Balanced Line Separators of Unit Disk Graphs. WADS 2017: 241-252 - [c45]Paz Carmi, Matthew J. Katz, Rachel Saban, Yael Stein:
Improved PTASs for Convex Barrier Coverage. WAOA 2017: 26-40 - [c44]Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Efficient data retrieval in faulty sensor networks using a mobile mule. WiOpt 2017: 1-8 - [i22]Gali Bar-On, Paz Carmi:
δ-Greedy t-spanner. CoRR abs/1702.05900 (2017) - [i21]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 abs/1709.02579 (2017) - [i20]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 abs/1710.00876 (2017) - 2016
- [j43]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): 444-472 (2016) - [c43]Nicolas Bonichon, Prosenjit Bose
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. GD 2016: 519-531 - [i19]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. CoRR abs/1608.08892 (2016) - 2015
- [j42]Paz Carmi, Eran Friedman, Matthew J. Katz:
Spiderman graph: Visibility in urban regions. Comput. Geom. 48(3): 251-259 (2015) - [j41]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): 718-731 (2015) - [j40]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati
Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discret. Comput. Geom. 54(2): 459-480 (2015) - [j39]Paz Carmi, Gautam K. Das, Ramesh K. Jallu
Minimum Dominating Set Problem for Unit Disks Revisited. Int. J. Comput. Geom. Appl. 25(3): 227- (2015) - [j38]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner tree with bounded number of Steiner vertices. J. Discrete Algorithms 30: 96-100 (2015) - [c42]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Strongly Connected Spanning Subgraph for Almost Symmetric Networks. CCCG 2015 - [c41]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Conflict-free Covering. CCCG 2015 - [c40]Paz Carmi, Lilach Chaitman-Yerushalmi:
On the Minimum Cost Range Assignment Problem. ISAAC 2015: 95-105 - [c39]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Choice Is Hard. ISAAC 2015: 318-328 - [c38]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. SODA 2015: 1602-1615 - [c37]Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi:
On the Bounded-Hop Range Assignment Problem. WADS 2015: 140-151 - [i18]Paz Carmi, Lilach Chaitman-Yerushalmi:
On the Minimum Cost Range Assignment Problem. CoRR abs/1502.04533 (2015) - [i17]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 abs/1507.06856 (2015) - 2014
- [j37]Prosenjit Bose
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. Algorithmica 69(2): 397-409 (2014) - [j36]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck non-crossing matching in the plane. Comput. Geom. 47(3): 447-457 (2014) - [j35]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): 1-23 (2014) - [c36]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: 25-33 - [i16]A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur:
Dual Power Assignment via Second Hamiltonian Cycle. CoRR abs/1402.5783 (2014) - [i15]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. CoRR abs/1408.2436 (2014) - 2013
- [j34]Prosenjit Bose
Stable Roommates Spanner. Comput. Geom. 46(2): 120-130 (2013) - [j33]Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid:
On the power of the semi-separated pair decomposition. Comput. Geom. 46(6): 631-639 (2013) - [j32]Prosenjit Bose
Bounding the locality of distributed routing algorithms. Distributed Comput. 26(1): 39-58 (2013) - [j31]Minati De
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. 23(6): 461- (2013) - [j30]Paz Carmi, Lilach Chaitman-Yerushalmi:
Minimum weight Euclidean t-spanner is NP-hard. J. Discrete Algorithms 22: 30-42 (2013) - 2012
- [j29]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
The MST of symmetric disk graphs is light. Comput. Geom. 45(1-2): 54-61 (2012) - [j28]Prosenjit Bose
Editorial. Comput. Geom. 45(9): 475 (2012) - [j27]Prosenjit Bose
On bounded degree plane strong geometric spanners. J. Discrete Algorithms 15: 16-31 (2012) - [j26]Paz Carmi, Michiel H. M. Smid:
An optimal algorithm for computing angle-constrained spanners. J. Comput. Geom. 3(1): 196-221 (2012) - [j25]Boaz Ben-Moshe, Paz Carmi, Moti Shani, Nir Shvalb:
Efficient model for indoor radio paths computation. Simul. Model. Pract. Theory 29: 163-172 (2012) - [c35]Paz Carmi, Lilach Chaitman-Yerushalmi:
Unexplored Steiner Ratios in Geometric Networks. COCOON 2012: 275-286 - [c34]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi
Bottleneck Non-crossing Matching in the Plane. ESA 2012: 36-47 - [i14]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi:
Bottleneck Non-Crossing Matching in the Plane. CoRR abs/1202.4146 (2012) - [i13]Paz Carmi, Lilach Chaitman-Yerushalmi:
Minimum Weight Euclidean t-spanner is NP-Hard. CoRR abs/1209.0679 (2012) - 2011
- [j24]Michel Barbeau
Location-Oblivious Distributed Unit Disk Graph Coloring. Algorithmica 60(2): 236-249 (2011) - [j23]Prosenjit Bose
On a family of strong geometric spanners that admit local routing strategies. Comput. Geom. 44(6-7): 319-328 (2011) - [j22]Paz Carmi, Matthew J. Katz, Zvi Lotker, Adi Rosén:
Connectivity guarantees for wireless networks with directional antennas. Comput. Geom. 44(9): 477-485 (2011) - [j21]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
Multi Cover of a Polygon Minimizing the Sum of Areas. Int. J. Comput. Geom. Appl. 21(6): 685-698 (2011) - [j20]Prosenjit Bose
Spanners of additively weighted point sets. J. Discrete Algorithms 9(3): 287-298 (2011) - [j19]Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh:
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE ACM Trans. Comput. Biol. Bioinform. 8(2): 551-556 (2011) - [j18]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
Minimum power energy spanners in wireless ad hoc networks. Wirel. Networks 17(5): 1251-1258 (2011) - [c33]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz:
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices. CCCG 2011 - [c32]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal
The euclidean bottleneck steiner path problem. SCG 2011: 440-447 - [c31]Prosenjit Bose
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146 - [c30]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
Multi Cover of a Polygon Minimizing the Sum of Areas. WALCOM 2011: 134-145 - 2010
- [j17]Prosenjit Bose
Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010) - [j16]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. J. Comput. Geom. 1(1): 41-56 (2010) - [c29]Paz Carmi, Lilach Chaitman:
Stable roommates and geometric spanners. CCCG 2010: 31-34 - [c28]Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein:
Direction assignment in wireless networks. CCCG 2010: 39-42 - [c27]Boaz Ben-Moshe, Nir Shvalb, Moti Shani, Paz Carmi, Elhanan Shifman:
Computing Radio Paths in an Urban Environment. CCNC 2010: 1-5 - [c26]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
Minimum Power Energy Spanners in Wireless Ad Hoc Networks. INFOCOM 2010: 2411-2416 - [c25]Paz Carmi, Michiel H. M. Smid:
An Optimal Algorithm for Computing Angle-Constrained Spanners. ISAAC (1) 2010: 316-327 - [c24]Prosenjit Bose
Communication-Efficient Construction of the Plane Localized Delaunay Graph. LATIN 2010: 282-293 - [c23]Prosenjit Bose
Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235 - [c22]A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz:
The MST of Symmetric Disk Graphs Is Light. SWAT 2010: 236-247 - [i12]Paz Carmi, Lilach Chaitman:
Bounded Degree Planar Geometric Spanners. CoRR abs/1003.4963 (2010) - [i11]Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Improved Methods For Generating Quasi-Gray Codes. CoRR abs/1010.0905 (2010)
2000 – 2009
- 2009
- [j15]Boris Aronov
Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009) - [j14]Prosenjit Bose
Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009) - [j13]Tetsuo Asano, Prosenjit Bose
A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009) - [j12]Prosenjit Bose
Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009) - [j11]Amos Beimel
Matrix columns allocation problems. Theor. Comput. Sci. 410(21-23): 2174-2183 (2009) - [c21]Prosenjit Bose
Bounding the locality of distributed routing algorithms. PODC 2009: 250-259 - [c20]Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid:
On the Power of the Semi-Separated Pair Decomposition. WADS 2009: 1-12 - 2008
- [j10]Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood:
Distinct Distances in Graph Drawings. Electron. J. Comb. 15(1) (2008) - [j9]Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. Comput. Geom. 39(3): 209-218 (2008) - [j8]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz:
Approximating the Visible Region of a Point on a Terrain. GeoInformatica 12(1): 21-36 (2008) - [j7]Amos Beimel
Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008) - [c19]Prosenjit Bose
On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667 - [c18]Binay K. Bhattacharya, Paz Carmi, Yuzhuang Hu, Qiaosheng Shi:
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. ISAAC 2008: 800-811 - [c17]Prosenjit Bose
Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181 - [c16]Prosenjit Bose
Spanners of Additively Weighted Point Sets. SWAT 2008: 367-377 - [c15]Prosenjit Bose
Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401 - [c14]Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86 - [i10]Prosenjit Bose, Paz Carmi, Mathieu Couture:
Spanners of Additively Weighted Point Sets. CoRR abs/0801.4013 (2008) - [i9]Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid:
On the Stretch Factor of Convex Delaunay Graphs. CoRR abs/0804.1041 (2008) - [i8]Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh:
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. CoRR abs/0805.1661 (2008) - [i7]Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu:
Communication-Efficient Construction of the Plane Localized Delaunay Graph. CoRR abs/0809.2956 (2008) - 2007
- [j6]Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin:
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc Sens. Wirel. Networks 4(4): 355-366 (2007) - [j5]Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007) - [c13]Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188 - [c12]Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655 - [c11]Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis:
Location Oblivious Distributed Unit Disk Graph Coloring. SIROCCO 2007: 222-233 - [c10]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. WADS 2007: 300-311 - [c9]Prosenjit Bose
Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88 - [i6]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners With Small Chromatic Number. CoRR abs/0711.0114 (2007) - [i5]Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid:
Spanners of Complete $k$-Partite Geometric Graphs. CoRR abs/0712.0554 (2007) - [i4]Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a family of strong geometric spanners that admit local routing strategies. CoRR abs/cs/0702117 (2007) - 2006
- [j4]Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006) - [c8]Boris Aronov, Paz Carmi, Matthew J. Katz:
Minimum-cost load-balancing partitions. SCG 2006: 301-308 - [c7]Paz Carmi, Michael Segal
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84 - [c6]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private approximation of search problems. STOC 2006: 119-128 - [i3]Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. Geometric Networks and Metric Space Embeddings 2006 - 2005
- [j3]Paz Carmi, Shlomi Dolev
Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005) - [j2]Paz Carmi, Sariel Har-Peled
On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005) - [c5]Paz Carmi, Matthew J. Katz:
Minimum-Cost Load-Balancing Partitions. CCCG 2005: 65-67 - [c4]Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell:
The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204 - [i2]Paz Carmi, Matthew J. Katz:
The minimum area spanning tree problem. EuroCG 2005: 191-194 - [i1]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private Approximation of Search Problems. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j1]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz:
Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. Inf. Process. Lett. 89(3): 137-139 (2004) - [c3]Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz:
Approximating the Visible Region of a Point on a Terrain. ALENEX/ANALC 2004: 120-128 - [c2]Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441 - 2003
- [c1]Paz Carmi, Thomas Erlebach, Yoshio Okamoto:
Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155
Coauthor Index
Lilach Chaitman-Yerushalmi
aka: Lilach Chaitman
aka: Lilach Chaitman
[j69] [j63] [j59] [j58] [j57] [c62] [i34] [j54] [j52] [j47] [i24] [c48] [c46] [c45] [c44] [i21] [i20] [j42] [j38] [c41] [c39] [j37] [j36] [j35] [c36] [j34] [j29] [c34] [i14] [j22] [j21] [j18] [c33] [c32] [c31] [c30] [c28] [c26] [c22] [j15] [j9] [j8] [j6] [j5] [c12] [j4] [c8] [c7] [i3] [j3] [j2] [c5] [c4] [i2] [j1] [c3] [c2]
Michiel H. M. Smid
aka: Michiel Smid
aka: Michiel Smid
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: