( en | de | ru )

 

Disambiguation of "Marino, Andrea"

Author of the publication

copydeleteadd this publication to your clipboard
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.

, , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 154-166. Springer, (2009)

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.

Marino Philippi

Daniela Marino

Enzo Marino

Marino Perini

Marino Philippi

 

Other publications of authors with the same name

Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs., , and . Algorithms, 13 (9): 211 (2020)Smooth movement and Manhattan path based Random Waypoint mobility., , , , , and . Inf. Process. Lett., 111 (5): 239-246 (2011)An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs., , , and . SDM, page 289-297. SIAM, (2023)A Fast Algorithm for Large Common Connected Induced Subgraphs., , , , and . AlCoB, volume 10252 of Lecture Notes in Computer Science, page 62-74. Springer, (2017)On the Energy Consumption and Performance of WebAssembly Binaries across Programming Languages and Runtimes in IoT., , , , , and . EASE, page 72-82. ACM, (2023)BUbiNG: massive crawling for the masses., , , and . WWW (Companion Volume), page 227-228. ACM, (2014)Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 148-159. Springer, (2019)Enumerating Cyclic Orientations of a Graph., , , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 88-99. Springer, (2015)A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs., , , and . TAPAS, volume 6595 of Lecture Notes in Computer Science, page 92-103. Springer, (2011)On Computing the Diameter of Real-World Directed (Weighted) Graphs., , , and . SEA, volume 7276 of Lecture Notes in Computer Science, page 99-110. Springer, (2012)