KCKyung-Yong Chwa
Kyung-Yong Chwa
*This is an algorithmically generated author record based on publicly available information.
Research Subjects
Kyung-Yong Chwa has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Dae Seoung Kim
Department of Computer Science, KAIST, Kusong-dong 373-1, Yusong-gu, Taejon 305-701, Republic of Korea.. KR
3 shared publications - Sung Yong Shin
Department of Computer Science, KAIST, Kusong-dong 373-1, Yusong-gu, Taejon 305-701, Republic of Korea.. KR
3 shared publications - Chan-Su Shin
Hankuk University of Foreign Studies
2 shared publications - Jae-Ha Lee
Max-Planck-Institut für Informatik, Saarbrücken, Germany
2 shared publications Bomjun Kwon
1 shared publication- Hyunwoo Jung
Korea Science Academy of KAIST
1 shared publication
Latest Publications
- 1 September 2016
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 82 (6) , 1044-1063
Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems
- 1 September 2016
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 82 (6) , 1044-1063
Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems
- Open Access
- 3 August 2012
- Published by Springer Nature in Algorithmica
- Vol. 64 (3) , 327-328
Guest Editorial: Special Issue on Algorithms and Computation
- 3 August 2012
- Published by Springer Nature in Algorithmica
- Vol. 64 (3) , 327-328
Open AccessGuest Editorial: Special Issue on Algorithms and Computation
- 9 February 2011
- Published by Springer Nature in Theory of Computing Systems
- Vol. 49 (1) , 182-195
The Balloon Popping Problem Revisited: Lower and Upper Bounds
- 9 February 2011
- Published by Springer Nature in Theory of Computing Systems
- Vol. 49 (1) , 182-195
The Balloon Popping Problem Revisited: Lower and Upper Bounds
- 14 February 2004
- Published by Elsevier in Information Processing Letters
- Vol. 89 (3) , 115-121
Labeling points with given rectangles
- 14 February 2004
- Published by Elsevier in Information Processing Letters
- Vol. 89 (3) , 115-121
Labeling points with given rectangles
- 6 November 2002
- Published by Elsevier in Information Processing Letters
- Vol. 85 (1) , 31-37
Online deadline scheduling on faster machines
- 6 November 2002
- Published by Elsevier in Information Processing Letters
- Vol. 85 (1) , 31-37
Online deadline scheduling on faster machines
- 16 March 2002
- Published by Elsevier in Information Processing Letters
- Vol. 81 (5) , 265-270
Simple algorithms for searching a polygon with flashlights
- 16 March 2002
- Published by Elsevier in Information Processing Letters
- Vol. 81 (5) , 265-270
Simple algorithms for searching a polygon with flashlights
- 28 February 1999
- Published by Elsevier in Theoretical Computer Science
- Vol. 215 (1-2) , 209-223
Scheduling parallel tasks with individual deadlines
- 28 February 1999
- Published by Elsevier in Theoretical Computer Science
- Vol. 215 (1-2) , 209-223
Scheduling parallel tasks with individual deadlines
- 15 May 1998
- Published by Elsevier in Information Processing Letters
- Vol. 66 (3) , 133-139
Algorithms for drawing binary trees in the plane
- 15 May 1998
- Published by Elsevier in Information Processing Letters
- Vol. 66 (3) , 133-139
Algorithms for drawing binary trees in the plane
- 1 March 1998
- Published by Springer Nature in Algorithmica
- Vol. 20 (3) , 227-241
Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source
- 1 March 1998
- Published by Springer Nature in Algorithmica
- Vol. 20 (3) , 227-241
Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source
- 1 February 1998
- Published by Springer Nature in Algorithmica
- Vol. 20 (2) , 201-225
Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space
- 1 February 1998
- Published by Springer Nature in Algorithmica
- Vol. 20 (2) , 201-225
Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space