| 2023 | WALCOM | Minimum Ply Covering of Points with Unit Squares. | Stephane Durocher, J. Mark Keil, Debajyoti Mondal |
| 2023 | WALCOM | Improved and Generalized Algorithms for Burning a Planar Point Set. | Prashant Gokhale, J. Mark Keil, Debajyoti Mondal |
| 2021 | COCOON | Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. | Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal |
| 2019 | WADS | Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. | Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid |
| 2016 | COCOON | Polygon Simplification by Minimizing Convex Corners. | Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal |
| 2010 | LATIN | The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. | Jonathan Backer, J. Mark Keil |
| 2006 | ICCSA | Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks. | Mark D. Watson, J. Mark Keil |
| 2000 | ESA | Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. | Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal |
| 1989 | WADS | The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. | J. Mark Keil, Carl A. Gutwin |