Stéphane Durocher

1.2k total citations
67 papers, 380 citations indexed

About

Stéphane Durocher is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Computer Networks and Communications. According to data from OpenAlex, Stéphane Durocher has authored 67 papers receiving a total of 380 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computer Graphics and Computer-Aided Design, 22 papers in Computer Vision and Pattern Recognition and 17 papers in Computer Networks and Communications. Recurrent topics in Stéphane Durocher's work include Computational Geometry and Mesh Generation (38 papers), Advanced Graph Theory Research (9 papers) and Digital Image Processing Techniques (8 papers). Stéphane Durocher is often cited by papers focused on Computational Geometry and Mesh Generation (38 papers), Advanced Graph Theory Research (9 papers) and Digital Image Processing Techniques (8 papers). Stéphane Durocher collaborates with scholars based in Canada, United States and France. Stéphane Durocher's co-authors include David Kirkpatrick, Debajyoti Mondal, Hadi Hemmati, Lata Narayanan, Alex Brodsky, Prosenjit Bose, Debbie M. Kelly, Yang Wang, Robert Fraser and Danny Kriz̧anc and has published in prestigious journals such as IEEE/ACM Transactions on Networking, Biology Letters and Theoretical Computer Science.

In The Last Decade

Stéphane Durocher

61 papers receiving 368 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Stéphane Durocher Canada 11 108 95 85 61 57 67 380
Karsten Weihe Germany 10 108 1.0× 66 0.7× 62 0.7× 58 1.0× 92 1.6× 53 381
Petr Slavı́k United States 8 141 1.3× 71 0.7× 73 0.9× 72 1.2× 139 2.4× 9 372
Antonios Symvonis Greece 11 95 0.9× 166 1.7× 184 2.2× 43 0.7× 84 1.5× 58 431
Henry Selvaraj United States 10 120 1.1× 15 0.2× 49 0.6× 54 0.9× 69 1.2× 53 372
Kevin Wampler United States 14 79 0.7× 40 0.4× 445 5.2× 145 2.4× 16 0.3× 22 687
Neng Hou China 9 58 0.5× 9 0.1× 131 1.5× 112 1.8× 37 0.6× 13 375
Sergei Bespamyatnikh Canada 11 75 0.7× 164 1.7× 85 1.0× 59 1.0× 68 1.2× 29 339
Huowang Chen China 9 99 0.9× 6 0.1× 67 0.8× 164 2.7× 33 0.6× 66 369
Youssef Saab United States 12 94 0.9× 15 0.2× 33 0.4× 78 1.3× 66 1.2× 29 525

Countries citing papers authored by Stéphane Durocher

Since Specialization
Citations

This map shows the geographic impact of Stéphane Durocher's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stéphane Durocher with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stéphane Durocher more than expected).

Fields of papers citing papers by Stéphane Durocher

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stéphane Durocher. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stéphane Durocher. The network helps show where Stéphane Durocher may publish in the future.

Co-authorship network of co-authors of Stéphane Durocher

This figure shows the co-authorship network connecting the top 25 collaborators of Stéphane Durocher. A scholar is included among the top collaborators of Stéphane Durocher based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stéphane Durocher. Stéphane Durocher is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Durocher, Stéphane, et al.. (2019). Polygon simplification by minimizing convex corners. Theoretical Computer Science. 791. 76–86. 2 indexed citations
2.
Durocher, Stéphane, et al.. (2018). On Combinatorial Depth Measures. International Journal of Computational Geometry & Applications. 28(4). 381–398.
3.
Durocher, Stéphane, et al.. (2017). Guarding orthogonal art galleries with sliding cameras. Computational Geometry. 65. 12–26. 2 indexed citations
4.
Durocher, Stéphane, et al.. (2016). Thickness and colorability of geometric graphs. Computational Geometry. 56. 1–18.
5.
Durocher, Stéphane, et al.. (2015). Guarding Orthogonal Terrains.. Canadian Conference on Computational Geometry. 3 indexed citations
6.
Durocher, Stéphane & Robert Fraser. (2015). Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks. Canadian Conference on Computational Geometry. 3 indexed citations
7.
Durocher, Stéphane, Debajyoti Mondal, & Md. Saidur Rahman. (2015). On graphs that are not PCGs. Theoretical Computer Science. 571. 78–87. 10 indexed citations
8.
Durocher, Stéphane, et al.. (2014). Low Space Data Structures for Geometric Range Mode Query.. Canadian Conference on Computational Geometry. 1 indexed citations
9.
Durocher, Stéphane, et al.. (2014). On Combinatorial Depth Measures.. Canadian Conference on Computational Geometry. 2 indexed citations
10.
Barba, Luis, Stéphane Durocher, Robert Fraser, et al.. (2013). On k-enclosing objects in a coloured point set. RECERCAT (Consorci de Serveis Universitaris de Catalunya). 229–234. 3 indexed citations
11.
Mondal, Debajyoti, Yang Wang, & Stéphane Durocher. (2013). Robust Solvers for Square Jigsaw Puzzles. 249–256. 15 indexed citations
12.
Durocher, Stéphane, et al.. (2012). The Cover Contact Graph of Discs Touching a Line.. Canadian Conference on Computational Geometry. 59–64.
13.
Biedl, Thérèse, et al.. (2012). Faster optimal algorithms for segment minimization with small maximal value. Discrete Applied Mathematics. 161(3). 317–329. 2 indexed citations
14.
Durocher, Stéphane, et al.. (2010). Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs. Computational Geometry. 44(5). 286–302. 7 indexed citations
15.
Durocher, Stéphane, Chris Gray, & James King. (2006). Minimizing the Number of Arcs Linking a Permutation of Points in the Plane. Canadian Conference on Computational Geometry.
16.
Durocher, Stéphane & David Kirkpatrick. (2005). The Projection Median of a Set of Points in R 2 .. Canadian Conference on Computational Geometry. 47–51. 5 indexed citations
17.
Durocher, Stéphane & David Kirkpatrick. (2004). The gaussian centre and the projection centre of a set of points in r 3 .. Canadian Conference on Computational Geometry. 140–144. 1 indexed citations
18.
Durocher, Stéphane & David Kirkpatrick. (2003). The Gaussian Centre of a Set of Mobile Points. Canadian Conference on Computational Geometry. 123–127. 1 indexed citations
19.
Brodsky, Alex, et al.. (2003). Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. Discrete Mathematics. 262(1-3). 59–77. 10 indexed citations
20.
Durocher, Stéphane & David Kirkpatrick. (2002). On the hardness of turn-angle-restricted rectilinear cycle cover problems.. Canadian Conference on Computational Geometry. 13–16. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026