The SCEAS System
| |||||||

## Search the dblp DataBase
Stephane Durocher:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Stephane Durocher, David G. Kirkpatrick
**The gaussian centre and the projection centre of a set of points in r**[Citation Graph (0, 0)][DBLP]^{3}. CCCG, 2004, pp:140-144 [Conf] - Stephane Durocher, David G. Kirkpatrick
**The Projection Median of a Set of Points in R**[Citation Graph (0, 0)][DBLP]^{2}. CCCG, 2005, pp:47-51 [Conf] - Alex Brodsky, Stephane Durocher, Ellen Gethner
**The Rectilinear Crossing Number of K**[Citation Graph (0, 0)][DBLP]_{10}is 62. Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal] - 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] - 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] - Alex Brodsky, Stephane Durocher, Ellen Gethner
**Toward the rectilinear crossing number of**[Citation Graph (0, 0)][DBLP]*K*: new drawings, upper bounds, and asymptotics._{n} Discrete Mathematics, 2003, v:262, n:1-3, pp:59-77 [Journal] - 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] - 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] **Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs.**[Citation Graph (, )][DBLP]**Kinetic Maintenance of Mobile k-Centres on Trees.**[Citation Graph (, )][DBLP]**Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.**[Citation Graph (, )][DBLP]**Reconstructing Polygons from Scanner Data.**[Citation Graph (, )][DBLP]**Untangled Monotonic Chains and Adaptive Range Search.**[Citation Graph (, )][DBLP]**Bounding the locality of distributed routing algorithms.**[Citation Graph (, )][DBLP]**On the Structure of Small Motif Recognition Instances.**[Citation Graph (, )][DBLP]**Balancing Traffic Load Using One-Turn Rectilinear Routing.**[Citation Graph (, )][DBLP]**Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.**[Citation Graph (, )][DBLP]**On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks.**[Citation Graph (, )][DBLP]**The projection median of a set of points.**[Citation Graph (, )][DBLP]**Fixed-Parameter Tractability and Improved Approximations for Segment Minimization**[Citation Graph (, )][DBLP]**Kinetic maintenance of mobile k-centres on trees.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |