Kyung-Yong Chwa

J. Comput. Syst. Sci., 2016

2014

Travel Time Distances Induced by Transportation Networks and General Underlying Distances.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2014

2013

Paired many-to-many disjoint path covers in faulty hypercubes.

[BibT_eX]

[DOI]

Shinhaeng Jo

Theor. Comput. Sci., 2013

Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs.

[BibT_eX]

[DOI]

Shinhaeng Jo

Inf. Sci., 2013

2012

Guest Editorial: Special Issue on Algorithms and Computation.

[BibT_eX]

[DOI]

Kunsoo Park

Algorithmica, 2012

Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011

The Balloon Popping Problem Revisited: Lower and Upper Bounds.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

2009

A 6.55 factor primal-dual approximation algorithm for the connected facility location problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Optimal Construction of the City Voronoi Diagram.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Computing minimum-area rectilinear convex hull and L-shape.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Casting an Object with a Core.

[BibT_eX]

[DOI]

Algorithmica, 2009

Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs.

[BibT_eX]

[DOI]

Sung-Eui Yoon

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

The geodesic farthest-site Voronoi diagram in a polygonal domain with holes.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Approximation algorithms for connected facility location problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Improved Approximation Algorithm for Connected Facility Location Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

Preface.

[BibT_eX]

[DOI]

J. Ian Munro

Theor. Comput. Sci., 2006

Guarding Art Galleries by Guarding Witnesses.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

Voronoi Diagrams for a Transportation Network on the Euclidean Plane.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

2005

Optimal broadcasting with universal lists based on competitive analysis.

[BibT_eX]

[DOI]

Networks, 2005

Improved gossipings by short messages in 2-dimensional meshes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2005

Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Scheduling broadcasts with deadlines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Hamiltonian properties on the class of hypercube-like networks.

[BibT_eX]

[DOI]

Chong-Dae Park

Inf. Process. Lett., 2004

Labeling points with given rectangles.

[BibT_eX]

[DOI]

Joo-Won Jung

Inf. Process. Lett., 2004

Equivalence of Search Capability Among Mobile Guards with Various Visibilities.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

Non-clairvoyant scheduling for weighted flow time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Online deadline scheduling on faster machines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

2002

Simple algorithms for searching a polygon with flashlights.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Approximation algorithms for general parallel task scheduling.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Searching a Room by Two Guards.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2002

2001

Carrying Umbrellas: an Online Relocation Game on a Graph.

[BibT_eX]

[DOI]

Chong-Dae Park

J. Graph Algorithms Appl., 2001

Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Broadcasting with Universal Lists Revisited: Using Competitive Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On-Line Deadline Scheduling on Multiple Resources.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Recursive circulants and their embeddings among hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2000

Searching a Polygonal Room with One Door by a 1-Searcher.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Three-Dimensional Topological Sweep for Computing Rotational Swept Volumes of Polyhedral Objects.

[BibT_eX]

[DOI]

Nakhoon Baek

Int. J. Comput. Geom. Appl., 2000

Area-efficient algorithms for straight-line tree drawings.

[BibT_eX]

[DOI]

Sung Kwon Kim

Comput. Geom., 2000

Characterization of Rooms Searchable by Two Guards.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

Scheduling Parallel Tasks with Individual Deadlines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On Computing Translational Swept Volumes.

[BibT_eX]

[DOI]

Nakhoon Baek

Int. J. Comput. Geom. Appl., 1999

Carrying Umbrellas: An Online Relocation Problem on Graphs.

[BibT_eX]

[DOI]

Chong-Dae Park

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Online Scheduling of Parallel Communications with Individual Deadlines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Visibility-Based Pursuit-Evasion in a Polygonal Room with a Door.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Memory-Efficient Ray Classification for Visibility Operations.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 1998

An Algorithm for Scheduling Jobs in Hypercube Systems.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1998

Embeddings of Butterflies into Hypermeshes.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1998

Multiple Graph Embeddings into a Processor Array with Spanning Buses.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

The Widest <i>k</i>-Dense Corridor Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Algorithms for Drawing Binary Trees in the Plane.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source.

[BibT_eX]

[DOI]

Algorithmica, 1998

Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space.

[BibT_eX]

[DOI]

Algorithmica, 1998

Two-Center Problems for a Convex Polygon (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

Optimal embeddings of multiple graphs into a hypermesh.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

New Competitive Strategies for Searching in Unknown Star-Shaped Polygons.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Image Metamorphosis with Scattered Feature Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Vis. Comput. Graph., 1996

Image Morphing Using Deformation Techniques.

[BibT_eX]

[DOI]

Comput. Animat. Virtual Worlds, 1996

Embedding Trees in Recursive Circulants.

[BibT_eX]

[DOI]

Hyeong-Seok Lim

Discret. Appl. Math., 1996

Directed Hamiltonian Packing in <i>d</i>-Dimensional Meshes and Its Application (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract).

[BibT_eX]

[DOI]

Sung Kwon Kim

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Multiple message broadcasting in communication networks.

[BibT_eX]

[DOI]

Networks, 1995

An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Efficient algorithms for solving diagonal visibility problems in a simple polygon.

[BibT_eX]

[DOI]

S. H. Kim

Int. J. Comput. Geom. Appl., 1995

Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon.

[BibT_eX]

[DOI]

Seung-Hak Choi

Algorithmica, 1995

Edge-disjoint embedding of large full binary trees into hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Image metamorphosis using snakes and free-form deformations.

[BibT_eX]

[DOI]

Seungyong Lee

Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, 1995

1994

On the Construction of Regular Minimal Broadcast Digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Recursive circulant: a new topology for multicomputer networks (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 1994

Image morphing using deformable surfaces.

[BibT_eX]

[DOI]

Proceedings of the Computer Animation 1994, 1994

1993

An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment.

[BibT_eX]

[DOI]

Jeong-In Doh

J. Algorithms, 1993

On the Number of Guard Edges of a Polygon.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1993

1992

Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons.

[BibT_eX]

[DOI]

Seung-Hak Choi

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1990

Some Chain Visibility Problems in a Simple Polygon.

[BibT_eX]

[DOI]

Sang Ho Lee

Algorithmica, 1990

1988

Visibility problems for orthogonal objects in two- or three-dimensions.

[BibT_eX]

[DOI]

Jeong-In Doh

Vis. Comput., 1988

1987

An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs.

[BibT_eX]

[DOI]

Taenam Kim

Inf. Process. Lett., 1987

1981

Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems

[BibT_eX]

[DOI]

S. Louis Hakimi

Inf. Control., June, 1981

On Fault Identification in Diagnosable Systems.

[BibT_eX]

[DOI]