Publications
indicates that a conference version of the paper appears below.
indicates that a journal version of the paper appears above.
The journal version is more recent (and usually more complete).

My current research is funded by an NSERC Discovery Grant, the University Research Grants Program at the University of Manitoba, and a University of Manitoba Start-Up Research Grant. Here is (an approximation of) my co-author graph, my DBLP page, and my Google Scholar page.

Articles published or accepted for publication in refereed journals
Cool-lex Order and k-ary Catalan Structures.
Stephane Durocher, Ben Li, Debajyoti Mondal, Frank Ruskey, and Aaron Williams.
To appear in the Journal of Discrete Algorithms.
33 pages. Invited contribution, 2012. (pdf)
Range Majority in Constant Time and Linear Space.
Stephane Durocher, Meng He, Ian Munro, Patrick Nicholson, and Matthew Skala.
To appear in Information and Computation.
19 pages. Invited contribution, 2012. (pdf)
Untangled Monotonic Chains and Adaptive Range Search.
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, Ian Munro, Patrick Nicholson, Alejandro Salinger, and Matthew Skala.
Theoretical Computer Science.
412(32):4200-4211. Invited contribution, 2011. (pdf) (doi)
A Note on Improving the Performance of Approximation Algorithms for Radiation Therapy.
Therese Biedl, Stephane Durocher, Holger Hoos, Shuang Luan, Jared Saia, and Maxwell Young.
Information Processing Letters.
111(7):326-333. 2011. (pdf) (doi)
Modelling Gateway Placement in Wireless Networks: Geometric k-Centres of Unit Disc Graphs.
Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, and Lata Narayanan.
Computational Geometry: Theory and Applications.
44(5):286-302. 2011. (pdf) (doi)
Reconstructing Polygons from Scanner Data.
Therese Biedl, Stephane Durocher, and Jack Snoeyink.
Theoretical Computer Science.
412(32):4161-4172. Invited contribution, 2011. (pdf) (doi)
Comparing Geometric Models for Orientation: Medial vs. Principal Axes.
Debbie Kelly and Stephane Durocher.
Communicative and Integrative Biology.
4(6):710-712. Invited contribution, 2011. (pdf) (link) (doi)
A Misunderstanding of Principal and Medial Axes? Reply to Sturz and Bodily (2011).
Debbie Kelly, Stephane Durocher, Cinzia Chiandetti, and Giorgio Vallortigara.
Biology Letters.
7(5):649-650. Invited contribution, 2011. (pdf) (doi)
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.
Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson, and Alejandro Salinger.
Discrete Mathematics, Algorithms, and Applications.
2(1):77-87. Invited contribution, 2010. (pdf) (doi)
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks.
Stephane Durocher, David Kirkpatrick, and Lata Narayanan.
Wireless Networks.
16(1):227-235. 2010. (pdf) (doi)
Balancing Traffic Load Using One-Turn Rectilinear Routing.
Stephane Durocher, Evangelos Kranakis, Danny Krizanc, and Lata Narayanan.
Journal of Interconnection Networks.
10(1-2):93-120. 2009. (pdf) (doi)
The Projection Median of a Set of Points.
Stephane Durocher and David Kirkpatrick.
Computational Geometry: Theory and Applications.
42(5):364-375. Invited contribution, 2009. (pdf) (doi)
Kinetic Maintenance of Mobile k-Centres on Trees.
Stephane Durocher and Christophe Paul.
Discrete Applied Mathematics.
157(7):1432-1446. 2009. (pdf) (doi)
Bounded-Velocity Approximation of Mobile Euclidean 2-Centres.
Stephane Durocher and David Kirkpatrick.
International Journal of Computational Geometry and Applications.
18(3):161-183. 2008. (pdf) (doi)
The Steiner Centre: Stability, Eccentricity, and Applications to Mobile Facility Location.
Stephane Durocher and David Kirkpatrick.
International Journal of Computational Geometry and Applications.
16(4):345-371. 2006. (postscript) (pdf) (doi)
Toward the Rectilinear Crossing Number of Kn: New Drawings, Upper Bounds, and Asymptotics.
Alex Brodsky, Stephane Durocher, and Ellen Gethner.
Discrete Mathematics.
262(1-3):59-77. 2003. (postscript) (pdf) (doi)
The Rectilinear Crossing Number of K10 is 62.
Alex Brodsky, Stephane Durocher, and Ellen Gethner.
Electronic Journal of Combinatorics.
8(1):R23 1-30. 2001. (postscript) (pdf) (link)
Articles published or accepted for publication in refereed conference proceedings
Linear-Space Data Structures for Range Minority Query in Arrays.
Timothy M. Chan, Stephane Durocher, Matthew Skala, and Bryan T. Wilkinson.
To appear in proceedings of the Thirteenth Scandanavian Symposium and Workshops on Algorithm Theory (SWAT 2012).
Springer Lecture Notes in Computer Science. 7357:295-306. 2012. (pdf)
Linear-Space Data Structures for Range Mode Query in Arrays.
Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, and Bryan T. Wilkinson.
In proceedings of the Twenty-Ninth Symposium on Theoretical Aspects of Computer Science (STACS 2012).
Leibniz International Proceedings in Informatics. 14:291-301. 2012. (pdf) (doi)
Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position.
Majid Khabbazian, Stephane Durocher, and Alireza Haghnegahdar.
To appear in proceedings of the Nineteenth International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012).
Springer Lecture Notes in Computer Science. 7355:85-98. 2012. (pdf) (arXiv:1111.6689)
Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number.
Stephane Durocher and Saeed Mehrabi.
To appear in proceedings of the Eighteenth International Computing and Combinatorics Conference (COCOON 2012).
Springer Lecture Notes in Computer Science. 12 pages. 2012. (pdf)
On the Hardness of Point-Set Embeddability.
Stephane Durocher and Debajyoti Mondal.
In proceedings of the Sixth Workshop on Algorithms and Computation (WALCOM 2012).
Springer Lecture Notes in Computer Science. 7157:148-159. 2012. (pdf) (doi)
Hamiltonian Paths and Cycles in Planar Graphs.
Sudip Biswas, Stephane Durocher, Debajyoti Mondal, and Rahnuma Islam Nishat.
To appear in proceedings of the Sixth International Conference on Combinatorial Optimization and Applications (COCOA 2012).
Springer Lecture Notes in Computer Science. 7402:12 pages. 2012. (pdf)
Portrait Drawing Robot with a Geometric Graph Approach: Furthest Neighbour Theta-Graphs.
Meng Cheng Lau, Jacky Baltes, John Anderson, and Stephane Durocher.
To appear in proceedings of the Eleventh IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2012).
5 pages. 2012. (pdf)
Range Majority in Constant Time and Linear Space.
Stephane Durocher, Meng He, Ian Munro, Patrick Nicholson, and Matthew Skala.
In proceedings of the Thirty-Eighth International Colloquium on Automata, Languages and Programming (ICALP 2011).
Springer Lecture Notes in Computer Science. 6755:244-255. 2011. (pdf) (doi)
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value.
Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, and Maxwell Young.
In proceedings of the Thirteenth Algorithms and Data Structures Symposium (WADS 2011).
Springer Lecture Notes in Computer Science. 6844:86-97. 2011. (pdf) (doi)
Embedding Plane 3-Trees in R2 and R3.
Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, and Sue Whitesides.
In proceedings of the Nineteenth International Symposium on Graph Drawing (GD 2011).
Springer Lecture Notes in Computer Science. 7034:39-51. 2011. (pdf) (doi)
Realizing Site Permutations.
Stephane Durocher, Saeed Mehrabi, Debajyoti Mondal, and Matthew Skala.
In proceedings of the Twenty-Third Canadian Conference on Computational Geometry (CCCG 2011).
23:355-360. 2011. (pdf)
A Note on Minimum-Segment Drawings of Planar Graphs.
Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, and Sue Whitesides.
In proceedings of the Twenty-Third Canadian Conference on Computational Geometry (CCCG 2011).
23:303-308. 2011. (pdf)
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.
Stephane Durocher, Ben Li, Debajyoti Mondal, and Aaron Williams.
In proceedings of the Twenty-Second International Workshop on Combinatorial Algorithms (IWOCA 2011).
Springer Lecture Notes in Computer Science. 7056:182-194. 2011. (pdf) (doi)
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.
Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, Ian Munro, Alejandro Salinger, and Matthew Skala.
In proceedings of the Eleventh Algorithms and Data Structures Symposium (WADS 2009).
Springer Lecture Notes in Computer Science. 5664:218-229. 2009. (pdf) (doi)
Bounding the Locality of Distributed Routing Algorithms.
Prosenjit Bose, Paz Carmi, and Stephane Durocher.
In proceedings of the Twenty-Eighth ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2009).
ACM. 28:250-259. 2009. (pdf) (doi)
Reconstructing Polygons from Scanner Data.
Therese Biedl, Stephane Durocher, and Jack Snoeyink.
In proceedings of the Twentieth International Symposium on Algorithms and Computation (ISAAC 2009).
Springer Lecture Notes in Computer Science. 5878:862-871. 2009. (pdf) (doi)
Untangled Monotonic Chains and Adaptive Range Search.
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He, Alejandro López-Ortiz, Ian Munro, Patrick Nicholson, Alejandro Salinger, and Matthew Skala.
In proceedings of the Twentieth International Symposium on Algorithms and Computation (ISAAC 2009).
Springer Lecture Notes in Computer Science. 5878:203-212. 2009. (pdf) (doi)
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.
Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz, and Alejandro Salinger.
In proceedings of the Twentieth International Symposium on Algorithms and Computation (ISAAC 2009).
Springer Lecture Notes in Computer Science. 5878:45-54. 2009. (pdf) (doi)
Modelling Gateway Placement in Wireless Networks: Geometric k-Centres of Unit Disc Graphs.
Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, and Lata Narayanan.
In proceedings of the Fifth ACM SIGACT-SIGOPS International Workshop on Foundations of Mobile Computing (FOMC 2008).
ACM. 5:79-86. 2008. (pdf) (doi)
On the Structure of Small Motif Finding Instances.
Christina Boucher, Daniel Brown, and Stephane Durocher.
In proceedings of the Fifteenth String Processing and Information Retrieval Symposium (SPIRE 2008).
Springer Lecture Notes in Computer Science. 5280:269-281. 2008. (pdf) (doi)
Balancing Traffic Load Using One-Turn Rectilinear Routing.
Stephane Durocher, Evangelos Kranakis, Danny Krizanc, and Lata Narayanan.
In proceedings of the Fifth Annual Conference on Theory and Applications of Models of Computation (TAMC 2008).
Springer Lecture Notes in Computer Science. 4978:467-478. 2008. (pdf) (doi)
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks.
Stephane Durocher, David Kirkpatrick, and Lata Narayanan.
In proceedings of the Ninth International Conference on Distributed Computing and Networking (ICDCN 2008).
Winner of best paper award. Springer Lecture Notes in Computer Science. 4904:546-557. 2008. (pdf) (doi)
Kinetic Maintenance of Mobile k-Centres on Trees.
Stephane Durocher and Christophe Paul.
In proceedings of the Eighteenth International Symposium on Algorithms and Computation (ISAAC 2007).
Springer Lecture Notes in Computer Science. 4835:341-352. 2007. (pdf) (doi)
Minimizing the Number of Arcs Linking a Permutation of Points in the Plane.
Stephane Durocher, Chris Gray, and James King.
In proceedings of the Eighteenth Canadian Conference on Computational Geometry (CCCG 2006).
18:181-184. 2006. (postscript) (pdf)
The Projection Median of a Set of Points in R2.
Stephane Durocher and David Kirkpatrick.
In proceedings of the Seventeenth Canadian Conference on Computational Geometry (CCCG 2005).
17:46-50. 2005. (postscript) (pdf)
The Gaussian Centre and the Projection Centre of a Set Points in R3.
Stephane Durocher and David Kirkpatrick.
In proceedings of the Sixteenth Canadian Conference on Computational Geometry (CCCG 2004).
16:140-144. 2004. (postscript) (pdf)
The Gaussian Centre of a Set of Mobile Points.
Stephane Durocher and David Kirkpatrick.
In proceedings of the Fifteenth Canadian Conference on Computational Geometry (CCCG 2003).
15:123-127. 2003. (postscript) (pdf)
On the Hardness of Turn-Angle-Restricted Rectilinear Cycle Cover Problems.
Stephane Durocher and David Kirkpatrick.
In proceedings of the Fourteenth Canadian Conference on Computational Geometry (CCCG 2002).
14:13-16. 2002. (postscript) (pdf)
Volumes Edited
Proceedings of the 22nd Canadian Conference on Computational Geometry.
Stephane Durocher and Jason Morrison, editors.
(CCCG 2010)
2010. (pdf)
Theses
Geometric Facility Location under Continuous Motion.
Stephane Durocher.
Ph.D. thesis. University of British Columbia.
2006. (postscript) (pdf)
Graph-Theoretic and Geometric Algorithms Associated with Moment-Based Polygon Reconstruction.
Stephane Durocher.
M.Sc. thesis. University of British Columbia.
1999. (postscript) (pdf)
Preprints
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query.
Stephane Durocher.
arXiv:1109.4460v1 [cs.DS].
13 pages. 2011. (pdf)
Other contributions
Reconstructing Polygons from Scanner Data.
Therese Biedl, Stephane Durocher, and Jack Snoeyink.
In abstracts of the Eighteenth Annual Fall Workshop on Computational Geometry (FWCG 2008).
18:51-52. 2008. (pdf)
Bounded-velocity Approximations of the Mobile Euclidean 2-centre.
Stephane Durocher and David Kirkpatrick.
In abstracts of the Fifteenth Annual Fall Workshop on Computational Geometry and Visualization (FWCG 2005).
15:48-50. 2005. (postscript) (pdf)
Mobile Facility Location.
Stephane Durocher and David Kirkpatrick.
Poster presented at the MITACS Sixth Annual Conference.
Winner of best poster award. 2005.
Restricted 2-Factor Problems Arising from Moment-Based Polygon Reconstruction.
Stephane Durocher and David Kirkpatrick.
In abstracts of the PIMS Workshop on Computational Graph Theory and Combinatorics.
55-57. 1999. (postscript) (pdf)