Browse "School of Computing(전산학부)" by Author Lee, Mira
Showing results 1 to 4 of 4
| 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 |
| Farthest-polygon Voronoi diagrams Cheong, Otfried; Everett, Hazel; Glisse, Marc; Gudmundsson, Joachim; Hornus, Samuel; Lazard, Sylvain; Lee, Mira; et al, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.44, no.4, pp.234 - 247, 2011-05 |
| Farthest-polygon voronoi diagrams Cheong, Otfried; Everett, Hazel; Glisse, Marc; Gudmundsson, Joachim; Hornus, Samuel; Lazard, Sylvain; Lee, Mira; et al, 15th Annual European Symposium on Algorithms, ESA 2007, pp.407 - 418, ESA 2007, 2007-10-08 |
Discover
Open Access
- 187 OA Article
Date issued
- 1,837 2020 - 2024
- 5,390 2010 - 2019
- 4,587 2000 - 2009
- 2,927 1990 - 1999
- 839 1980 - 1989