Search the dblp DataBase

Publications of Author

1. Stephane Durocher, David G. Kirkpatrick
   On the hardness of turn-angle-restricted rectilinear cycle cover problems. [Citation Graph (0, 0)][DBLP]
   CCCG, 2002, pp:13-16 [Conf]
   
2. Stephane Durocher, David G. Kirkpatrick
   The Gaussian Centre of a Set of Mobile Points. [Citation Graph (0, 0)][DBLP]
   CCCG, 2003, pp:123-127 [Conf]
   
3. Stephane Durocher, David G. Kirkpatrick
   The gaussian centre and the projection centre of a set of points in r³. [Citation Graph (0, 0)][DBLP]
   CCCG, 2004, pp:140-144 [Conf]
   
4. Stephane Durocher, David G. Kirkpatrick
   The Projection Median of a Set of Points in R². [Citation Graph (0, 0)][DBLP]
   CCCG, 2005, pp:47-51 [Conf]
   
5. Alex Brodsky, Stephane Durocher, Ellen Gethner
   The Rectilinear Crossing Number of K₁₀ is 62. [Citation Graph (0, 0)][DBLP]
   Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
   
6. Alex Brodsky, Stephane Durocher, Ellen Gethner
   The Rectilinear Crossing Number of K_10 is 62 [Citation Graph (0, 0)][DBLP]
   CoRR, 2000, v:0, n:, pp:- [Journal]
   
7. Alex Brodsky, Stephane Durocher, Ellen Gethner
   Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics [Citation Graph (0, 0)][DBLP]
   CoRR, 2000, v:0, n:, pp:- [Journal]
   
8. Alex Brodsky, Stephane Durocher, Ellen Gethner
   Toward the rectilinear crossing number of K_n: new drawings, upper bounds, and asymptotics. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:262, n:1-3, pp:59-77 [Journal]
   
9. Stephane Durocher, David G. Kirkpatrick
   The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 2006, v:16, n:4, pp:345-372 [Journal]
   
10. Stephane Durocher, Chris Gray, James A. King
    Minimizing the Number of Arcs Linking a Permutation of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
    
11. 
    Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    Kinetic Maintenance of Mobile k-Centres on Trees. [Citation Graph (, )][DBLP]
    
    
13. 
    Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm. [Citation Graph (, )][DBLP]
    
    
14. 
    Reconstructing Polygons from Scanner Data. [Citation Graph (, )][DBLP]
    
    
15. 
    Untangled Monotonic Chains and Adaptive Range Search. [Citation Graph (, )][DBLP]
    
    
16. 
    Bounding the locality of distributed routing algorithms. [Citation Graph (, )][DBLP]
    
    
17. 
    On the Structure of Small Motif Recognition Instances. [Citation Graph (, )][DBLP]
    
    
18. 
    Balancing Traffic Load Using One-Turn Rectilinear Routing. [Citation Graph (, )][DBLP]
    
    
19. 
    Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. [Citation Graph (, )][DBLP]
    
    
20. 
    On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. [Citation Graph (, )][DBLP]
    
    
21. 
    The projection median of a set of points. [Citation Graph (, )][DBLP]
    
    
22. 
    Fixed-Parameter Tractability and Improved Approximations for Segment Minimization [Citation Graph (, )][DBLP]
    
    
23. 
    Kinetic maintenance of mobile k-centres on trees. [Citation Graph (, )][DBLP]