Stephane Durocher
Orcid: 0000-0002-6589-3538Affiliations:
- University of Manitoba, Winnipeg, Manitoba, Canada
According to our database1,
Stephane Durocher
authored at least 119 papers
between 2000 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Approximation algorithms for minimum ply covering of points with unit squares and unit disks.
Theor. Comput. Sci., 2025
2024
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024
2023
Int. J. Comput. Geom. Appl., 2023
Proceedings of the WALCOM: Algorithms and Computation, 2023
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Online Square Packing with Predictions.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
Minimum Ply Covering of Points with Unit Disks.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
CCOSKEG Discs in Simple Polygons.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
2022
Curve Stabbing Depth: Data Depth for Plane Curves.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
Computing Batched Depth Queries and the Depth of a Set of Points.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
Proceedings of the International Conference on 3D Vision, 2022
2021
2020
Theory Comput. Syst., 2020
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020
Proceedings of the IEEE Intl Conf on Dependable, 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
Non-Crossing Matching of Online Points.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
Theor. Comput. Sci., 2019
A time-space trade-off for computing the <i>k</i>-visibility region of a point in a polygon.
Theor. Comput. Sci., 2019
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019
Watchtower for k-crossing Visibility.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019
2018
SIAM J. Discret. Math., 2018
2017
Theor. Comput. Sci., 2017
J. Discrete Algorithms, 2017
Int. J. Comput. Geom. Appl., 2017
Time-Space Trade-Off for Finding the <i>k</i>-Visibility Region of a Point in a Polygon.
Proceedings of the WALCOM: Algorithms and Computation, 2017
Interference Minimization in k-Connected Wireless Networks.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
Exploring Increasing-Chord Paths and Trees.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
2016
CoRR, 2016
Algorithmica, 2016
On the Biplanar Crossing Number of K<sub>n</sub>.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2015
IEEE/ACM Trans. Netw., 2015
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
Exploring Test Suite Diversification and Code Coverage in Multi-Objective Test Case Selection.
Proceedings of the 8th IEEE International Conference on Software Testing, 2015
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2014
Theory Comput. Syst., 2014
A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014
Proceedings of the Graph Drawing - 22nd International Symposium, 2014
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Int. J. Comput. Geom. Appl., 2013
Discret. Appl. Math., 2013
CoRR, 2013
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.
CoRR, 2013
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013
Proceedings of the String Processing and Information Retrieval, 2013
Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013
Proceedings of the Graph Drawing - 21st International Symposium, 2013
Proceedings of the Algorithms - ESA 2013, 2013
Proceedings of the Tenth Conference on Computer and Robot Vision, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
Proceedings of the Space-Efficient Data Structures, 2013
2012
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012
Proceedings of the Structural Information and Communication Complexity, 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
Proceedings of the Combinatorial Optimization and Applications, 2012
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
2011
A note on improving the performance of approximation algorithms for radiation therapy.
Inf. Process. Lett., 2011
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs.
Comput. Geom., 2011
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011
Proceedings of the Graph Drawing - 19th International Symposium, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Wirel. Networks, 2010
Discret. Math. Algorithms Appl., 2010
2009
J. Interconnect. Networks, 2009
CoRR, 2009
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Int. J. Comput. Geom. Appl., 2008
Proceedings of the String Processing and Information Retrieval, 2008
2006
The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location.
Int. J. Comput. Geom. Appl., 2006
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
2005
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
2004
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
Toward the rectilinear crossing number of <i>K<sub>n</sub></i>: new drawings, upper bounds, and asymptotics.
Discret. Math., 2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
2002
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
2001
2000
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics
CoRR, 2000