( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constructing interference-minimal networks.

, , , и . EuroCG, стр. 203-206. Technische Universiteit Eindhoven, (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.

Herman J Landow

Maurits Haverkort

Herman Wehling

Herman Keil

Herman Pratikto

 

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

On IO-efficient viewshed algorithms and their accuracy., , и . SIGSPATIAL/GIS, стр. 24-33. ACM, (2013)Improved visibility computation on massive grid terrains., , и . GIS, стр. 121-130. ACM, (2009)Sparse geometric graphs with small dilation., , , , , , и . Comput. Geom., 40 (3): 207-219 (2008)Shortest-Paths Preserving Metro Maps., , , и . GD, том 7034 из Lecture Notes in Computer Science, стр. 445-446. Springer, (2011)Bicriteria Aggregation of Polygons via Graph Cuts., , , , и . GIScience (II), том 208 из LIPIcs, стр. 6:1-6:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Shortest-Path-Preserving Rounding., , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 265-277. Springer, (2019)Multiple Polyline to Polygon Matching., , и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 60-70. Springer, (2005)I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions., , , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 500-511. Springer, (2007)Sparse Geometric Graphs with Small Dilation., , , , , и . ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 50-59. Springer, (2005)How to play hot and cold., , , и . Comput. Geom., (2020)