| How good are convex hull algorithms? D Avis, D Bremner Proceedings of the eleventh annual symposium on Computational geometry, 20-28, 1995 | 476 | 1995 |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ... Discrete & Computational Geometry 33, 593-604, 2005 | 271 | 2005 |
| Primal-dual methods for vertex and facet enumeration (preliminary version) D Bremner, K Fukuda, A Marzetta Proceedings of the thirteenth annual symposium on Computational geometry, 49-56, 1997 | 216 | 1997 |
| Necklaces, convolutions, and X+ Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithmica 69 (2), 294-314, 2014 | 66 | 2014 |
| Necklaces, Convolutions, and X + Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006 | 64 | 2006 |
| Polyhedral representation conversion up to symmetries D Bremner, MD Sikiric, A Schürmann arXiv preprint math/0702239, 2007 | 61 | 2007 |
| Output-sensitive algorithms for Tukey depth and related problems D Bremner, D Chen, J Iacono, S Langerman, P Morin Statistics and Computing 18, 259-266, 2008 | 55 | 2008 |
| Matroid enumeration for incidence geometry Y Matsumoto, S Moriyama, H Imai, D Bremner Discrete & Computational Geometry 47, 17-43, 2012 | 54 | 2012 |
| Computing constrained minimum-width annuli of point sets M De Berg, P Bose, D Bremner, S Ramaswami, G Wilfong Computer-Aided Design 30 (4), 267-275, 1998 | 53 | 1998 |
| Computing symmetry groups of polyhedra D Bremner, MD Sikirić, DV Pasechnik, T Rehn, A Schürmann LMS Journal of computation and mathematics 17 (1), 565-581, 2014 | 45 | 2014 |
| Incremental convex hull algorithms are not output sensitive D Bremner Discrete & Computational Geometry 21 (1), 57-68, 1999 | 42 | 1999 |
| Determining the castability of simple polyhedra P Bose, D Bremner, M van Kreveld Algorithmica 19 (1), 84-113, 1997 | 37 | 1997 |
| Long proteins with unique optimal foldings in the HP model O Aichholzer, D Bremner, ED Demaine, H Meijer, V Sacristán, M Soss Computational Geometry 25 (1-2), 139-159, 2003 | 32 | 2003 |
| Edge-graph diameter bounds for convex polytopes with few facets D Bremner, L Schewe Experimental Mathematics 20 (3), 229-237, 2011 | 25 | 2011 |
| On the complexity of vertex and facet enumeration for convex polytopes DD Bremner McGill University, 1997 | 24 | 1997 |
| On representing graphs by touching cuboids D Bremner, W Evans, F Frati, L Heyer, SG Kobourov, WJ Lenhart, G Liotta, ... Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013 | 23 | 2013 |
| Toward cost‐effective replica placements in cloud storage systems with QoS‐awareness L Zeng, S Xu, Y Wang, KB Kent, D Bremner, C Xu Software: Practice and Experience 47 (6), 813-829, 2017 | 21 | 2017 |
| Incremental convex hull algorithms are not output sensitive D Bremner International Symposium on Algorithms and Computation, 26-35, 1996 | 19 | 1996 |
| All convex polyhedra can be clamped with parallel jaw grippers P Bose, D Bremner, G Toussaint Computational Geometry 6 (5), 291-302, 1996 | 17 | 1996 |
| Motion planning amidst movable square blocks is PSPACE complete D Bremner, J O’Rourke, T Shermer Draft, June 28, 1994 | 17 | 1994 |
