Home
Publications
CV
Links
Personal




Invite:
50 left
preview Invite
Personal Website

Paz Carmi's Publications

Journal publications

  1. Prosenjit Bose, Paz Carmi, Sebastien Collette, Michiel Smid. On the stretch factor of convex Delaunay graphs. Journal of Computational Geometry, volume 1, 2010, pp. 41-56.
  2. Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer. Linear-Space Algorithms for Distance Preserving Embedding Computational Geometry: Theory and Applications (CGTA) 42(4): 289-304 (2009).
  3. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin and Michiel Smid. Spanners of Complete $k$-Partite Geometric Graphs. SIAM Journal on Computing (SICOMP)38(5): 1803-1820 (2009).
  4. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel Smid and Norbert Zeh. Geometric Spanners With Small Chromatic Number. Computational Geometry: Theory and Applications (CGTA) 42(2): 134-146 (2009).
  5. Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri. Matrix Columns Allocation Problems Theoretical Computer Science (TCS)410(21-23): 2174-2183 (2009).
  6. Amos Beimel, Paz Carmi, Kobbi Nissim and Enav Weinreb. Private Approximation of Search Problems. SIAM Journal on Computing (SICOMP), 38(5): 1728-1760 (2008).
  7. Paz Carmi, Vida Dujmović, Pat Morin, and David R. Wood. Distinct distances in graph drawings The Electronic Journal of Combinatorics 15:R107, 2008.
  8. Boaz Ben-Moshe, Paz Carmi and Matthew J. Katz. Approximating the Visible Region of a Point on a Terrain. GeoInformatica, 12(1): 21-36 (2008).
  9. Paz Carmi, Matthew J. Katz and Nissan Lev-Tov. Polynomial time approximation schemes for piercing and covering with applications in wireless networks. Computational Geometry: Theory and Applications, 39(3): 209-218 (2008).
  10. Boris Aronov, Paz Carmi and Matthew J. Katz. Minimum-Cost Load-Balancing Partitions. Accepted to Algorithmica, 2007.
  11. Paz Carmi, Matthew J. Katz, Michael Segal and Hanan Shpungin. Fault-tolerant power assignment and backbone in wireless networks. Accepted to Ad Hoc & Sensor Wireless Networks, 4(4): 355-366 (2007).
  12. Paz Carmi and Matthew J. Katz. Power assignment in radio networks with two power levels. Algorithmica 47(:2) (2007), pp. 183-201.
  13. Paz Carmi, Matthew J. Katz and Joseph S. B. Mitchell. The Minimum-Area Spanning Tree Problem. Computational Geometry: Theory and Applications 35(:3) (2006), pp. 218-225.
  14. Paz Carmi, Sariel Har-Peled and Matthew J. Katz. On the Fermat-Weber center of a convex object. Computational Geometry: Theory and Applications 32:(3) (2005), pp. 188-195.
  15. Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz and Michael Segal. Geographic quorum systems approximations. Algorithmica 41 (2005), pp. 233-244.
  16. Boaz Ben-Moshe, Paz Carmi and Matthew J. Katz. Computing all large sums-of-pairs in Rn and the discrete planar two-watchtower problem. Inf. Proc. Letters 89 (2004), pp. 137-139.
  17. Michel Barbeau, Prosenjit Bose, Paz Carmi, Mathieu Couture and Evangelos Kranakis. Location Oblivious Distributed Unit Disk Graph Coloring. Accepted to: Algorithmica.
  18. Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari and Michiel Smid. Computing the greedy spanner in near-quadratic time. Accepted to: Algorithmica.
  19. Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel Smid and Daming Xu. On a family of strong geometric spanners that admit local routing strategies, Accepted to Computational Geometry: Theory and Applications.
  20. Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh. NAPX: A polynomial time approximation scheme for the Noah's ark problem. Accepted to IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Conference papers

  1. Paz Carmi, Michiel Smid. An optimal algorithm for computing angle-constrained spanners ISAAC 2010, to appear.
  2. Paz Carmi, Lilach Chaitman. Stable Roommates and Geometric Spanners Proc. of the 22nd Annual Canadian Conference on Computational Geometry (CCCG 2010)
  3. Boaz Ben-Moshe, Paz Carmi, Lilach Chaitman, Matthew Katz, Gila Morgenstern, Yael Stein. Direction Assignment in Wireless Networks. Proc. of the 22nd Annual Canadian Conference on Computational Geometry (CCCG 2010).
  4. Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid. Improved Methods For Generating Quasi-gray Codes. Proc. of the 12th Scandinavian Workshop on Algorithm Theory (SWAT 2010), 2010, 224--235
  5. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz. The MST of Symmetric Disk Graphs Is Light. Proc. of the 12th Scandinavian Workshop on Algorithm Theory (SWAT 2010), 2010, 236--247
  6. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz Minimum Power Energy Spanners in Wireless Ad Hoc Networks. Accepted to the 29th Conference on Computer Communications (INFOCOM 2010).
  7. Prosenjit Bose, Paz Carmi, Michiel Smid, Daming Xu Communication-Efficient Construction of the Plane Localized Delaunay Graph. Accepted to the 9th Latin American Theoretical Informatics Symposium (LATIN 2010).
  8. Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid On the Power of the Semi-Separated Pair Decomposition. Proc. of the 11th International Symposium on Algorithms and Data Structures, (WADS 2009), 2009 pp. 1-12.
  9. Prosenjit Bose, Paz Carmi, Stephane Durocher. Bounding the locality of distributed routing algorithms. Proc. of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC 2009), 2009 pp. 250-259.
  10. Prosenjit Bose, Paz Carmi, Sebastien Collette and Michiel Smid. On the Stretch Factor of Convex Delaunay Graphs. Accepted to the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 2008.
  11. Binay Bhattacharya, Paz Carmi, Yuzhuang Hu and Qiaosheng Shi. Single Vehicle Scheduling Problem on Networks with Release and Handling Times. Accepted to the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 2008.
  12. Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh. NAPX: A polynomial time approximation scheme for the Noah's ark problem. Accepted to the 8th Workshop on Algorithms in Bioinformatics (WABI 2008), 2008.
  13. Prosenjit Bose, Paz Carmi, Mathieu Couture. Spanners of Additively Weighted Point Sets. Accepted to the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), 2008.
  14. Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari and Michiel Smid. Computing the greedy spanner in near-quadratic time. Accepted to the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), 2008.
  15. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin and Michiel Smid. Spanners of Complete $k$-Partite Geometric Graphs. Proc. of the 8th Latin American Theoretical Informatics Symposium (LATIN 2008), 2008, pp. 170-181.
  16. Paz Carmi, Matthew Katz and Nissan Lev-Tov. Covering Points by Unit Disks of Fixed Location. Proc. of the 18th International Symposium on Algorithms and Computation (ISAAC 2007), 2007, pp. 644-655.
  17. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel Smid and Norbert Zeh. Geometric Spanners With Small Chromatic Number. Proc. of the 5th Workshop on Approximation and Online Algorithms (WAOA 2007), 2007, pp. 75-88.
  18. Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel Smid and Stefanie Wuhrer. Linear-Space Algorithms for Distance Preserving Embedding. Proc. of the 19th Annual Canadian Conference on Computational Geometry (CCCG 2007), 2007, pp. 185-188.
  19. Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel Smid and Daming Xu. On a family of strong geometric spanners that admit local routing strategies. Proc. of the 10th Workshop on Algorithms and Data Structures (WADS 2007), 2007, pp. 300-311.
  20. M. Couture, M. Barbeau, P. Bose, P. Carmi and E. K. Ranakis. Location Oblivious Distributed Unit Disk Graph Coloring. Proc. of the International Colloquium on Structural Information and Communication (SIROCCO), 2007, pp. 222-233.
  21. Amos Beimel, Paz Carmi, Kobbi Nissim and Enav Weinreb. Private approximation of search problems. Proc. of the 38th ACM Symposium on Theory of Computing (STOC 2006), 2006, pp. 119-128.
  22. Paz Carmi, Matthew J. Katz, Michael Segal and Hanan Shpungin. Fault-tolerant power assignment and backbone in wireless networks. Proc. of the 4th annual IEEE International Conference on Foundation and Algorithms for Wireless Networking (FAWN 2006), 2006, p. 80.
  23. Boris Aronov, Paz Carmi and Matthew J. Katz. Minimum-Cost Load-Balancing Partitions. Proc. of the 22nd Annual Symposium on Computational Geometry (SOCG 2006), 2006, pp. 301-308. (See also Proc. of the 17th Canadian Conference on Computational Geometry, 2005, pp. 63-65.)
  24. Paz Carmi, Matthew J. Katz and Joseph S. B. Mitchell. The Minimum-Area Spanning Tree Problem. Workshop on Algorithms and Data Structures, 2005, pp. 195-204.
  25. Paz Carmi and Matthew J. Katz. Power assignment in radio networks with two power levels. Proc. of the 9th Scandinavian Workshop on Algorithm Theory, 2004, pp. 431-441.
  26. Boaz Ben-Moshe, Paz Carmi and Matthew J. Katz. Approximating the Visible Region of a Point on a Terrain. Proc. of the Algorithm Engineering and Experiments (ALENEX'04), 2004, pp. 120-128. (See also Proc. of the 19th European Workshop on Computational Geometry, 2003, pp. 121-124).
  27. Paz Carmi, Thomas Erlebach and Yoshio Okamoto. Greedy edge-disjoint paths in complete graphs. Proc. of the 29th Workshop on Graph Theoretic Concepts in Computer Science (WG2003), 2003, pp. 143-155. (See also Lecture Notes in Computer Science, vol. 2880).
  28. Paz Carmi, Yefim Dinitz, Shahar Golan and Guy Rozenwald. An O(|V||E|) Algorithm for the AND/OR Scheduling Problem: The General Case. Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, 2003.
  29. Paz Carmi and Matthew J. Katz. Minimizing the Convex Hull via Local Transfers. Proc. 17th European Workshop on Computational Geometry, 2001, pp. 105-108.