Browse "School of Computing(전산학부)" by Author Haverkort, Herman

Showing results 1 to 7 of 7

1
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

2
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

3
Computing a minimum-dilation spanning tree is NP-hard = 최소-Dilation 신장 트리 찾기의 NP-hard 증명link

Lee, Mi-Ra; 이미라; Cheong, Otfried; et al, 한국과학기술원, 2007

4
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

5
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

6
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

7
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

Type

. next

Open Access

Date issued

. next

Subject

. next

rss_1.0 rss_2.0 atom_1.0