The titles are linked to compressed postscript versions of the papers, or to a separate page with the abstract.

• Lower bounds for kinetic planar subdivisions

with Pankaj Agarwal, Mark de Berg, Leo Guibas and John Hershberger,
15th Symposium on Computational Geometry, 1999.
 
• Ph.D. thesis: Kinetic data structures

June 1999.
 
• Kinetic collision detection between two simple polygons

with Jeff Erickson, Leo Guibas, John Hershberger and Li Zhang
Submitted to SODA 99.
 
• Sweeping Over Lines and Line Segments with a Heap,

with L.J. Guibas and G.D. Ramkumar.
13th Symposium on Computational Geometry, 1997.
 
• Probabilistic Analysis for Combinatorial Functions of Moving Points,

with H. Devarajan, P. Indyk, and L. Zhang.
13th Symposium on Computational Geometry, 1997.
(submitted to IJCGA)
 
• Proximity Problems on Moving Points,

with L.J. Guibas and L. Zhang.
13th Symposium on Computational Geometry, 1997.
 
• A Practical Evaluation Of Kinetic Data Structures,

with L.J. Guibas, C.D. Silverstein, and L. Zhang.
13th Symposium on Computational Geometry, 1997.
 
• Data Structures for Mobile Data,

with L.J. Guibas and J. Hershberger.
8th Symposium on Discrete Algorithms, 1997
(to appear in Journal of Algorithms)
 
• Reporting Red-Blue Intersections Between Two Sets Of Connected Connected Line Segments,

with L.J. Guibas and G.D. Ramkumar.
4th European Symposium on Algorithms, 1996
 
• Polyhedral Tracings and Their Convolution,

with L.J. Guibas, G.D. Ramkumar, and L. Ramshaw.
Workshop on Algorithmic Foundations of Robotics, 1996
 
• Orienting Fiber Products,

with L. Ramshaw.
Tech Report.