dblp.uni-trier.dewww.uni-trier.de

Paz Carmi Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
44EEProsenjit Bose, Paz Carmi, Stephane Durocher: Bounding the locality of distributed routing algorithms. PODC 2009: 250-259
43EEMohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid: On the Power of the Semi-Separated Pair Decomposition. WADS 2009: 1-12
42EEBoris Aronov, Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. Algorithmica 54(3): 318-336 (2009)
41EEProsenjit 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)
40EETetsuo 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)
39EEProsenjit 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)
38EEAmos 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
37EEProsenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667
36EEBinay 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
35EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181
34EEProsenjit Bose, Paz Carmi, Mathieu Couture: Spanners of Additively Weighted Point Sets. SWAT 2008: 367-377
33EEProsenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401
32EEGlenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86
31EEProsenjit Bose, Paz Carmi, Mathieu Couture: Spanners of Additively Weighted Point Sets CoRR abs/0801.4013: (2008)
30EEProsenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs CoRR abs/0804.1041: (2008)
29EEGlenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem CoRR abs/0805.1661: (2008)
28EEProsenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu: Communication-Efficient Construction of the Plane Localized Delaunay Graph CoRR abs/0809.2956: (2008)
27EEPaz 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)
26EEBoaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. GeoInformatica 12(1): 21-36 (2008)
25EEAmos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008)
2007
24 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
23EEPaz Carmi, Matthew J. Katz, Nissan Lev-Tov: Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655
22EEMathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis: Location Oblivious Distributed Unit Disk Graph Coloring. SIROCCO 2007: 222-233
21EEProsenjit 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
20EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88
19 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)
18EEPaz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007)
17EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners With Small Chromatic Number CoRR abs/0711.0114: (2007)
16EEProsenjit 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)
15EEProsenjit 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
14EEPaz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Geometric Networks and Metric Space Embeddings 2006
13EEPaz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84
12EEAmos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128
11EEBoris Aronov, Paz Carmi, Matthew J. Katz: Minimum-cost load-balancing partitions. Symposium on Computational Geometry 2006: 301-308
10EEPaz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006)
2005
9EEPaz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. CCCG 2005: 65-67
8EEPaz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204
7EEPaz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)
6EEPaz Carmi, Sariel Har-Peled, Matthew J. Katz: On the Fermat-Weber center of a convex object. Comput. Geom. 32(3): 188-195 (2005)
5EEAmos 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
3EEPaz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441
2EEBoaz 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
1EEPaz Carmi, Thomas Erlebach, Yoshio Okamoto: Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155

Coauthor Index

1Mohammad Ali Abam [43]
2Boris Aronov [11] [42]
3Tetsuo Asano [24] [40]
4Michel Barbeau [22]
5Amos Beimel [5] [12] [25] [38]
6Boaz Ben-Moshe [2] [4] [26] [38]
7Yehuda Ben-Shimol [38]
8Binay K. Bhattacharya [36]
9Prosenjit Bose [15] [16] [17] [20] [21] [22] [24] [28] [30] [31] [33] [34] [35] [37] [39] [40] [41] [44]
10Eldad Chai [38]
11Sébastien Collette [30] [37]
12Mathieu Couture [15] [16] [17] [20] [21] [22] [31] [34] [35] [39] [41]
13Shlomi Dolev [7]
14Stephane Durocher [44]
15Thomas Erlebach [1]
16Mohammad Farshi [33] [43]
17Sariel Har-Peled [6] [7]
18Glenn Hickey [29] [32]
19Yuzhuang Hu [36]
20Matthew J. Katz (Matya Katz) [2] [3] [4] [6] [7] [8] [9] [10] [11] [13] [14] [18] [19] [23] [26] [27] [42]
21Itzik Kitroser [38]
22Evangelos Kranakis [22]
23Nissan Lev-Tov [23] [27]
24Anil Maheshwari [16] [17] [20] [24] [29] [32] [33] [35] [39] [40] [41]
25Joseph S. B. Mitchell [8] [10]
26Pat Morin [16] [35] [39]
27Kobbi Nissim [5] [12] [25]
28Yoshio Okamoto [1]
29Eran Omri [38]
30Michael Segal [7] [13] [19]
31Qiaosheng Shi [36]
32Hanan Shpungin [13] [19]
33Chang Shu [24] [40]
34Michiel H. M. Smid [15] [16] [17] [20] [21] [24] [28] [30] [33] [35] [37] [39] [40] [41] [43]
35Enav Weinreb [5] [12] [25]
36Stefanie Wuhrer [24] [40]
37Daming Xu [15] [21] [28]
38Norbert Zeh [17] [20] [29] [32] [41]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)