| 2011 | AAIM | Degree-Driven Design for Correct Geometric Algorithms. | Jack Snoeyink |
| 2010 | ALENEX | Implementing Streaming Simplification for large Labeled Meshes. | Catalin Constantin, Shawn Brown, Jack Snoeyink |
| 2010 | WALCOM | Computation of Non-dominated Points Using Compact Voronoi Diagrams. | Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink |
| 2009 | ISAAC | Reconstructing Polygons from Scanner Data. | Therese Biedl, Stephane Durocher, Jack Snoeyink |
| 2009 | WADS | Computing the Implicit Voronoi Diagram in Triple Precision. | David L. Millman, Jack Snoeyink |
| 2007 | SSDBM | Mining RNA Tertiary Motifs with Structure Graphs. | Xueyi Wang, Jun Huan, Jack Snoeyink, Wei Wang |
| 2007 | WABI | Defining and Computing Optimum RMSD for Gapped Multiple Structure Alignment. | Xueyi Wang, Jack Snoeyink |
| 2005 | ALENEX | Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. | Herv Brnnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink |
| 2005 | PSB | An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem. | Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink |
| 2005 | SIGGRAPH | Streaming compression of triangle meshes. | Martin Isenburg, Peter Lindstrom, Jack Snoeyink |
| 2005 | SGP | Streaming Compression of Triangle Meshes. | Martin Isenburg, Peter Lindstrom, Jack Snoeyink |
| 2005 | WABI | Rotamer-Pair Energy Calculations Using a Trie Data Structure. | Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink |
| 2004 | ALENEX | Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. | Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink |
| 2004 | RECOMB | Mining protein family specific residue packing patterns from protein structure graphs. | Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan F. Prins, Alexander Tropsha |
| 2004 | SODA | Almost-Delaunay simplices: nearest neighbor relations for imprecise points. | Deepak Bandyopadhyay, Jack Snoeyink |
| 2004 | SDH | Flooding Triangulated Terrain. | Yuanxin Liu, Jack Snoeyink |
| 2004 | WAFR | Probik: Protein Backbone Motion by Inverse Kinematics. | Kimberly Noonan, David O'Brien, Jack Snoeyink |
| 2003 | CGI | Compressing Texture Coordinates with Selective Linear Predictions. | Martin Isenburg, Jack Snoeyink |
| 2001 | INFOCOM | A Lower Bound for Multicast Key Distribution. | Jack Snoeyink, Subhash Suri, George Varghese |
| 2001 | PG | Compressing the Property Mapping of Polygon Meshes. | Martin Isenburg, Jack Snoeyink |
| 2001 | SODA | Polygonal path approximation with angle constraints. | Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink |
| 2000 | SIGGRAPH | Face fixer: compressing polygon meshes with properties. | Martin Isenburg, Jack Snoeyink |
| 2000 | SODA | Computing contour trees in all dimensions. | Hamish A. Carr, Jack Snoeyink, Ulrike Axen |
| 1999 | ALENEX | Practical Point-in-Polygon Tests Using CSG Representations of Polygons. | Robert J. Walker, Jack Snoeyink |
| 1999 | SODA | Queries with Segments in Voronoi Diagrams. | Sergei Bespamyatnikh, Jack Snoeyink |
| 1997 | ESA | Linear-Time Reconstruction of Delaunay Triangulations with Applications. | Jack Snoeyink, Marc J. van Kreveld |
| 1997 | SIGGRAPH | Using CSG representations of polygons for practical point-in-polygon tests. | Robert J. Walker, Jack Snoeyink |
| 1997 | WADS | Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time. | John Hershberger, Jack Snoeyink |
| 1995 | GD | Optimal Algorithms to Embed Trees in a Point Set. | Prosenjit Bose, Michael McAllister, Jack Snoeyink |
| 1995 | ISAAC | Finding the Medial Axis of a Simple Polygon in Linear Time. | Francis Y. L. Chin, Jack Snoeyink, Cao An Wang |
| 1995 | SODA | Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. | Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap |
| 1995 | WADS | Computing Common Tangents Without a Separating Line. | David G. Kirkpatrick, Jack Snoeyink |
| 1993 | FOCS | A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane | Michael McAllister, David G. Kirkpatrick, Jack Snoeyink |
| 1993 | WADS | Counting and Reporting Red/Blue Segment Intersections. | Larry F. Palazzi, Jack Snoeyink |
| 1992 | ISAAC | Recognizing an Envelope of Lines in Linear Time. | Eric Guvremont, Jack Snoeyink |
| 1991 | ICALP | Ray Shooting in Polygons Using Geodesic Triangulations. | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink |
| 1991 | SODA | Computing a Face in an Arrangement of Line Segments. | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink |
| 1991 | WADS | Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract). | John Hershberger, Jack Snoeyink |
| 1990 | FOCS | Counting and Cutting Cycles of Lines and Rods in Space | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink |
| 1990 | SODA | Compact Interval Trees: A Data Structure for Convex Hulls. | Leonidas J. Guibas, John Hershberger, Jack Snoeyink |
| 1989 | WADS | Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). | Michael T. Goodrich, Jack Snoeyink |
| 1988 | SIGGRAPH | An efficient algorithm for finding the CSG representation of a simple polygon. | David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink |