( en | de | ru )

 

Disambiguation of "Sozio, Mauro"

Author of the publication

copydeleteadd this publication to your clipboard
Irrigating ad hoc networks in constant time.

, , , , and . SPAA, page 106-115. ACM, (2005)

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.

Christian Mauro

Frank Mauroschat

Jacopo Mauro

Carola Mauroschat-Galla

Andreas Mauroschat

 

Other publications of authors with the same name

Approximation Algorithms for 2-Stage Stochastic Scheduling Problems., and . IPCO, volume 4513 of Lecture Notes in Computer Science, page 145-157. Springer, (2007)Finding Subgraphs with Maximum Total Density and Limited Overlap in Weighted Hypergraphs., , , , , and . ACM Trans. Knowl. Discov. Data, 18 (4): 95:1-95:21 (May 2024)Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search., , , , , , and . ACM Trans. Knowl. Discov. Data, 16 (2): 33:1-33:34 (2022)Listing k-cliques in Sparse Real-World Graphs., , and . WWW, page 589-598. ACM, (2018)The community-search problem and how to plan a successful cocktail party., and . KDD, page 939-948. ACM, (2010)Distributed approximate k-core decomposition and min-max edge orientation: Breaking the diameter barrier., , and . J. Parallel Distributed Comput., (2021)Finding events in temporal networks: segmentation meets densest subgraph discovery., , , , and . Knowl. Inf. Syst., 62 (4): 1611-1639 (2020)Finding near neighbors through cluster pruning., , , , , and . PODS, page 103-112. ACM, (2007)Finding Heaviest k-Subgraphs and Events in Social Media., , , , and . ICDM Workshops, page 113-120. IEEE Computer Society, (2016)Local triangle-densest subgraphs., , and . ASONAM, page 33-40. IEEE Computer Society, (2016)