Paz Carmi

2009
41	EE	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)
40	EE	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)
39	EE	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)
38	EE	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
37	EE	Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs. ISAAC 2008: 656-667
36	EE	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
35	EE	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
34	EE	Prosenjit Bose, Paz Carmi, Mathieu Couture: Spanners of Additively Weighted Point Sets. SWAT 2008: 367-377
33	EE	Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401
32	EE	Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86
31	EE	Prosenjit Bose, Paz Carmi, Mathieu Couture: Spanners of Additively Weighted Point Sets CoRR abs/0801.4013: (2008)
30	EE	Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel H. M. Smid: On the Stretch Factor of Convex Delaunay Graphs CoRR abs/0804.1041: (2008)
29	EE	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)
28	EE	Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu: Communication-Efficient Construction of the Plane Localized Delaunay Graph CoRR abs/0809.2956: (2008)
27	EE	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)
26	EE	Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz: Approximating the Visible Region of a Point on a Terrain. GeoInformatica 12(1): 21-36 (2008)
25	EE	Amos 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
23	EE	Paz Carmi, Matthew J. Katz, Nissan Lev-Tov: Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655
22	EE	Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis: Location Oblivious Distributed Unit Disk Graph Coloring. SIROCCO 2007: 222-233
21	EE	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
20	EE	Prosenjit 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)
18	EE	Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Algorithmica 47(2): 183-201 (2007)
17	EE	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)
16	EE	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)
15	EE	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
14	EE	Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. Geometric Networks and Metric Space Embeddings 2006
13	EE	Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84
12	EE	Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128
11	EE	Boris Aronov, Paz Carmi, Matthew J. Katz: Minimum-cost load-balancing partitions. Symposium on Computational Geometry 2006: 301-308
10	EE	Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The minimum-area spanning tree problem. Comput. Geom. 35(3): 218-225 (2006)
2005
9	EE	Paz Carmi, Matthew J. Katz: Minimum-Cost Load-Balancing Partitions. CCCG 2005: 65-67
8	EE	Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell: The Minimum-Area Spanning Tree Problem. WADS 2005: 195-204
7	EE	Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)
6	EE	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	EE	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	EE	Paz Carmi, Matthew J. Katz: Power Assignment in Radio Networks with Two Power Levels. SWAT 2004: 431-441
2	EE	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	EE	Paz Carmi, Thomas Erlebach, Yoshio Okamoto: Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155

Coauthor Index

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

Colors in the list of coauthors