( en | de | ru )

 

Disambiguation of "Haverkort, Herman J."

Author of the publication

copydeleteadd this publication to your clipboard
Computing a Minimum-Dilation Spanning Tree is NP-hard.

, , and . CATS, volume 65 of CRPIT, page 15-24. Australian Computer Society, (2007)

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.

Herman J Landow

Maurits Haverkort

Herman Hindermayr

Herman Vloed

Herman Hahlo

 

Other publications of authors with the same name

Multiple Polyline to Polygon Matching., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 60-70. Springer, (2005)I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions., , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 500-511. Springer, (2007)Shortest-Path-Preserving Rounding., , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 265-277. Springer, (2019)Sparse Geometric Graphs with Small Dilation., , , , , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 50-59. Springer, (2005)How to play hot and cold., , , and . Comput. Geom., (2020)Computing a Minimum-Dilation Spanning Tree is NP-hard., , and . CATS, volume 65 of CRPIT, page 15-24. Australian Computer Society, (2007)Algorithmic Aspects of Proportional Symbol Maps., , , and . ESA, volume 4168 of Lecture Notes in Computer Science, page 720-731. Springer, (2006)On IO-efficient viewshed algorithms and their accuracy., , and . SIGSPATIAL/GIS, page 24-33. ACM, (2013)Improved visibility computation on massive grid terrains., , and . GIS, page 121-130. ACM, (2009)Sparse geometric graphs with small dilation., , , , , , and . Comput. Geom., 40 (3): 207-219 (2008)