Probing Polygons Minimally Is Hard. - Patrice Belleville; Thomas C. Shermer (Comput. Geom., 1992)

On Restricted Boundary Covers and Convex Three-Covers. - Patrice Belleville (CCCG, 1993)

K-Guarding Polygons on the Plane. - Patrice Belleville; Prosenjit Bose; Jurek Czyzowicz; Jorge Urrutia; Joseph Zaks (CCCG, 1994)

Convex covers in higher dimensions. - Patrice Belleville (CCCG, 1995)

On Computing Edges That Are In All Minimum-Weight Triangulations. - Patrice Belleville; J. Mark Keil; Michael McAllister; Jack Snoeyink (SCG, 1996)

Testing Simple Polygons. - Esther M. Arkin; Patrice Belleville; Joseph S. B. Mitchell; David M. Mount; Kathleen Romanik; Steven Salzberg; Diane L. Souvaine (Comput. Geom., 1997)

Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs. - J. Mark Keil; Patrice Belleville (Discret. Appl. Math., 2004)

Inverted Two-Stage Exams for Prospective Learning: Using an Initial Group Stage to Incentivize Anticipation of Transfer. - Patrice Belleville; Steven A. Wolfman; Susanne Bradley; Cinda Heeren (SIGCSE, 2020)

Expanding the Horizons of Autograding: Innovative Questions at UBC. - Jeffrey Niu; Jessica Wong; Charlie Lake; Justin Rahardjo; Hedayat Zarkoob; Oluwakemi Ola; Patrice Belleville; Karina Mochetti; Meghan Allen; Firas Moosvi; Steven A. Wolfman (SIGCSE (1), 2025)