- CCCG 2006, Kingston, Ontario, August 14--16, 2006 Minimizing the Number of Arcs Linking a Permutation of Points in the Plane
- The Rectilinear Crossing Number of K10 is 62 Alex Brodsky
- On the structure of small motif recognition instances
- Kinetic Maintenance of Mobile k-Centres on Stephane Durocher ,1
- 16th Canadian Conference on Computational Geometry, 2004 The Gaussian Centre and the Projection Centre of a Set of Points in
- December 16, 2009 3:44 WSPC/INSTRUCTION FILE dmaadiskcovernew
- International Journal of Computational Geometry ttfti^^ > _ * * , , . . . . w g world scientific& Applications VlB^ TZ--:--nr
- Untangled Monotonic Chains and Adaptive Range Search
- Math ematics 262 (2003) 59 --77 www.elsevier.com/locate/disc
- The Projection Median of a Set of Points in R 2 Stephane Durocher # David Kirkpatrick +
- CCCG 2003, Halifax, Nova Scotia, August 11--13, 2003 The Gaussian Centre of a Set of Mobile Points
- RESTRICTED 2FACTOR PROBLEMS ARISING FROM MOMENTBASED POLYGON RECONSTRUCTION \Lambda
- Modelling Gateway Placement in Wireless Networks: Geometric k-Centres of Unit Disc Graphs
- A Note on Improving the Performance of Approximation Algorithms for Radiation Therapy
- The Rectilinear Crossing Number of K 10 is 62 Alex Brodsky Stephane Durocher
- Modelling Gateway Placement in Wireless Networks: Geometric k-Centres of Unit Disc Graphs$
- GraphTheoretic and Geometric Algorithms Associated with MomentBased Polygon Reconstruction
- Balancing Traffic Load Using One-Turn Rectilinear Routing
- Bounded-velocity Approximations of the Mobile Euclidean 2-centre extended abstract
- Boundedvelocity Approximations of the Mobile Euclidean 2centre extended abstract
- Range Majority in Constant Time and Linear Space
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded
- The Projection Median of a Set of Points Stephane Durocher
- 16th Canadian Conference on Computational Geometry, 2004 The Gaussian Centre and the Projection Centre of a Set of Points in R 3
- Faster Optimal Algorithms For Segment Minimization With Small Maximal Value
- Linear-Space Data Structures for Range Mode Query in Arrays S. Durocher
- CCCG 2003, Halifax, Nova Scotia, August 1113, 2003 The Gaussian Centre of a Set of Mobile Points
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
- A Misunderstanding of Principal and Medial Axes? Reply to Sturz and Bodily (2011) Kelly, D.M.,1
- July 31, 2009 11:23 WSPC/INSTRUCTION FILE dkknJOIN2009 Journal of Interconnection Networks
- Discrete Mathematics 262 (2003) 5977 www.elsevier.com/locate/disc
- Reconstructing Polygons from Scanner Data Therese Biedl1,
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
- Bounding the Locality of Distributed Routing Algorithms [Extended Abstract]
- Kinetic Maintenance of Mobile k-Centres on Stephane Durocher1,
- CCCG 2006, Kingston, Ontario, August 1416, 2006 Minimizing the Number of Arcs Linking a Permutation of Points in the Plane
- The Projection Median of a Set of Points in R2 Stephane Durocher
- Reconstructing Polygons from Scanner Data Therese Biedl
- On the Hardness of TurnAngleRestricted Rectilinear Cycle Cover Extended Abstract
- Geometric Facility Location under Continuous Motion BoundedVelocity Approximations to the Mobile Euclidean
- On the Hardness of Turn-Angle-Restricted Rectilinear Cycle Cover Extended Abstract
- Geometric Facility Location under Continuous Motion Bounded-Velocity Approximations to the Mobile Euclidean
- Reconstructing Polygons from Scanner Data$ Therese Biedla,1
- Untangled Monotonic Chains and Adaptive Range Search6
- Geometric Models 1 Comparing Geometric Models for Orientation: Medial vs. Principal Axes
- CCCG 2011, Toronto ON, August 1012, 2011 Realizing Site Permutations
- CCCG 2011, Toronto ON, August 1012, 2011 A Note on Minimum-Segment Drawings of Planar Graphs
- Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order
- Embedding Plane 3-Trees in R2 Stephane Durocher1
- Range Majority in Constant Time and Linear Space$ Stephane Durochera
- On the Hardness of Point-Set Embeddability (Extended Abstract)
- A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query
- Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position