Stephane Durocher

Research interests

My research is in computational geometry, data structures, geometric optimization and discrete algorithms. My recent work includes theoretical results in geometric covering, local geometric routing, range searching, polygon reconstruction, graph drawing, online algorithms, geometric models for wireless communication, kinetic data structures, geometric depth measures and facility location.

I am also interested in graph theory, computational complexity, combinatorial algorithms, combinatorial geometry and discrete mathematics. See my research projects, my publications or the lab for more information.

I have funding available for graduate students interested in pursuing an MSc or PhD on a thesis topic related to my research expertise.

I have served on program committees for LATIN 2010, CCCG 2010 (conference co-chair), CCCG 2011, WALCOM 2012, COCOA 2012, CCCG 2015, ALGOSENSORS 2015, CCCG 2016, WADS 2017, GD 2017, SoCG YRF 2017, CCCG 2018 (conference co-chair), and WALCOM 2019, and as a guest editor for the journal Computational Geometry: Theory and Applications.

Courses taught

• Winter 2019: Analysis of Algorithms (COMP 2080)
• Fall 2018: Computational Geometry (COMP 7922)
• Winter 2018: Analysis of Algorithms (COMP 2080)
• Fall 2017: Data Structures and Algorithms (COMP 2140)
• Winter 2017: Advanced Design and Analysis of Algorithms (COMP 4420)
• Fall 2016: Graph Drawing (COMP 7750)
• Winter 2016: Analysis of Algorithms and Data Structures (COMP 3170)
• Fall 2015: Computational Geometry (COMP 7750)
• Fall 2014: Data Structures and Algorithms (COMP 2140)
• Fall 2014: Graph Drawing (COMP 7750/4060)