| 2002 | ECCV | A Reflective Symmetry Descriptor. | Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser |
| 1999 | SIGGRAPH | Multiresolution Mesh Morphing. | Aaron W. F. Lee, David P. Dobkin, Wim Sweldens, Peter Schrder |
| 1998 | SIGGRAPH | MAPS: Multiresolution Adaptive Parameterization of Surfaces. | Aaron W. F. Lee, Wim Sweldens, Peter Schrder, Lawrence C. Cowsar, David P. Dobkin |
| 1997 | GD | Implementing a General-Purpose Edge Router. | David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North |
| 1997 | WADS | Applied Computational Geormetry - Abstract. | David P. Dobkin |
| 1995 | COLT | Concept Learning with Geometric Hypotheses. | David P. Dobkin, Dimitrios Gunopulos |
| 1990 | ICALP | Determining the Separation of Preprocessed Polyhedra - A Unified Approach. | David P. Dobkin, David G. Kirkpatrick |
| 1990 | SODA | Visibility with a Moving Point of View. | Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman |
| 1989 | FOCS | Dynamically Computing the Maxima of Decomposable Functions, with Applications | David P. Dobkin, Subhash Suri |
| 1988 | SIGGRAPH | An efficient algorithm for finding the CSG representation of a simple polygon. | David P. Dobkin, Leonidas J. Guibas, John Hershberger, Jack Snoeyink |
| 1987 | FOCS | Delaunay Graphs are Almost as Good as Complete Graphs | David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit |
| 1986 | STOC | Probing Convex Polytopes | David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap |
| 1984 | FOCS | Space Searching for Intersecting Objects | David P. Dobkin, Herbert Edelsbrunner |
| 1982 | ICALP | Fast Detection of Polyhedral Intersections. | David P. Dobkin, David G. Kirkpatrick |
| 1982 | PODC | Distributed Allocation with Pools of Servers. | Gregory R. Andrews, David P. Dobkin, Peter J. Downey |
| 1982 | STOC | Finding Extremal Polygons | James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas |
| 1981 | ICSE | Active Data Structures. | Gregory R. Andrews, David P. Dobkin, Peter J. Downey |
| 1980 | FOCS | Efficient Uses of the Past | David P. Dobkin, J. Ian Munro |
| 1980 | STOC | Detection is Easier than Computation (Extended Abstract) | Bernard Chazelle, David P. Dobkin |
| 1979 | FOCS | On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract) | David P. Dobkin, Lawrence Snyder |
| 1979 | STOC | Decomposing a Polygon into its Convex Parts | Bernard Chazelle, David P. Dobkin |
| 1978 | COMPSAC | Recent progress in secure computation. | Richard A. DeMillo, David P. Dobkin |
| 1978 | ICALP | Time and Space Bounds for Selection Problems. | David P. Dobkin, J. Ian Munro |
| 1976 | MFCS | A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem. | David P. Dobkin, Richard J. Lipton |
| 1975 | STOC | Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms | Richard J. Lipton, David P. Dobkin |
| 1974 | STOC | On Some Generalizations of Binary Search | David P. Dobkin, Richard J. Lipton |
| 1973 | FOCS | On the Optimal Evaluation of a Set of n-Linear Forms | David P. Dobkin |
| 1973 | STOC | On the Optimal Evaluation of a Set of Bilinear Forms | Roger W. Brockett, David P. Dobkin |