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, an NSERC Engage Grant with Cogmation Robotics, three grants from 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. A list of my current and past students can be found here.

Articles published or accepted for publication in peer-reviewed journals
Drawing Planar Graphs with Reduced Height.
Stephane Durocher and Debajyoti Mondal.
Journal of Graph Algorithms and Applications.
21(4):433-453. 2017. (pdf) (doi)
Thickness and Colorability of Geometric Graphs.
Stephane Durocher, Ellen Gethner, and Debajyoti Mondal.
Computational Geometry: Theory and Applications.
56:1-18. 2016. (pdf) (doi)
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.
Stephane Durocher, Rahul Shah, Matthew Skala, and Sharma Thankachan.
Algorithmica.
74(1):344-366. 2016. (pdf) (doi)
Low Space Data Structures for Geometric Range Mode Query.
Stephane Durocher, Ian Munro, Hicham El-Zein, and Sharma Thankachan.
Theoretical Computer Science.
581:97-101. 2015. (pdf) (doi)
Complexity of Barrier Coverage with Relocatable Sensors in the Plane.
Stefan Dobrev, Stephane Durocher, Konstantinos Georgiou, Mohsen Eftekhari Hesari, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jarda Opatrny, Sunil Shende, and Jorge Urrutia.
Theoretical Computer Science.
579:64-73. 2015. (pdf) (doi)
Searching on a Line: A Complete Characterization of the Optimal Solution.
Prosenjit Bose, Jean-Lou de Carufel, and Stephane Durocher.
Theoretical Computer Science.
569:24-42. 2015. (pdf) (doi) (arXiv:1310.1048)
On Graphs That Are Not PCGs.
Stephane Durocher, Debajyoti Mondal, and Md. Saidur Rahman.
Theoretical Computer Science.
571:78-87. 2015. (pdf) (doi)
Plane 3-trees: Embeddability and Approximation.
Stephane Durocher and Debajyoti Mondal.
SIAM Journal on Discrete Mathematics.
29(1):405-420. 2015. (pdf) (doi)
Cycle-Maximal Triangle-Free Graphs.
Stephane Durocher, David Gunderson, Ben Li, and Matthew Skala.
Discrete Mathematics.
338(2):274-290. 2015. (pdf) (doi) (arXiv:1310.5172)
Linear-Space Data Structures for Range Minority Query in Arrays.
Timothy M. Chan, Stephane Durocher, Matthew Skala, and Bryan T. Wilkinson.
Algorithmica.
72(4):901-913. 2015. (pdf) (doi)
Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position.
Majid Khabbazian, Stephane Durocher, Alireza Haghnegahdar, and Fabian Kuhn.
IEEE/ACM Transactions on Networking.
23(4):1078-1091. 2015. (pdf) (doi) (arXiv:1111.6689)
The Hausdorff Core Problem on Simple Polygons.
Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, Ian Munro, Alejandro Salinger, and Matthew Skala.
Journal of Computational Geometry.
5(1):14-40. 2014. (pdf) (link)
Linear-Space Data Structures for Range Mode Query in Arrays.
Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, and Bryan T. Wilkinson.
Theory of Computing Systems, special issue of invited papers selected from the Twenty-Ninth Symposium on Theoretical Aspects of Computer Science (STACS 2012).
55(4):719-741. 2014. (pdf) (doi)
Robust Nonparametric Simplification of Polygonal Chains.
Stephane Durocher, Alexandre Leblanc, Jason Morrison, and Matthew Skala.
International Journal of Computational Geometry and Applications, special issue of invited papers selected from the Twenty-Third International Symposium on Algorithms and Computation (ISAAC 2012).
23(6):427-441. 2013. (pdf) (doi) (arXiv:1205.6717)
A Note on Minimum-Segment Drawings of Planar Graphs.
Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, and Sue Whitesides.
Journal of Graph Algorithms and Applications.
17(3):301-328. 2013. (pdf) (doi)
Bounding the Locality of Distributed Routing Algorithms.
Prosenjit Bose, Paz Carmi, and Stephane Durocher.
Distributed Computing.
26(1):39-58. 2013. (pdf) (doi)
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value.
Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, and Maxwell Young.
Discrete Applied Mathematics.
161(3):317-329. 2013. (pdf) (doi)
Range Majority in Constant Time and Linear Space.
Stephane Durocher, Meng He, Ian Munro, Patrick Nicholson, and Matthew Skala.
Information and Computation, special issue of invited papers selected from the Thirty-Eighth International Colloquium on Automata, Languages and Programming (ICALP 2011).
222:169-179. 2013. (pdf) (doi)
Cool-lex Order and k-ary Catalan Structures.
Stephane Durocher, Ben Li, Debajyoti Mondal, Frank Ruskey, and Aaron Williams.
Journal of Discrete Algorithms, special issue of invited papers selected from the Twenty-Second International Workshop on Combinatorial Algorithms (IWOCA 2011).
16:287-307. 2012. (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.
Theoretical Computer Science, special issue of invited papers selected from the Twentieth International Symposium on Algorithms and Computation (ISAAC 2009).
412(32):4200-4211. 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) (arXiv:0905.4930)
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, special issue of invited papers selected from the Twentieth International Symposium on Algorithms and Computation (ISAAC 2009).
412(32):4161-4172. 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, special issue of invited papers selected from the Twentieth International Symposium on Algorithms and Computation (ISAAC 2009).
2(1):77-87. 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, special issue of invited papers selected from the Seventeenth Canadian Conference on Computational Geometry (CCCG 2005).
42(5):364-375. 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) (arXiv:cs/0009028)
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) (arXiv:cs/0009023)
Articles published or accepted for publication in peer-reviewed conference proceedings
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon.
Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer.
To appear in proceedings of the Eleventh Workshop on Algorithms and Computation (WALCOM 2017).
Springer Lecture Notes in Computer Science. 10167:16 pages. 2017.
Relating Graph Thickness to Planar Layers and Bend Complexity.
Stephane Durocher and Debajyoti Mondal.
In proceedings of the Forty-Third International Colloquium on Automata, Languages and Programming (ICALP 2016).
Leibniz International Proceedings in Informatics. 10.1-10.13. 2016. (pdf) (arXiv:1602.07816) (doi)
On the Biplanar Crossing Number of Kn.
Stephane Durocher, Ellen Gethner, and Debajyoti Mondal.
In proceedings of the Twenty-Eighth Canadian Conference on Computational Geometry (CCCG 2016).
93-100. 2016. (pdf)
Polygon Simplification by Minimizing Convex Corners.
Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, and Debajyoti Mondal.
In proceedings of the Twenty-Second International Computing and Combinatorics Conference (COCOON 2016).
Springer Lecture Notes in Computer Science. 9797:547-559. 2016. (pdf) (doi)
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.
Clinton Bowen, Stephane Durocher, Maarten Löffler, Anika Rounds, André Schulz, and Csaba Tóth.
In proceedings of the Twenty-Third International Symposium on Graph Drawing and Network Visualization (GD 2015).
Springer Lecture Notes in Computer Science. 9411:447-459. 2015. (pdf) (doi)
Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks.
Stephane Durocher and Robert Fraser.
In proceedings of the Twenty-Seventh Canadian Conference on Computational Geometry (CCCG 2015).
8-16. 2015. (pdf)
Guarding Orthogonal Terrains.
Stephane Durocher, Ben Li, and Saeed Mehrabi.
In proceedings of the Twenty-Seventh Canadian Conference on Computational Geometry (CCCG 2015).
220-227. 2015. (pdf)
Exploring Test Suite Diversification and Code Coverage in Multi-Objective Test Case Selection.
Debajyoti Mondal, Hadi Hemmati, and Stephane Durocher.
In proceedings of the Eighth IEEE International Conference on Software Testing, Verification and Validation (ICST 2015).
1-10. 2015. (pdf) (doi)
Local Routing in Convex Subdivisions.
Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, and Mohammad Abdul Wahid.
In proceedings of the Forty-First International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015).
Springer Lecture Notes in Computer Science. 8939:140-151. 2015. (pdf) (doi)
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time.
Mark de Berg, Stephane Durocher, Saeed Mehrabi.
In proceedings of the Eighth International Conference on Combinatorial Optimization and Applications (COCOA 2014).
Springer Lecture Notes in Computer Science. 8881:113-125. 2014. (pdf) (doi)
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
Stephane Durocher and Saeed Mehrabi.
In proceedings of the Twenty-Fifth International Workshop on Combinatorial Algorithms (IWOCA 2014).
Springer Lecture Notes in Computer Science. 8986:140-152. 2014. (pdf) (doi)
Competitive Online Routing on Delaunay Triangulations.
Prosenjit Bose, Jean-Lou de Carufel, Stephane Durocher, and Perouz Taslakian.
In proceedings of the Fourteenth Scandanavian Symposium and Workshops on Algorithm Theory (SWAT 2014).
Springer Lecture Notes in Computer Science. 8503:98-109. 2014. (pdf) (doi)
Indexed Geometric Jumbled Pattern Matching.
Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, and Sharma Thankachan.
In proceedings of the Twenty-Fifth Annual Symposium on Combinatorial Pattern Matching (CPM 2014).
Springer Lecture Notes in Computer Science. 8486:110-119. 2014. (pdf) (doi)
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
Stephane Durocher, Omrit Filtser, Robert Fraser, Ali Mehrabi, and Saeed Mehrabi.
In proceedings of the Eleventh International Latin American Symposium on Theoretical Informatics (LATIN 2014).
Springer Lecture Notes in Computer Science. 8392:294-305. 2014. (pdf) (doi) (arXiv:1308.2757)
Drawing HV-Restricted Planar Graphs.
Stephane Durocher, Stefan Felsner, Saeed Mehrabi, and Debajyoti Mondal.
In proceedings of the Eleventh International Latin American Symposium on Theoretical Informatics (LATIN 2014).
Springer Lecture Notes in Computer Science. 8392:156-167. 2014. (pdf) (doi)
Drawing Planar Graphs with Reduced Height.
Stephane Durocher and Debajyoti Mondal.
In proceedings of the Twenty-Second International Symposium on Graph Drawing (GD 2014).
Springer Lecture Notes in Computer Science. 8871:392-403. 2014. (pdf) (doi)
Trade-offs in Planar Polyline Drawings.
Stephane Durocher and Debajyoti Mondal.
In proceedings of the Twenty-Second International Symposium on Graph Drawing (GD 2014).
Springer Lecture Notes in Computer Science. 8871:306-318. 2014. (pdf) (doi)
On Combinatorial Depth Measures.
Stephane Durocher, Robert Fraser, Alexandre Leblanc, Jason Morrison, and Matthew Skala.
In proceedings of the Twenty-Sixth Canadian Conference on Computational Geometry (CCCG 2014).
206-211. 2014. (pdf)
Drawing Plane Triangulations with Few Segments.
Stephane Durocher and Debajyoti Mondal.
In proceedings of the Twenty-Sixth Canadian Conference on Computational Geometry (CCCG 2014).
40-45. 2014. (pdf)
Low Space Data Structures for Geometric Range Mode Query.
Stephane Durocher, Ian Munro, Hicham El-Zein, and Sharma Thankachan.
In proceedings of the Twenty-Sixth Canadian Conference on Computational Geometry (CCCG 2014).
212-215. 2014. (pdf)
On Balanced +-Contact Representations.
Stephane Durocher and Debajyoti Mondal.
In proceedings of the Twenty-First International Symposium on Graph Drawing (GD 2013).
Springer Lecture Notes in Computer Science. 8242:143-154. 2013. (pdf) (doi)
Top-k Color Queries on Tree Paths.
Stephane Durocher, Rahul Shah, Matthew Skala, and Sharma Thankachan.
In proceedings of the Twentieth String Processing and Information Retrieval Symposium (SPIRE 2013).
Springer Lecture Notes in Computer Science. 8214:109-115. 2013. (pdf) (doi)
Revisiting the Problem of Searching on a Line.
Prosenjit Bose, Jean-Lou de Carufel, and Stephane Durocher.
In proceedings of the Twenty-First European Symposium on Algorithms (ESA 2013).
Springer Lecture Notes in Computer Science. 8125:205-216. 2013. (pdf) (doi) (arXiv:1310.1048)
Plane 3-trees: Embeddability and Approximation.
Stephane Durocher and Debajyoti Mondal.
In proceedings of the Thirteenth Algorithms and Data Structures Symposium (WADS 2013).
Springer Lecture Notes in Computer Science. 8037:291-303. 2013. (pdf) (doi)
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.
Stephane Durocher, Rahul Shah, Matthew Skala, and Sharma Thankachan.
In proceedings of the Thirty-Eighth International Symposium on Mathematical Foundations of Computer Science (MFCS 2013).
Springer Lecture Notes in Computer Science. 8087:325-336. 2013. (pdf) (doi)
Guarding Orthogonal Art Galleries using Sliding Cameras: Algorithmic and Hardness Results.
Stephane Durocher and Saeed Mehrabi.
In proceedings of the Thirty-Eighth International Symposium on Mathematical Foundations of Computer Science (MFCS 2013).
Springer Lecture Notes in Computer Science. 8087:314-324. 2013. (pdf) (doi) (arXiv:1303.2162v1)
Thickness and Colorability of Geometric Graphs.
Stephane Durocher, Ellen Gethner, and Debajyoti Mondal.
In proceedings of the Thirty-ninth International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013).
Springer Lecture Notes in Computer Science. 8165:237-248. 2013. (pdf) (doi)
On k-Enclosing Objects in a Coloured Point Set.
Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, and Mohammad Abdul Wahid.
In proceedings of the Twenty-Fifth Canadian Conference on Computational Geometry (CCCG 2013).
25:229-234. 2013. (pdf)
Robust Solvers for Square Jigsaw Puzzles.
Debajyoti Mondal, Yang Wang, and Stephane Durocher.
In proceedings of the Tenth Canadian Conference on Computer and Robot Vision (CRV 2013).
249-256. 2013. (pdf) (doi)
Complexity of Barrier Coverage with Relocatable Sensors in the Plane.
Stefan Dobrev, Stephane Durocher, Konstantinos Georgiou, Mohsen Eftekhari Hesari, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jarda Opatrny, Sunil Shende, and Jorge Urrutia.
In proceedings of the Eighth International Conference on Algorithms and Complexity (CIAC 2013).
Springer Lecture Notes in Computer Science. 7878:170-182. 2013. (pdf) (doi)
On Graphs That Are Not PCGs.
Stephane Durocher, Debajyoti Mondal, and Md. Saidur Rahman.
In proceedings of the Seventh Workshop on Algorithms and Computation (WALCOM 2013).
Springer Lecture Notes in Computer Science. 7748:310-321. 2013. (pdf) (doi)
Linear-Space Data Structures for Range Minority Query in Arrays.
Timothy M. Chan, Stephane Durocher, Matthew Skala, and Bryan T. Wilkinson.
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) (doi)
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)
Robust Nonparametric Data Approximation of Point Sets via Data Reduction.
Stephane Durocher, Alexandre Leblanc, Jason Morrison, and Matthew Skala.
In proceedings of the Twenty-Third International Symposium on Algorithms and Computation (ISAAC 2012).
Springer Lecture Notes in Computer Science. 7676:319-331. 2012. (pdf) (doi) (arXiv:1205.6717)
Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position.
Majid Khabbazian, Stephane Durocher, and Alireza Haghnegahdar.
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) (doi) (arXiv:1111.6689)
Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number.
Stephane Durocher and Saeed Mehrabi.
In proceedings of the Eighteenth International Computing and Combinatorics Conference (COCOON 2012).
Springer Lecture Notes in Computer Science. 7434:228-239. 2012. (pdf) (doi) (ERRATUM)
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.
In proceedings of the Sixth International Conference on Combinatorial Optimization and Applications (COCOA 2012).
Springer Lecture Notes in Computer Science. 7402:83-94. 2012. (pdf) (doi)
The Cover Contact Graph of Discs Touching a Line.
Stephane Durocher, Saeed Mehrabi, Matthew Skala, and Mohammad Abdul Wahid.
In proceedings of the Twenty-Fourth Canadian Conference on Computational Geometry (CCCG 2012).
24:67-72. 2012. (pdf)
Portrait Drawing Robot with a Geometric Graph Approach: Furthest Neighbour Theta-Graphs.
Meng Cheng Lau, Jacky Baltes, John Anderson, and Stephane Durocher.
In proceedings of the Eleventh IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2012).
75-79. 2012. (pdf) (doi)
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 Twelfth 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
Special Issue for Selected Articles from the 22nd Canadian Conference on Computational Geometry.
Stephane Durocher and Jason Morrison, editors.
Computational Geometry: Theory and Applications.
46(2):2013. (pdf) (doi)
Proceedings of the 22nd Canadian Conference on Computational Geometry.
Stephane Durocher and Jason Morrison, editors.
(CCCG 2010)
22:2010. (pdf)
Book chapters
Routing in Geometric Networks.
Stephane Durocher, Leszek Gąsieniec, and Prudence W. H. Wong.
Encyclopedia of Algorithms.
Springer. 5 pages. 2015. (pdf) (doi)
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)
Other contributions
Finding the k-Visibility Region of a Point in a Simple Polygon in the Memory-Constrained Model.
Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer.
In abstracts of the Thirty-Third European Workshop on Computational Geometry (EWCG 2016).
191-194. 2016. (pdf)
Drawing Graphs Using Body Gestures.
Yeganeh Bahoo, Andrea Bunt, Stephane Durocher, and Sahar Mehrpour.
Poster abstract in Proceedings of the Twenty-Third International Symposium on Graph Drawing and Network Visualization (GD 2015).
Springer Lecture Notes in Computer Science. 9411:561-562. 2015. (pdf) (doi)
On Geometric Duality for 2-Admissible Geometric Set Cover and Hitting Set Problems.
Stephane Durocher and Robert Fraser.
In abstracts of the Twenty-Third Annual Fall Workshop on Computational Geometry (FWCG 2013).
2 pages. 2013. (pdf)
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query.
Stephane Durocher.
In proceedings of the Conference on Space Efficient Data Structures, Streams and Algorithms (Munro Festschrift 2013).
Springer Lecture Notes in Computer Science. 8066:48-60. 2013. (pdf) (doi) (arXiv:1109.4460)
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. (pdf)
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)