Recent Publications

Survey Articles in red

If you are declined permission to access certain files and would like to see them, please send e-mail to dtlee@iis.sinica.edu.tw.

• Maximum Independent Set of a Permutation Graph in K Tracks (IJCGA, 3(3):291-304, Sept. 1993.)
• Restricted Track Assignment with Applications (IJCGA, 4(1):53-68, March. 1994.)
• Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon (IPL, 55:75-79, 1995.)
• Rectilinear Path Problems among Rectilinear Obstacles Revisited (SICOMP, 24(3):457-472, June 1995.)
• An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs with Applications (Algorithmica, 14(5):429-441, Nov 1995.)
• An Optimal Algorithm for Roundness Determination on Convex Polygons (CGTA, 5(4):225-235, Nov 1995.)
• A Faster Algorithm for Rubber-Band Equivalent Transformation for Planar VLSI Layouts
  (IEEE TCAD, 15(2):217-227, Feb 1996.)
• Rectilinear Paths among Rectilinear Obstacles (DAM, 70:185-215, 1996.)
• Geometric Algorithm Visualization, Current Status and Future (LNCS No. 1148, pp. 45-50, Springer-Verlag, 1996.)
• Computational Geometry (The Computer Science and Engineering Handbook, CRC Press, pp. 111-140, 1996.)
• The Steiner Minimal Tree Problem in the $\lambda$-geometry (ISAAC, pp.247-255, Dec. 1996.)
• Steiner Problems on Directed Acyclic Graphs (SAICCC, June 1996.)
• k Best Cuts for Circular-Arc Graphs (Algorithmica, 18(2):198-216, June 1997.)
• The Smallest Pair of Non-Crossing Paths in a Rectilinear Polygon (IEEE TC, 46(8):930-941, August 1997.)
• Finding Rectilinear Paths among Obstacles in a Two-Layer Interconnection Model (IJCGA, 7(6):581-598, Dec 1997.)
• A Faster One-Dimensional Topological Compaction Algorithm (ISAAC, pp. 303-313, Dec 1997)
• Two-Guard Walkability of Simple Polygons (IJCGA, 8(1):85-116, Feb. 1998.)
• A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains (Algorithmica, 20(4): 319-352, April 1998.)
• GeoSheet: A Distributed Visualization Tool for Geometric Algorithms (IJCGA, 8(2):119-155, April 1998.)
• Solving the All-Pair Shortest Path Query Problem on Interval and Circular-Arc Graphs (Networks, (32,4): 249-257, Dec. 1998.)
• Computational Geometry I (Chap. 19, Algorithms & Theory of Computation Handbook, CRC Press 1999.)
• Computational Geometry II (Chap. 20, Algorithms & Theory of Computation Handbook, CRC Press 1999.)
• Two-Way and Multi-Way Partitioning a Set of Intervals for Clique-Width Maximization (Algorithmica, 23(3): 187-210, March 1999.)
• On Crossing Minimization Problem (IEEE TCAD, 17(5): 406-418, May 1998.)
• Critical Area Computation -- A New Approach (Proc. 1998 Int'l Symposium on Physical Design, Monterey, CA, April 1998, 89-94; "Critical Area Computation via Voronoi Diagrams," IEEE Trans. Computer-Aided Design, 18(4):463-474, April 1999.)
• Skew Voronoi Diagram (IJCGA, 9(3):235-247, June 1999.)
• A System for Analyzing Automatic Assembly and Disassembly Operations (Proc. IEEE ICRA 2000, April 2000.)
• A Web-Based Distributed Programming Environment(Proc. 8th HPCN Europe 2000, May 2000.)
• On Creation and Management of Digital Libraries: System Environment, Human-Computer Interface and Research Issues (Journal of Library and Information Science, (26,2):38-48, Oct. 2000.)
• A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion (Algorithmca, (28,4): 390-421, Dec. 2000.)
• Toward Web-Based Computing (IJCGA, 11(1):71-104, Feb. 2001.)
• Modeling Automatic Assembly and Disassembly Operations for Virtual Manufacturing (IEEE Trans. on Systems, Man, and Cybernetics, PART A: Systems and Humans, (31,3) May 2001, 223-232.)
• The L$infinity$ Voronoi diagram of segments and VLSI applications (Int'l J. Comput. Geometry & Applications, (11,5) Oct. 2001, 503-528.)
• A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks (Proc. Sixth Int'l Symp. Parallel Architectures, Algorithms, and Networks, May 2002, Manila, Philippines, 335-340.)
• Bi-directional Route Optimization on Mobile IP over Wireless LAN (IEEE Vehicular Technology Society Fall Conference, VTC'02, Vancouver, Canada, Sept. 24-28, 2002.)
• Intelligent Control of Electric Scooters (The 5th IASTED International Conference on Intelligent Systems and Control, ISC 2002, Tsukuba, Japan, October 2- 4, 2002.)
• The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing (Proc.13th Annual Int'l Symp. on Algorithms and Computation, Vancouver, Canada, November 2002, 511-522.)
• Knowledge Management for Computational Problem Solving (Proc. 3rd Annual Int'l Conference for Knowledge Management, Graz, Austria, July 2003.)
• Securing Web Application Code by Static Analysis and Runtime Protection (Proc. Thirteenth Int'l World Wide Web Conference, (WWW2004), New York, NY, May 17-22, 2004. Best Paper Runners-Up.)
• A New Approach to the Traveling Salesman Problem Using Genetic Algorithms with Priority Encoding (Proc. 2004 IEEE Congress on Evolutionary Computation, Portland, OR, June 10-23, 2004.)
• Verifying Web Applications Using Bounded Model Checking (Proc. Int'l Conference on Dependable Systems and Networks, Palazzo dei Congressi, Florence, Italy, June 28th - July 1, 2004.)
• Travel Time Prediction with Support Vector Regression (IEEE Trans. Intelligent Transportation Systems, (5,4):276-281, Dec. 2004.)
• Crosstalk- and Performance-Driven Multilevel Full-Chip Routing (IEEE Trans. on Computer-Aided Design, (24,6):869-878, June 2005.)
• The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach (Int'l Journal of Comput. Geometry & Applications, (14,6):421-452, Dec. 2004.)
• Web Application Security -- Past, Present and Future (Computer Security in the 21st Century, Eds. Lee, Shieh and Tygar, Kluwer Academic Publishers, Boston/Dordrecht/London, 2005, 183-227.)
• Labeling Points on a Single Line (Int'l Journal of Computational Geometry and Applications, (15,3):261-277 June 2005.)
• Interval, Segment, Range, and Priority Search Trees (Handbook of Data Structures and Applications, Chapman & Hall/CRC Computer and Information Science Series. Chap. 18, 2005.)
• Two Variations of the Minimum Steiner Problem (J. Combinatorial Optimization, 9, 101-120, 2005.)

Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon
(IPL55:75-79, 1995.)

||| Abstract ||| ||| Full text |||

Rectilinear Path Problems among Rectilinear Obstacles Revisited
(SICOMP, 24(3):457-472, June 1995.)

||| Abstract ||| ||| Full text |||

An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs with Applications
(Algorithmica, 14(5):429-441, Nov. 1995.)

||| Abstract ||| ||| Full text |||

k Best Cuts for Circular-Arc Graphs
(Algorithmica, 18(2):198-216, June 1997.)

||| Abstract ||| ||| Full text |||

Maximum Independent Set of a Permutation Graph in k Tracks
(IJCGA, 3(3):291-304, Sept. 1993.)

||| Abstract ||| ||| Full text |||

Restricted Track Assignment with Applications
(IJCGA, 4(1):53-68, March. 1994.)

||| Abstract ||| ||| Full text (in pdf) |||

A Faster Algorithm for Rubber-Band Equivalent Transformation for Planar VLSI Layouts
(IEEE TCAD, 15(2):217-227, Feb. 1996.)

||| Abstract ||| ||| Full text |||

Rectilinear Paths among Rectilinear Obstacles
(DAM, 70:185-215, 1996.)

||| Abstract ||| ||| Full text |||

An Optimal Algorithm for Roundness Determination on Convex Polygons
(CGTA, 5(4):225-235, Nov 1995.)

||| Abstract ||| ||| Full text |||

Geometric Algorithm Visualization, Current Status and Future
(LNCS No. 1148, pp. 45-50, Springer-Verlag, 1996.)

||| Abstract ||| ||| Full text (Postcript) |||

Computational Geometry (The Computer Science and Engineering Handbook, CRC Press, pp. 111-140, 1996.)

||| Full text |||

Geodesic Voronoi Diagram of a Simple Polygon...
(Algorithmica, 20(4):319-352, April 1998.)

||| Abstract ||| ||| Full text |||

Finding Rectilinear Paths among Obstacles in a Two-Layer Interconnection Model
(IJCGA, 7(6):581-598, Dec. 1997.)

||| Abstract ||| ||| Full text |||

The Smallest Pair of Non-Crossing Paths in a Rectilinear Polygon
(IEEE TC, 46(8):930-941, August 1997.)

||| Abstract ||| ||| Full text |||

Two-Guard Walkability of Simple Polygons
(IJCGA, 8(1):85-116, Feb. 1998.)

||| Abstract ||| ||| Full text |||

Computational Geometry I (Chap. 19, Algorithms & Theory of Computation Handbook, CRC Press 1999.)

||| Introduction ||| ||| Full text (in pdf) |||

Computational Geometry II (Chap. 20, Algorithms & Theory of Computation Handbook, CRC Press 1999.)

||| Full text (in pdf) |||

Two-Way and Multi-Way Partitioning a Set of Intervals for Clique-Width Maximization
(Algorithmica, 23(3): 187-210, March 1999.)

||| Full text |||

Solving the All-Pair Shortest Path Query Problem on Interval and Circular-Arc Graphs
(Networks, (32,4): 249-257, Dec. 1998.)

||| Abstract ||| ||| Full text |||

Steiner Problems on Directed Acyclic Graphs
(SAICCC, June 1996.)

||| Abstract ||| ||| Full text |||

On Crossing Minimization Problem
(IEEE TCAD, 17(5): 406-418, May 1998.)

||| Abstract ||| ||| Full text |||

GeoSheet: A Distributed Visualization Tool for Geometric Algorithms
(IJCGA, 8(2):119-155, April 1998.)

||| Abstract ||| ||| Full text |||

The Steiner Minimal Tree Problem in the $\lambda$-geometry
(ISAAC, pp.247-255, Dec. 1996.)

||| Abstract ||| ||| Full text |||

Towards Web-Based Computing
(IJCGA, 11(1):71-104, Feb. 2001.)

||| Abstract ||| ||| Full text |||

A Faster One-Dimensional Topological Compaction Algorithm
(Proc. 1997 Int'l Symposium on Algorithms and Computation, Singapore, Dec. 1997.)

||| Abstract ||| ||| Full text |||

A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion
(Algorithmca, (28,4): 390-421, Dec. 2000.)