![]() | ![]() |
| 2012 | ||
|---|---|---|
| 70 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Yohai Trabelsi: Bottleneck Non-Crossing Matching in the Plane CoRR abs/1202.4146: (2012) | |
| 69 | 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) | |
| 2011 | ||
| 68 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz: Bottleneck Steiner Tree with Bounded Number of Steiner Vertices. CCCG 2011 | |
| 67 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal: The euclidean bottleneck steiner path problem. Symposium on Computational Geometry 2011: 440-447 | |
| 66 | 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. WADS 2011: 134-146 | |
| 65 | 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 | |
| 64 | Michel Barbeau, Prosenjit Bose, Paz Carmi, Mathieu Couture, Evangelos Kranakis: Location-Oblivious Distributed Unit Disk Graph Coloring. Algorithmica 60(2): 236-249 (2011) | |
| 63 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu: On a family of strong geometric spanners that admit local routing strategies. Comput. Geom. 44(6-7): 319-328 (2011) | |
| 62 | 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) | |
| 61 | 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. Biology Bioinform. 8(2): 551-556 (2011) | |
| 60 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern: Multi Cover of a Polygon Minimizing the Sum of Areas. Int. J. Comput. Geometry Appl. 21(6): 685-698 (2011) | |
| 59 | Prosenjit Bose, Paz Carmi, Mathieu Couture: Spanners of additively weighted point sets. J. Discrete Algorithms 9(3): 287-298 (2011) | |
| 58 | A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: Minimum power energy spanners in wireless ad hoc networks. Wireless Networks 17(5): 1251-1258 (2011) | |
| 2010 | ||
| 57 | Paz Carmi, Lilach Chaitman: Stable roommates and geometric spanners. CCCG 2010: 31-34 | |
| 56 | Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew J. Katz, Gila Morgenstern, Yael Stein: Direction assignment in wireless networks. CCCG 2010: 39-42 | |
| 55 | A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: Minimum Power Energy Spanners in Wireless Ad Hoc Networks. INFOCOM 2010: 2411-2416 | |
| 54 | Paz Carmi, Michiel H. M. Smid: An Optimal Algorithm for Computing Angle-Constrained Spanners. ISAAC (1) 2010: 316-327 | |
| 53 | Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu: Communication-Efficient Construction of the Plane Localized Delaunay Graph. LATIN 2010: 282-293 | |
| 52 | Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235 | |
| 51 | A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: The MST of Symmetric Disk Graphs Is Light. SWAT 2010: 236-247 | |
| 50 | Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010) | |
| 49 | Paz Carmi, Lilach Chaitman: Bounded Degree Planar Geometric Spanners CoRR abs/1003.4963: (2010) | |
| 48 | 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) | |
| 47 | Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. JoCG 1(1): 41-56 (2010) | |
| 2009 | ||
| 46 | Prosenjit Bose, Paz Carmi, Stephane Durocher: Bounding the locality of distributed routing algorithms. PODC 2009: 250-259 | |
| 45 | Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid: On the Power of the Semi-Separated Pair Decomposition. WADS 2009: 1-12 | |
| 44 | Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009) | |
| 43 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009) | |
| 42 | Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009) | |
| 41 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009) | |
| 40 | Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri: Matrix columns allocation problems. Theor. Comput. Sci. 410(21-23): 2174-2183 (2009) | |
| 2008 | ||
| 39 | Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667 | |
| 38 | 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 | |
| 37 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181 | |
| 36 | Prosenjit Bose, Paz Carmi, Mathieu Couture: Spanners of Additively Weighted Point Sets. SWAT 2008: 367-377 | |
| 35 | Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401 | |
| 34 | Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86 | |
| 33 | Prosenjit Bose, Paz Carmi, Mathieu Couture: Spanners of Additively Weighted Point Sets CoRR abs/0801.4013: (2008) | |
| 32 | Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs CoRR abs/0804.1041: (2008) | |
| 31 | 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) | |
| 30 | Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu: Communication-Efficient Construction of the Plane Localized Delaunay Graph CoRR abs/0809.2956: (2008) | |
| 29 | 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) | |
| 28 | Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood: Distinct Distances in Graph Drawings. Electr. J. Comb. 15(1): (2008) | |
| 27 | Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. GeoInformatica 12(1): 21-36 (2008) | |
| 26 | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008) | |
| 2007 | ||
| 25 | 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 | |
| 24 | Paz Carmi, Matthew J. Katz, Nissan Lev-Tov: Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655 | |
| 23 | Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis: Location Oblivious Distributed Unit Disk Graph Coloring. SIROCCO 2007: 222-233 | |
| 22 | 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 | |
| 21 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88 | |
| 20 | Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc & Sensor Wireless Networks 4(4): 355-366 (2007) | |
| 19 | Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007) | |
| 18 | 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) | |
| 17 | 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) | |
| 16 | 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 | ||
| 15 | Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Geometric Networks and Metric Space Embeddings 2006 | |
| 14 | Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84 | |
| 13 | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128 | |
| 12 | Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-cost load-balancing partitions. Symposium on Computational Geometry 2006: 301-308 | |
| 11 | Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006) | |
| 2005 | ||
| 10 | Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. CCCG 2005: 65-67 | |
| 9 | Paz Carmi, Matthew J. Katz: The minimum area spanning tree problem. EuroCG 2005: 191-194 | |
| 8 | Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204 | |
| 7 | Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005) | |
| 6 | Paz Carmi, Sariel Har-Peled, Matthew J. Katz: On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005) | |
| 5 | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems Electronic Colloquium on Computational Complexity (ECCC)(141): (2005) | |
| 2004 | ||
| 4 | Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. ALENEX/ANALC 2004: 120-128 | |
| 3 | Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441 | |
| 2 | 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) | |
| 2003 | ||
| 1 | Paz Carmi, Thomas Erlebach, Yoshio Okamoto: Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page