( en | de | ru )

 

Disambiguation of "Carmi, Paz"

Author of the publication

copydeleteadd this publication to your clipboard
Switching to Directional Antennas with Constant Increase in Radius and Hop Distance.

, , , , , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 134-146. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrea Carminati

Ingrid Carmienke

Reinhold Carmine

Paz Schamber

Zwi Hirsch Carmi-Weinberg

 

Other publications of authors with the same name

Location Oblivious Distributed Unit Disk Graph Coloring., , , , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 222-233. Springer, (2007)NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem., , , and . WABI, volume 5251 of Lecture Notes in Computer Science, page 76-86. Springer, (2008)Spanners of Complete k -Partite Geometric Graphs., , , , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 170-181. Springer, (2008)Computing the Greedy Spanner in Near-Quadratic Time., , , , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 390-401. Springer, (2008)Spanners of Additively Weighted Point Sets., , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 367-377. Springer, (2008)Power Assignment in Radio Networks with Two Power Levels., and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 431-441. Springer, (2004)Minimum Power Energy Spanners in Wireless Ad Hoc Networks., , , and . INFOCOM, page 2411-2416. IEEE, (2010)Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule., , , , , and . Algorithmica, 82 (10): 2784-2808 (2020)Improved PTASs for convex barrier coverage., , , and . Comput. Geom., (2021)Spanners of additively weighted point sets., , and . J. Discrete Algorithms, 9 (3): 287-298 (2011)