The SCEAS System
| |||||||

## Search the dblp DataBase
Paz Carmi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
**Approximating the Visible Region of a Point on a Terrain.**[Citation Graph (0, 0)][DBLP] ALENEX/ANALC, 2004, pp:120-128 [Conf] - Paz Carmi, Matthew J. Katz
**Minimum-Cost Load-Balancing Partitions.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:65-67 [Conf] - Boris Aronov, Paz Carmi, Matthew J. Katz
**Minimum-cost load-balancing partitions.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2006, pp:301-308 [Conf] - Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin
**Fault-Tolerant Power Assignment and Backbone in Wireless Networks.**[Citation Graph (0, 0)][DBLP] PerCom Workshops, 2006, pp:80-84 [Conf] - Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
**Private approximation of search problems.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:119-128 [Conf] - Paz Carmi, Matthew J. Katz
**Power Assignment in Radio Networks with Two Power Levels.**[Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:431-441 [Conf] - Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
**The Minimum-Area Spanning Tree Problem.**[Citation Graph (0, 0)][DBLP] WADS, 2005, pp:195-204 [Conf] - Paz Carmi, Thomas Erlebach, Yoshio Okamoto
**Greedy Edge-Disjoint Paths in Complete Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2003, pp:143-155 [Conf] - Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal
**Geographic Quorum System Approximations.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:41, n:4, pp:233-244 [Journal] - Paz Carmi, Sariel Har-Peled, Matthew J. Katz
**On the Fermat-Weber center of a convex object.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:3, pp:188-195 [Journal] - Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
**The minimum-area spanning tree problem.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:35, n:3, pp:218-225 [Journal] - Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
**Private Approximation of Search Problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:141, pp:- [Journal] - Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
**Computing all large sums-of-pairs in**[Citation Graph (0, 0)][DBLP]_{Rn}and the discrete planar two-watchtower problem. Inf. Process. Lett., 2004, v:89, n:3, pp:137-139 [Journal] - Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
**Linear-Space Algorithms for Distance Preserving Embedding.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:185-188 [Conf] - Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis
**Location Oblivious Distributed Unit Disk Graph Coloring.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2007, pp:222-233 [Conf] - Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
**On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.**[Citation Graph (0, 0)][DBLP] WADS, 2007, pp:300-311 [Conf] - Paz Carmi, Matthew J. Katz
**Power Assignment in Radio Networks with Two Power Levels.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:47, n:2, pp:183-201 [Journal] - Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu
**On a family of strong geometric spanners that admit local routing strategies**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Stable roommates and geometric spanners.**[Citation Graph (, )][DBLP]**Direction assignment in wireless networks.**[Citation Graph (, )][DBLP]**Power Assignment in Radio Networks with Two Power Levels.**[Citation Graph (, )][DBLP]**The minimum area spanning tree problem.**[Citation Graph (, )][DBLP]**Minimum Power Energy Spanners in Wireless Ad Hoc Networks.**[Citation Graph (, )][DBLP]**Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times.**[Citation Graph (, )][DBLP]**Covering Points by Unit Disks of Fixed Location.**[Citation Graph (, )][DBLP]**On the Stretch Factor of Convex Delaunay Graphs.**[Citation Graph (, )][DBLP]**Communication-Efficient Construction of the Plane Localized Delaunay Graph.**[Citation Graph (, )][DBLP]**Spanners of Complete k -Partite Geometric Graphs.**[Citation Graph (, )][DBLP]**Bounding the locality of distributed routing algorithms.**[Citation Graph (, )][DBLP]**Computing the Greedy Spanner in Near-Quadratic Time.**[Citation Graph (, )][DBLP]**Spanners of Additively Weighted Point Sets.**[Citation Graph (, )][DBLP]**The MST of Symmetric Disk Graphs Is Light.**[Citation Graph (, )][DBLP]**Improved Methods For Generating Quasi-gray Codes.**[Citation Graph (, )][DBLP]**NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.**[Citation Graph (, )][DBLP]**On the Power of the Semi-Separated Pair Decomposition.**[Citation Graph (, )][DBLP]**Geometric Spanners with Small Chromatic Number.**[Citation Graph (, )][DBLP]**Minimum-Cost Load-Balancing Partitions.**[Citation Graph (, )][DBLP]**Polynomial-time approximation schemes for piercing and covering with applications in wireless networks.**[Citation Graph (, )][DBLP]**A linear-space algorithm for distance preserving graph embedding.**[Citation Graph (, )][DBLP]**Geometric spanners with small chromatic number.**[Citation Graph (, )][DBLP]**Geometric Spanners With Small Chromatic Number**[Citation Graph (, )][DBLP]**Spanners of Complete $k$-Partite Geometric Graphs**[Citation Graph (, )][DBLP]**Spanners of Additively Weighted Point Sets**[Citation Graph (, )][DBLP]**On the Stretch Factor of Convex Delaunay Graphs**[Citation Graph (, )][DBLP]**NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem**[Citation Graph (, )][DBLP]**Communication-Efficient Construction of the Plane Localized Delaunay Graph**[Citation Graph (, )][DBLP]**Bounded Degree Planar Geometric Spanners**[Citation Graph (, )][DBLP]
Search in 0.051secs, Finished in 0.053secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |