The following pages link to Sung Kwon Kim (Q216326):
Displaying 21 items.
- Logarithmic width, linear area upward drawing of AVL trees (Q287192) (← links)
- Finding a longest nonnegative path in a constant degree tree (Q835050) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- Parallel algorithms for planar dominance counting (Q916374) (← links)
- Parallel algorithms for the segment dragging problem (Q918740) (← links)
- Linear-time algorithm for finding a maximum-density segment of a sequence (Q1007643) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- Constant-time RMESH algorithms for the range minima and co-minima problems (Q1274376) (← links)
- The range co-minima problem (Q1318757) (← links)
- A note on finding compact sets in graphs represented by an adjacency list (Q1351637) (← links)
- Rectangulating rectilinear polygons in parallel (Q1391823) (← links)
- Placing two disks in a convex polygon (Q1583047) (← links)
- Order-preserving, upward drawing of binary trees using fewer bends (Q1887067) (← links)
- Area-efficient algorithms for straight-line tree drawings (Q1975960) (← links)
- Algorithms for drawing binary trees in the plane. (Q2583549) (← links)
- (Q2766839) (← links)
- Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images (Q3977294) (← links)
- (Q4016533) (← links)
- LABELING A RECTILINEAR MAP WITH SLIDING LABELS (Q4682173) (← links)
- Computing the optimal bridge between two polygons (Q5949572) (← links)
- Rectangulating rectilinear polygons in parallel (Q6064015) (← links)