Normal forms in term rewriting systems - L. Paul Chew (1981)

Planning the shortest path for a disc in O(n2log n) time. - L. Paul Chew (SCG, 1985)

Voronoi diagrams based on convex distance functions. - L. Paul Chew; Robert L. (Scot) Drysdale III (SCG, 1985)

Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. - L. Paul Chew; Klara Kedem (SCG, 1989)

Constrained Delaunay Triangulations. - L. Paul Chew (Algorithmica, 1989)

An Efficiently Computable Metric for Comparing Polygonal Shapes. - Esther M. Arkin; L. Paul Chew; Daniel P. Huttenlocher; Klara Kedem; Joseph S. B. Mitchell (IEEE Trans. Pattern Anal. Mach. Intell., 1991)

Improvements on Geometric Pattern Matching Problems. - L. Paul Chew; Klara Kedem (SWAT, 1992)

Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points. - L. Paul Chew (CCCG, 1993)

Guaranteed-Quality Mesh Generation for Curved Surfaces. - L. Paul Chew (SCG, 1993)

A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. - L. Paul Chew; Klara Kedem (Comput. Geom., 1993)

Dihedral Bounds for Mesh Generation in High Dimensions. - Marshall W. Bern; L. Paul Chew; David Eppstein; Jim Ruppert (SODA, 1995)

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. - Srinivasa Rao Arikati; Danny Z. Chen; L. Paul Chew; Gautam Das 001; Michiel H. M. Smid; Christos D. Zaroliagis (ESA, 1996)

Guaranteed-Quality Delaunay Meshing in 3D (Short Version). - L. Paul Chew (SCG, 1997)

Sorting Helps for Voronoi Diagrams. - L. Paul Chew; Steven Fortune (Algorithmica, 1997)

Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points. - L. Paul Chew (Comput. Geom., 1997)

Geometric Pattern Matching Under Euclidean Motion. - L. Paul Chew; Michael T. Goodrich; Daniel P. Huttenlocher; Klara Kedem; Jon M. Kleinberg; Dina Kravets (Comput. Geom., 1997)

Getting around a lower bound for the minimum Hausdorff distance. - L. Paul Chew; Klara Kedem (Comput. Geom., 1998)

Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. - L. Paul Chew; Klara Kedem; Micha Sharir; Boaz Tagansky; Emo Welzl (J. Algorithms, 1998)

Emerging Challenges in Computational Topology - Marshall W. Bern; David Eppstein; Pankaj K. Agarwal; Nina Amenta; L. Paul Chew; Tamal K. Dey; David P. Dobkin; Herbert Edelsbrunner; Cindy Grimm; Leonidas J. Guibas; John Harer; Joel Hass; et al. (CoRR, 1999)

Geometric Pattern Matching in d -Dimensional Space. - L. Paul Chew; Dorit Dor; Alon Efrat; Klara Kedem (Discret. Comput. Geom., 1999)

Fast Detection of Common Geometric Substructure in Proteins. - L. Paul Chew; Daniel P. Huttenlocher; Klara Kedem; Jon M. Kleinberg (J. Comput. Biol., 1999)

Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives. - Bruce Carter; Chuin-Shan Chen; L. Paul Chew; Nikos Chrisochoides; Guang R. Gao; Gerd Heber; Anthony R. Ingraffea; Roland Krause; Chris Myers; Démian Nave; Keshav Pingali; Paul Stodghill; et al. (IPDPS Workshops, 2000)

A Concise Representation of Geometry Suitable for Mesh Generation. - L. Paul Chew; Stephen A. Vavasis; S. Gopalsamy; TzuYi Yu; Bharat K. Soni (IMR, 2002)

Walking around fat obstacles. - L. Paul Chew; Haggai David; Matthew J. Katz; Klara Kedem (Inf. Process. Lett., 2002)

Computational Science Simulations Based on Web Services. - L. Paul Chew; Nikos Chrisochoides; S. Gopalsamy; Gerd Heber; Anthony R. Ingraffea; Edward Luke; Joaquim B. Cavalcante Neto; Keshav Pingali; Alan M. Shih; Bharat K. Soni; Paul Stodghill; David S. Thompson; et al. (International Conference on Computational Science, 2003)

Finding the Consensus Shape for a Protein Family. - L. Paul Chew; Klara Kedem (Algorithmica, 2004)

Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. - Démian Nave; Nikos Chrisochoides; L. Paul Chew (Comput. Geom., 2004)

Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations. - Amit Weisman; L. Paul Chew; Klara Kedem (Inf. Process. Lett., 2004)

Exact computation of protein structure similarity. - L. Paul Chew (SCG, 2006)

Indexing for Function Approximation. - Biswanath Panda; Mirek Riedewald; Stephen B. Pope; Johannes Gehrke; L. Paul Chew (VLDB, 2006)

Optimistic parallelism benefits from data partitioning. - Milind Kulkarni 001; Keshav Pingali; Ganesh Ramanarayanan; Bruce Walter; Kavita Bala; L. Paul Chew (ASPLOS, 2008)

Scheduling strategies for optimistic parallel execution of irregular programs. - Milind Kulkarni 001; Patrick Carribault; Keshav Pingali; Ganesh Ramanarayanan; Bruce Walter; Kavita Bala; L. Paul Chew (SPAA, 2008)

FASH: A web application for nucleotides sequence search. - Isana Veksler-Lublinsky; Danny Barash; Chai Avisar; Einav Troim; L. Paul Chew; Klara Kedem (Source Code Biol. Medicine, 2008)

Optimistic parallelism requires abstractions. - Milind Kulkarni 001; Keshav Pingali; Bruce Walter; Ganesh Ramanarayanan; Kavita Bala; L. Paul Chew (Commun. ACM, 2009)