Stephane Durocher

According to our database1, Stephane Durocher authored at least 84 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Drawing plane triangulations with few segments.
Comput. Geom., 2019

2017
Computing conforming partitions of orthogonal polygons with minimum stabbing number.
Theor. Comput. Sci., 2017

The projection median as a weighted average.
JoCG, 2017

Guarding orthogonal art galleries with sliding cameras.
Comput. Geom., 2017

Time-Space Trade-Off for Finding the k-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
Routing in Geometric Networks.
Encyclopedia of Algorithms, 2016

Relating Graph Thickness to Planar Layers and Bend Complexity.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Polygon Simplification by Minimizing Convex Corners.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On the Biplanar Crossing Number of Kn.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position.
IEEE/ACM Trans. Netw., 2015

Searching on a line: A complete characterization of the optimal solution.
Theor. Comput. Sci., 2015

Plane 3-Trees: Embeddability and Approximation.
SIAM J. Discrete Math., 2015

Cycle-maximal triangle-free graphs.
Discrete Mathematics, 2015

Local Routing in Convex Subdivisions.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 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

Drawing Graphs Using Body Gestures.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Guarding Orthogonal Terrains.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
The Hausdorff Core Problem on Simple Polygons.
JoCG, 2014

Competitive Online Routing on Delaunay Triangulations.
Proceedings of the Algorithm Theory - SWAT 2014, 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

Drawing HV-Restricted Planar Graphs.
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

Drawing Planar Graphs with Reduced Height.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Trade-Offs in Planar Polyline Drawings.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Indexed Geometric Jumbled Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Guarding Monotone Art Galleries with Sliding Cameras in Linear Time.
Proceedings of the Combinatorial Optimization and Applications, 2014

Drawing Plane Triangulations with Few Segments, pp. 40-45.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

On Combinatorial Depth Measures.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Low Space Data Structures for Geometric Range Mode Query.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Robust nonparametric Simplification of Polygonal Chains.
Int. J. Comput. Geometry Appl., 2013

Foreword.
Comput. Geom., 2013

Thickness and Colorability of Geometric Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Graphs That Are Not PCGs.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Plane 3-trees: Embeddability and Approximation - (Extended Abstract).
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Top-k Color Queries on Tree Paths.
Proceedings of the String Processing and Information Retrieval, 2013

Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

On Balanced ✛-Contact Representations.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Revisiting the Problem of Searching on a Line.
Proceedings of the Algorithms - ESA 2013, 2013

Robust Solvers for Square Jigsaw Puzzles.
Proceedings of the Tenth Conference on Computer and Robot Vision, 2013

Complexity of Barrier Coverage with Relocatable Sensors in the Plane.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

On k-Enclosing Objects in a Coloured Point Set.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Cool-lex order and k-ary Catalan structures.
J. Discrete Algorithms, 2012

On the Hardness of Point-Set Embeddability - (Extended Abstract).
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Linear-Space Data Structures for Range Minority Query in Arrays.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Linear-Space Data Structures for Range Mode Query in Arrays.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position.
Proceedings of the Structural Information and Communication Complexity, 2012

Robust Nonparametric Data Approximation of Point Sets via Data Reduction.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Hamiltonian Paths and Cycles in Planar Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2012

The Cover Contact Graph of Discs Touching a Line.
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

Faster Optimal Algorithms for Segment Minimization with Small Maximal Value.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Range Majority in Constant Time and Linear Space.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Embedding Plane 3-Trees in ℝ2 and ℝ3.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

A Note on Minimum-Segment Drawings of Planar Graphs.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Realizing Site Permutations.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
An Improved Line-Separable Algorithm for Discrete Unit Disk Cover.
Discrete Math., Alg. and Appl., 2010

2009
The projection median of a set of points.
Comput. Geom., 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

Bounding the locality of distributed routing algorithms.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Reconstructing Polygons from Scanner Data.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Untangled Monotonic Chains and Adaptive Range Search.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Bounded-Velocity Approximation of Mobile Euclidean 2-Centres.
Int. J. Comput. Geometry Appl., 2008

Balancing Traffic Load Using One-Turn Rectilinear Routing.
Proceedings of the Theory and Applications of Models of Computation, 2008

On the Structure of Small Motif Recognition Instances.
Proceedings of the String Processing and Information Retrieval, 2008

On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007
Kinetic Maintenance of Mobile k-Centres on Trees.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
The Steiner Centre of a Set of Points: Stability, Eccentricity, and Applications to Mobile Facility Location.
Int. J. Comput. Geometry Appl., 2006

Minimizing the Number of Arcs Linking a Permutation of Points in the Plane.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
The Projection Median of a Set of Points in R2.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
The gaussian centre and the projection centre of a set of points in r3.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics.
Discrete Mathematics, 2003

The Gaussian Centre of a Set of Mobile Points.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
On the hardness of turn-angle-restricted rectilinear cycle cover problems.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
The Rectilinear Crossing Number of K10 is 62.
Electr. J. Comb., 2001


  Loading...