Stephane Durocher
Stephane Durocher
Computer Science, University of Manitoba
Verified email at - Homepage
Cited by
Cited by
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
S Durocher, D Kirkpatrick, L Narayanan
International Conference on Distributed Computing and Networking, 546-557, 2008
Exploring test suite diversification and code coverage in multi-objective test case selection
D Mondal, H Hemmati, S Durocher
2015 IEEE 8th International Conference on Software Testing, Verification and …, 2015
Would you do as a robot commands? An obedience study for human-robot interaction
D Cormier, G Newman, M Nakane, JE Young, S Durocher
International Conference on Human-Agent Interaction 13, 2013
Complexity of barrier coverage with relocatable sensors in the plane
S Dobrev, S Durocher, M Eftekhari, K Georgiou, E Kranakis, D Krizanc, ...
Theoretical Computer Science 579, 64-73, 2015
Linear-space data structures for range mode query in arrays
TM Chan, S Durocher, KG Larsen, J Morrison, BT Wilkinson
Symposium on Theoretical Aspects of Computer Science 14, 290-301, 2012
Toward the Rectilinear Crossing Number of K_n: New Drawings, Upper Bounds, and Asymptotics
A Brodsky, S Durocher, E Gethner
Discrete Mathematics 262 (1-3), 59-77, 2003
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks
S Durocher, D Kirkpatrick, L Narayanan
Wireless Networks 16 (1), 227-235, 2010
An improved line-separable algorithm for discrete unit disk cover
F Claude, GK Das, R Dorrigiv, S Durocher, R Fraser, A López-Ortiz, ...
Discrete Mathematics, Algorithms and Applications 2 (01), 77-87, 2010
The projection median of a set of points
S Durocher, D Kirkpatrick
Computational Geometry 42 (5), 364-375, 2009
The Rectilinear Crossing Number of K_10 is 62
A Brodsky, S Durocher, E Gethner
JOURNAL OF COMBINATORICS 8 (1), R23:1-30, 2001
On graphs that are not PCGs
S Durocher, D Mondal, MS Rahman
Theoretical Computer Science 571, 78-87, 2015
The Steiner centre of a set of points: Stability, eccentricity, and applications to mobile facility location
S Durocher, D Kirkpatrick
International Journal of Computational Geometry and Applications 16 (4), 345-371, 2006
Robust solvers for square jigsaw puzzles
D Mondal, Y Wang, S Durocher
2013 international conference on computer and robot vision, 249-256, 2013
Range majority in constant time and linear space
S Durocher, M He, JI Munro, PK Nicholson, M Skala
Information and Computation 222, 169-179, 2013
Linear-space data structures for range minority query in arrays
TM Chan, S Durocher, M Skala, BT Wilkinson
Scandinavian Workshop on Algorithm Theory, 295-306, 2012
Bounding the locality of distributed routing algorithms
P Bose, P Carmi, S Durocher
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
Revisiting the problem of searching on a line
P Bose, JL De Carufel, S Durocher
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
Guarding orthogonal art galleries using sliding cameras: algorithmic and hardness results
S Durocher, S Mehrabi
Mathematical Foundations of Computer Science 2013: 38th International …, 2013
Searching on a line: A complete characterization of the optimal solution
P Bose, JL De Carufel, S Durocher
Theoretical Computer Science 569, 24-42, 2015
Drawing plane triangulations with few segments
S Durocher, D Mondal
Computational Geometry 77, 27-39, 2019
The system can't perform the operation now. Try again later.
Articles 1–20