David Bremner

According to our database1, David Bremner authored at least 59 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Achieve privacy-preserving simplicial depth query over collaborative cloud servers.
Peer Peer Netw. Appl., 2020

Outer approximations of core points for integer programming.
CoRR, 2020

Sparktope: linear programs from algorithms.
CoRR, 2020

2019
Polynomial size linear programs for problems in P.
Discret. Appl. Math., 2019

2018
Monotone Simultaneous Paths Embeddings in ℝ<sup>d</sup>.
Discret. Math. Theor. Comput. Sci., 2018

Computing the Planar β-skeleton Depth.
CoRR, 2018

Approximate Data Depth Revisited.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Toward cost-effective replica placements in cloud storage systems with QoS-awareness.
Softw. Pract. Exp., 2017

An Optimal Algorithm for Computing the Spherical Depth of Points in the Plane.
CoRR, 2017

Fusing method handle graphs for efficient dynamic JVM language implementations.
Proceedings of the 9th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages, Vancouver, BC, Canada, October 23, 2017

On the Planar Spherical Depth and Lens Depth.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Monotone Simultaneous Embeddings of Paths in R^d.
CoRR, 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.
Proceedings of the Graph Drawing and Network Visualization, 2016

MHDeS: deduplicating method handle graphs for efficient dynamic JVM language implementations.
Proceedings of the 11th Workshop on Implementation, 2016

2015
Mining Method Handle Graphs for Efficient Dynamic JVM Languages.
Proceedings of the Principles and Practices of Programming on The Java Platform, 2015

A Java util concurrent park contention tool.
Proceedings of the Sixth International Workshop on Programming Models and Applications for Multicores and Manycores, 2015

Metis: a smart memory allocator using historical reclamation information.
Proceedings of the 10th Workshop on Implementation, 2015

2014
Polynomial size linear programs for non-bipartite matching problems and other problems in P.
CoRR, 2014

Editorial.
Comput. Geom., 2014

Necklaces, Convolutions, and X+Y.
Algorithmica, 2014

Monetary-and-QoS Aware Replica Placements in Cloud-Based Storage Systems.
Proceedings of the IEEE 6th International Conference on Cloud Computing Technology and Science, 2014

2013
More bounds on the diameters of convex polytopes.
Optim. Methods Softw., 2013

Editorial.
Comput. Geom., 2013

A Dynamic Moldable Job Scheduling Based Parallel SAT Solver.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

2012
Matroid Enumeration for Incidence Geometry.
Discret. Comput. Geom., 2012

On Representing Graphs by Touching Cuboids.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

Basis Enumeration of Hyperplane Arrangements Up to Symmetries.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets.
Exp. Math., 2011

Pushing the boundaries of polytopal realizability.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2009
Symmetric matroid polytopes and their generation.
Eur. J. Comb., 2009

A Branch and Cut Algorithm for the Halfspace Depth Problem
CoRR, 2009

2008
Output-sensitive algorithms for Tukey depth and related problems.
Stat. Comput., 2008

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms.
J. Comb. Optim., 2008

A note on alpha-drawable k-trees.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Polyhedral representation conversion up to symmetries
CoRR, 2007

2006
Necklaces, Convolutions, and <i>X</i> + <i>Y</i>.
Proceedings of the Algorithms, 2006

Computing the Tool Path of an Externally Monotone Polygon in Linear Time.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Games on triangulations.
Theor. Comput. Sci., 2005

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discret. Comput. Geom., 2005

2004
Small Strictly Convex Quadrilateral Meshes of Point Sets.
Algorithmica, 2004

Experimental lower bounds for three simplex chirality measures in low dimension.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Long proteins with unique optimal foldings in the H-P model.
Comput. Geom., 2003

Primal-dual algorithms for data depth.
Proceedings of the Data Depth: Robust Multivariate Analysis, 2003

Sufficiently Fat Polyhedra are Not 2-Castable.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Playing with Triangulations.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

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

Small Convex Quadrangulations of Point Sets.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Point Visibility Graphs and O-Convex Cover.
Int. J. Comput. Geom. Appl., 2000

1999
Inner Diagonals of Convex Polytopes.
J. Comb. Theory, Ser. A, 1999

Incremental Convex Hull Algorithms Are Not Output Sensitive.
Discret. Comput. Geom., 1999

1998
Primal - Dual Methods for Vertex and Facet Enumeration.
Discret. Comput. Geom., 1998

Computing constrained minimum-width annuli of point sets.
Comput. Aided Des., 1998

Recovering lines with fixed linear probes.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
How Good Are Convex Hull Algorithms?.
Comput. Geom., 1997

Determining the Castability of Simple Polyhedra.
Algorithmica, 1997

Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers.
Comput. Geom., 1996

1995
How Good are Convex Hull Algorithms?
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Link-2-Convex One-Fillable Polygons are Starshaped.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994


  Loading...