( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing the Greedy Spanner in Near-Quadratic Time.

, , , , и . Algorithmica, 58 (3): 711-729 (2010)

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.

Andrea Carminati

Ingrid Carmienke

Reinhold Carmine

Paz Schamber

Solveig Carmienke

 

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

Strongly Connected Spanning Subgraph for Almost Symmetric Networks., , и . CCCG, Queen's University, Ontario, Canada, (2015)Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule., , , , , и . Algorithmica, 82 (10): 2784-2808 (2020)Improved PTASs for convex barrier coverage., , , и . Comput. Geom., (2021)Spanners of additively weighted point sets., , и . J. Discrete Algorithms, 9 (3): 287-298 (2011)2×n Grids have Unbounded Anagram-Free Chromatic Number., , , и . CoRR, (2021)A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph., , и . CoRR, (2020)Power Assignment in Radio Networks with Two Power Levels., и . SWAT, том 3111 из Lecture Notes in Computer Science, стр. 431-441. Springer, (2004)Computing the Greedy Spanner in Near-Quadratic Time., , , , и . SWAT, том 5124 из Lecture Notes in Computer Science, стр. 390-401. Springer, (2008)Spanners of Additively Weighted Point Sets., , и . SWAT, том 5124 из Lecture Notes in Computer Science, стр. 367-377. Springer, (2008)Spanners of Complete k -Partite Geometric Graphs., , , , , и . LATIN, том 4957 из Lecture Notes in Computer Science, стр. 170-181. Springer, (2008)