( en | de | ru )

 

Disambiguation of "Navarra, Alfredo"

Author of the publication

copydeleteadd this publication to your clipboard
UHEED - An Unequal Clustering Algorithm for Wireless Sensor Networks.

, , , , and . SENSORNETS, page 185-193. SciTePress, (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.

Fernando Silveira Navarra

Santiago Gabriel Navarra

Alfredo Cervera

Alfredo Ibáñez

Alfredo Märker

 

Other publications of authors with the same name

Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points., , and . ALGOSENSORS, volume 8847 of Lecture Notes in Computer Science, page 57-72. Springer, (2014)Balancing Energy Consumption for the Establishment of Multi-interface Networks., and . SOFSEM, volume 8939 of Lecture Notes in Computer Science, page 102-114. Springer, (2015)Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks., , , , and . Graphs and Algorithms in Communication Networks, Springer, (2010)Topology Control and Routing in Ad Hoc Networks., , , and . Graphs and Algorithms in Communication Networks, Springer, (2010)Approximation and Exact Algorithms for Optimally Placing a Limited Number of Storage Nodes in a Wireless Sensor Network., , and . Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)Fast periodic graph exploration with constant memory., , , , and . J. Comput. Syst. Sci., 74 (5): 808-822 (2008)Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring., , and . Theor. Comput. Sci., 411 (34-36): 3235-3246 (2010)Synchronous black hole search in directed graphs., , and . Theor. Comput. Sci., 412 (41): 5752-5759 (2011)Explore and repair graphs with black holes using mobile entities., , and . Theor. Comput. Sci., (2015)Gathering of robots on meeting-points: feasibility and optimal resolution algorithms., , and . Distributed Comput., 31 (1): 1-50 (2018)