Link-2-Convex One-Fillable Polygons are Starshaped. - David Bremner (CCCG, 1994)

How Good are Convex Hull Algorithms? - David Avis; David Bremner (SCG, 1995)

All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers. - Prosenjit Bose; David Bremner; Godfried T. Toussaint (Comput. Geom., 1996)

Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version). - David Bremner; Komei Fukuda; Ambros Marzetta (SCG, 1997)

Determining the Castability of Simple Polyhedra. - Prosenjit Bose; David Bremner; Marc J. van Kreveld (Algorithmica, 1997)

How Good Are Convex Hull Algorithms?. - David Avis; David Bremner; Raimund Seidel (Comput. Geom., 1997)

Recovering lines with fixed linear probes. - Mark de Berg; Prosenjit Bose; David Bremner; William S. Evans; Lata Narayanan (CCCG, 1998)

Computing constrained minimum-width annuli of point sets. - Mark de Berg; Prosenjit Bose; David Bremner; Suneeta Ramaswami; Gordon T. Wilfong (Comput. Aided Des., 1998)

Primal - Dual Methods for Vertex and Facet Enumeration. - David Bremner; Komei Fukuda; Ambros Marzetta (Discret. Comput. Geom., 1998)

Incremental Convex Hull Algorithms Are Not Output Sensitive. - David Bremner (Discret. Comput. Geom., 1999)

Inner Diagonals of Convex Polytopes. - David Bremner; Victor Klee (J. Comb. Theory A, 1999)

Point Visibility Graphs and O-Convex Cover. - David Bremner; Thomas C. Shermer (Int. J. Comput. Geom. Appl., 2000)

Small Convex Quadrangulations of Point Sets. - David Bremner; Ferran Hurtado; Suneeta Ramaswami; Vera Sacristán (ISAAC, 2001)

Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial. - David Bremner (Comput. Geom., 2001)

Playing with Triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (JCDCG, 2002)

Sufficiently Fat Polyhedra are Not 2-Castable. - Alexander Golynski; David Bremner (CCCG, 2003)

Primal-dual algorithms for data depth. - David Bremner; Komei Fukuda; Vera Rosta (Data Depth: Robust Multivariate Analysis, Computational Geometry and Applications, 2003)

Long proteins with unique optimal foldings in the H-P model. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Henk Meijer; Vera Sacristán; Michael A. Soss (Comput. Geom., 2003)

Experimental lower bounds for three simplex chirality measures in low dimension. - David Bremner; David E. Gay (CCCG, 2004)

Small Strictly Convex Quadrilateral Meshes of Point Sets. - David Bremner; Ferran Hurtado; Suneeta Ramaswami; Vera Sacristán (Algorithmica, 2004)

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. - David Bremner; Erik D. Demaine; Jeff Erickson 001; John Iacono; Stefan Langerman; Pat Morin; Godfried T. Toussaint (Discret. Comput. Geom., 2005)

Games on triangulations. - Oswin Aichholzer; David Bremner; Erik D. Demaine; Ferran Hurtado; Evangelos Kranakis; Hannes Krasser; Suneeta Ramaswami; Saurabh Sethia; Jorge Urrutia (Theor. Comput. Sci., 2005)

Computing the Tool Path of an Externally Monotone Polygon in Linear Time. - Prosenjit Bose; David Bremner; Diane L. Souvaine (CCCG, 2006)

Necklaces, Convolutions, and X + Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Perouz Taslakian (ESA, 2006)

Polyhedral representation conversion up to symmetries - David Bremner; Mathieu Dutour Sikiric; Achill Schürmann (CoRR, 2007)

A note on alpha-drawable k-trees. - Svetlana Stolpner; Jonathan Lenchner; Giuseppe Liotta; David Bremner; Christophe Paul; Marc Pouget; Stephen K. Wismath (CCCG, 2008)

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms. - David Bremner; Antoine Deza; Michael Soltys (J. Comb. Optim., 2008)

Output-sensitive algorithms for Tukey depth and related problems. - David Bremner; Dan Chen 003; John Iacono; Stefan Langerman; Pat Morin (Stat. Comput., 2008)

A Branch and Cut Algorithm for the Halfspace Depth Problem - David Bremner; Dan Chen 003 (CoRR, 2009)

Symmetric matroid polytopes and their generation. - Jürgen Bokowski; David Bremner; Gábor Gévay (Eur. J. Comb., 2009)

Pushing the boundaries of polytopal realizability. - David Bremner; Antoine Deza; William Hua; Lars Schewe (CCCG, 2011)

Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets. - David Bremner; Lars Schewe (Exp. Math., 2011)

Basis Enumeration of Hyperplane Arrangements Up to Symmetries. - Aaron Moss; David Bremner (CCCG, 2012)

On Representing Graphs by Touching Cuboids. - David Bremner; William S. Evans; Fabrizio Frati; Laurie J. Heyer; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; David Rappaport; Sue Whitesides (GD, 2012)

Matroid Enumeration for Incidence Geometry. - Yoshitake Matsumoto; Sonoko Moriyama; Hiroshi Imai; David Bremner (Discret. Comput. Geom., 2012)

A Dynamic Moldable Job Scheduling Based Parallel SAT Solver. - Sajjad Asghar; Eric Aubanel; David Bremner (ICPP, 2013)

Editorial. - David Bremner; Antoine Deza; Hiroshi Imai; Sonoko Moriyama (Comput. Geom., 2013)

More bounds on the diameters of convex polytopes. - David Bremner; Antoine Deza; William Hua; Lars Schewe (Optim. Methods Softw., 2013)

Monetary-and-QoS Aware Replica Placements in Cloud-Based Storage Systems. - Lingfang Zeng; Shijie Xu; Yang Wang 006; Xiang Cui; Tan Wee Kiat; David Bremner; Kenneth B. Kent (CloudCom, 2014)

Necklaces, Convolutions, and X+Y. - David Bremner; Timothy M. Chan; Erik D. Demaine; Jeff Erickson 001; Ferran Hurtado; John Iacono; Stefan Langerman; Mihai Patrascu; Perouz Taslakian (Algorithmica, 2014)

Editorial. - Greg Aloupis; David Bremner (Comput. Geom., 2014)

Polynomial size linear programs for non-bipartite matching problems and other problems in P. - David Avis; David Bremner; Hans Raj Tiwary; Osamu Watanabe 001 (CoRR, 2014)

Computing symmetry groups of polyhedra. - David Bremner; Mathieu Dutour Sikiric; Dmitrii V. Pasechnik; Thomas Rehn; Achill Schürmann (LMS J. Comput. Math., 2014)

Metis: a smart memory allocator using historical reclamation information. - Shijie Xu; Qi Guo 001; Gerhard W. Dueck; David Bremner; Yang Wang 006 (ICOOOLPS@ECOOP, 2015)

A Java util concurrent park contention tool. - Panagiotis Patros; Eric Aubanel; David Bremner; Michael Dawson 001 (PMAM@PPoPP, 2015)

Mining Method Handle Graphs for Efficient Dynamic JVM Languages. - Shijie Xu; David Bremner; Daniel Heidinga (PPPJ, 2015)

MHDeS: deduplicating method handle graphs for efficient dynamic JVM language implementations. - Shijie Xu; David Bremner; Daniel Heidinga (ICOOOLPS@ECOOP, 2016)

Monotone Simultaneous Embeddings of Paths in d Dimensions. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (GD, 2016)

Monotone Simultaneous Embeddings of Paths in R^d. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (CoRR, 2016)

On the Planar Spherical Depth and Lens Depth. - David Bremner; Rasoul Shahsavarifar (CCCG, 2017)

Fusing method handle graphs for efficient dynamic JVM language implementations. - Shijie Xu; David Bremner; Daniel Heidinga (VMIL@SPLASH, 2017)

An Optimal Algorithm for Computing the Spherical Depth of Points in the Plane. - David Bremner; Rasoul Shahsavarifar (CoRR, 2017)

Toward cost-effective replica placements in cloud storage systems with QoS-awareness. - Lingfang Zeng; Shijie Xu; Yang Wang 006; Kenneth B. Kent; David Bremner; Cheng-Zhong Xu 001 (Softw. Pract. Exp., 2017)

Approximate Data Depth Revisited. - David Bremner; Rasoul Shahsavarifar (CCCG, 2018)

Computing the Planar β-skeleton Depth. - Rasoul Shahsavarifar; David Bremner (CoRR, 2018)

Monotone Simultaneous Paths Embeddings in ℝd. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Guillaume Moroz; Sue Whitesides; Stephen K. Wismath (Discret. Math. Theor. Comput. Sci., 2018)

Polynomial size linear programs for problems in P. - David Avis; David Bremner; Hans Raj Tiwary; Osamu Watanabe 001 (Discret. Appl. Math., 2019)

4th workshop on advances in open runtimes and cloud performance technologies. - Daryl Maier; Vijay Sundaresan; David Bremner (CASCON, 2020)

Outer approximations of core points for integer programming. - David Bremner; Naghmeh Shahverdi (CoRR, 2020)

Achieve privacy-preserving simplicial depth query over collaborative cloud servers. - Hassan Mahdikhani; Rasoul Shahsavarifar; Rongxing Lu; David Bremner (Peer-to-Peer Netw. Appl., 2020)

Eclipse OMR garbage collection for tracing JIT-based virtual machines. - Joannah Nanjekye; David Bremner; Aleksandar Micic (CASCON, 2021)

The Garbage Collection Cost For Meta-Tracing JIT-based Dynamic Languages. - Joannah Nanjekye; David Bremner; Aleksandar Micic (CASCON, 2022)

Sparktope: linear programs from algorithms. - David Avis; David Bremner (Optim. Methods Softw., 2022)

Towards Reliable Memory Management for Python Native Extensions. - Joannah Nanjekye; David Bremner; Aleksandar Micic (ICOOOLPS@ECOOP, 2023)

Optimizations for Dynamic Collections. - Joannah Nanjekye; David Bremner; Aleksandar Micic (J. Object Technol., 2025)