Author of the publication

Distributed node placement algorithms for constructing well-connected sensor networks.

, , and . INFOCOM, page 810-818. IEEE, (2012)

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.

 

Other publications of authors with the same name

Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising., , and . Operations Research, 61 (1): 98-111 (2013)The complexity of equilibria: Hardness results for economies via a correspondence with games., , , and . Theor. Comput. Sci., 408 (2-3): 188-198 (2008)Approximating power indices: theoretical and empirical analysis., , , , , and . Autonomous Agents and Multi-Agent Systems, 20 (2): 105-122 (2010)Hybrid search schemes for unstructured peer-to-peer networks., , and . INFOCOM, page 1526-1537. IEEE, (2005)Distributed node placement algorithms for constructing well-connected sensor networks., , and . INFOCOM, page 810-818. IEEE, (2012)On the Hardness of Optimal Auctions., and . FOCS, page 396-405. IEEE Computer Society, (2002)AdWords and Generalized On-line Matching., , , and . FOCS, page 264-273. IEEE Computer Society, (2005)Cell Breathing in Wireless LANs: Algorithms and Evaluation., , , , , and . IEEE Trans. Mob. Comput., 6 (2): 164-178 (2007)Convergence to equilibrium in local interaction games., and . SIGecom Exchanges, (2009)The Greedy Algorithm Is not Optimal for On-Line Edge Coloring., and . ICALP, volume 198 of LIPIcs, page 109:1-109:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)