( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities.

, , , и . PODC, стр. 118-125. 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.

Christian Mauro

Frank Mauroschat

Jacopo Mauro

Carola Mauroschat-Galla

Andreas Mauroschat

 

Другие публикации лиц с тем же именем

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