The following pages link to Kyung-Yong Chwa (Q294605):
Displayed 50 items.
- Tight analysis of a self-approaching strategy for the online kernel-search problem (Q294606) (← links)
- Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
- Paired many-to-many disjoint path covers in faulty hypercubes (Q391966) (← links)
- (Q497239) (redirect page) (← links)
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs (Q497240) (← links)
- Improved gossipings by short messages in 2-dimensional meshes (Q557654) (← links)
- The balloon popping problem revisited: lower and upper bounds (Q647488) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- Non-clairvoyant scheduling for weighted flow time (Q1014388) (← links)
- Approximation algorithms for connected facility location problems (Q1016041) (← links)
- Casting an object with a core (Q1024213) (← links)
- Labeling points with given rectangles (Q1029061) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829) (← links)
- Multiple graph embeddings into a processor array with spanning buses (Q1268780) (← links)
- The widest k-dense corridor problems (Q1274672) (← links)
- Scheduling parallel tasks with individual deadlines (Q1285585) (← links)
- On the number of guard edges of a polygon (Q1312196) (← links)
- On the construction of regular minimal broadcast digraphs (Q1318708) (← links)
- Linear-time algorithms for finding the shadow volumes from a convex area light source (Q1386335) (← links)
- Efficient algorithms for computing a complete visibility region in three-dimensional space (Q1386378) (← links)
- Optimal embedding of multiple directed Hamiltonian rings into \(d\)-dimensional meshes (Q1579748) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Simple algorithms for searching a polygon with flashlights (Q1847385) (← links)
- Online deadline scheduling on faster machines. (Q1853172) (← links)
- Scheduling broadcasts with deadlines (Q1884847) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Embedding trees in recursive circulants (Q1923603) (← links)
- Area-efficient algorithms for straight-line tree drawings (Q1975960) (← links)
- Hamiltonian properties on the class of hypercube-like networks (Q2390274) (← links)
- Algorithms for drawing binary trees in the plane. (Q2583549) (← links)
- (Q2729091) (← links)
- (Q2753947) (← links)
- Carrying Umbrellas: an Online Relocation Game on a Graph (Q2755056) (← links)
- Farthest Voronoi Diagrams under Travel Time Metrics (Q2889898) (← links)
- Scheduling Broadcasts with Deadlines (Q3082948) (← links)
- Interpolation theorem for the number of generalized end-vertices of spanning trees (Q3490009) (← links)
- Improved Approximation Algorithm for Connected Facility Location Problems (Q3611984) (← links)
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM (Q3636311) (← links)
- The Balloon Popping Problem Revisited: Lower and Upper Bounds (Q3648850) (← links)
- Parallel algorithms for a depth first search and a breadth first search (Q3802639) (← links)
- A new triangulation-linear class of simple polygons (Q3804191) (← links)
- On Fault Identification in Diagnosable Systems (Q3905215) (← links)
- Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems (Q3947602) (← links)
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762) (← links)
- (Q4472524) (← links)
- (Q4474075) (← links)
- (Q4474115) (← links)