The following pages link to David Bremner (Q517793):
Displaying 30 items.
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- Symmetric matroid polytopes and their generation (Q1041595) (← links)
- (Q1272959) (redirect page) (← links)
- Primal-dual methods for vertex and facet enumeration (Q1272960) (← links)
- Incremental convex hull algorithms are not output sensitive (Q1283741) (← links)
- Inner diagonals of convex polytopes (Q1296758) (← links)
- How good are convex hull algorithms? (Q1356937) (← links)
- Determining the castability of simple polyhedra (Q1364364) (← links)
- Long proteins with unique optimal foldings in the H-P model (Q1873159) (← links)
- Small strictly convex quadrilateral meshes of point sets (Q1889600) (← links)
- All convex polyhedra can be clamped with parallel jaw grippers (Q1924713) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- Output-sensitive algorithms for computing nearest-neighbour decision boundaries (Q2484010) (← links)
- Games on triangulations (Q2570126) (← links)
- Monotone Simultaneous Embeddings of Paths in d Dimensions (Q2961545) (← links)
- (Q3622254) (← links)
- (Q4389428) (← links)
- (Q4474127) (← links)
- (Q4560223) (← links)
- POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER (Q4682204) (← links)
- On Representing Graphs by Touching Cuboids (Q4912201) (← links)
- Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets (Q4915386) (← links)
- Sparktope: linear programs from algorithms (Q5043848) (← links)
- Computing constrained minimum-width annuli of point sets (Q5096955) (← links)
- More bounds on the diameters of convex polytopes (Q5299904) (← links)
- Necklaces, Convolutions, and X + Y (Q5449525) (← links)
- Discrete and Computational Geometry (Q5897086) (← links)
- Algorithms and Data Structures (Q5900775) (← links)
- Incremental convex hull algorithms are not output sensitive (Q6487422) (← links)
