Browse "School of Computing(전산학부)" by Author Haverkort, Herman
Showing results 1 to 7 of 7
| Computing a minimum-dilation spanning tree is NP-hard Cheong, Otfried; Haverkort, Herman; Lee, Mira, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.41, no.3, pp.188 - 205, 2008-11 |
| Computing a minimum-dilation spanning tree is NP-hard Cheong, Otfried; Haverkort, Herman; Lee, Mira, Computing: The Australasian Theory Symposium (CATS) 2007, pp.15 - 24, CATS '07, 2007-01-30 |
| Computing a minimum-dilation spanning tree is NP-hard = 최소-Dilation 신장 트리 찾기의 NP-hard 증명link Lee, Mi-Ra; 이미라; Cheong, Otfried; et al, 한국과학기술원, 2007 |
| I/O-efficient flow modeling on fat terrains de Berg, Mark; Cheong, Otfried; Haverkort, Herman; Lim, Jung Gun; Toma, Laura, 10th International Workshop on Algorithms and Data Structures, WADS 2007, pp.239 - 250, WADS'07, 2007-08-15 |
| River networks and watershed maps of triangulated terrains revisited Ahn, Hee-Kap; de Berg, Mark; Cheong, Otfried; Haverkort, Herman; Stappen, Frank van der; Toma, Laura, European Workshop on Computational Geometry, 2006 |
| Sparse geometric graphs with small dilation Aronov, Boris; de Berg, Mark; Cheong, Otfried; Gudmundsson, Joachim; Haverkort, Herman; Smid, Michiel; Vigneron, Antoine, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.40, no.3, pp.207 - 219, 2008-08 |
| The complexity of flow on fat terrains and its I/O-efficient computation de Berg, Mark; Cheong, Otfried; Haverkort, Herman; Lim, Jung-Gun; Toma, Laura, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.43, no.4, pp.331 - 356, 2010-05 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,816 2020 - 2024
- 5,390 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989