Geometric, Approximation & Distributed Algorithms
A Computer Science Theory Lab at the University of Manitoba


Welcome to the GADA lab at the University of Manitoba! We study algorithms and the complexity of problems from a wide variety of research domains, such as computational geometry, approximation algorithms, online algorithms, and distributed algorithms. The common theme to all of our activities is the rich interplay between interesting problems from Computer Science and the techniques and rigour of Mathematics. Our weekly meetings alternate between problem-solving sessions and research talks, and anyone can join us! Explore this page to find out more.

Recent News

  • Undergraduate Research Awards

    Congratulations to Ishan Chopra, Tim Zapp, Kenny Zhang, and Joe Vermander on receiving Undergraduate Research Awards!

  • Kelly Ramsay, M.Sc.

    Congratulations to Kelly Ramsay on her successful M.Sc. thesis defense!

  • Feb. 28, 2018: Talk by Nima Sheibani

    Details forthcoming.

  • Feb. 8, 2018: Talk by Kelly Ramsay

    Details forthcoming.

  • Jan. 25, 2018: Talk by Dr. Stephane Durocher

    Stephane will provide an overview of two results on local routing that originally appeared at PODC and ICDCN. This talk will focus on the non-geometric case, including negative results, lower bounds, and algorithms that match the lower bounds.


Stephane Durocher

Associate Professor
Home page

Avery Miller

Assistant Professor
Home page

Shahin Kamali

Assistant Professor
Home page



Ishan Chopra
Ivan Chernavtcev
Nima Sheibani
Sameer Naib
Sean Egan
Timothy Zapp
Ullash Saha
Yeganeh Bahoo
Yongzhen Ren

Debajyoti Mondal
Derek Cormier
Garrett Suss
Joe Vermander
Joshua Hernandez
Kelly Ramsay
Kenny Zhang
Kyle Joseph
Lyndon Miller
Matthew Skala
Mohammad Abdul Wahid
Robby Singh
Robert Fraser
Saeed Mehrabi
Sahar Mehrpour
Tristan Ratchford


Click on a project for more information

Recent Publications (2018/2019)

Click here for all publications

Title Authors Venue Links
Approximation Algorithms for Graph BurningAnthony Bonato
Shahin Kamali
TAMCPublication Link
Approximation Algorithms for Graph BurningAnthony Bonato
Shahin Kamali
CoRRPublication Link
Compact Representation of Graphs of Small Clique-WidthShahin Kamali
AlgorithmicaPublication Link
Drawing plane triangulations with few segmentsStephane Durocher
Debajyoti Mondal
Comput. Geom.Publication Link
Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio NetworksAvery Miller
ALGOSENSORSPublication Link
Online Bin Packing with Advice of Small SizeSpyros Angelopoulos
Christoph Dürr
Shahin Kamali
Marc P. Renault
Adi Rosén
Theory Comput. Syst.Publication Link
Polygon Simplification by Minimizing Convex CornersYeganeh Bahoo
Stephane Durocher
J. Mark Keil
Saeed Mehrabi
Sahar Mehrpour
Debajyoti Mondal
CoRRPublication Link
Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, CanadaPublication Link
Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, CanadaPublication Link
Relating Graph Thickness to Planar Layers and Bend ComplexityStephane Durocher
Debajyoti Mondal
SIAM J. Discrete Math.Publication Link
SIROCCO 2018 ReviewAvery Miller
SIGACT NewsPublication Link
With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for RoutingAvery Miller
Boaz Patt-Shamir
Will Rosenbaum
CoRRPublication Link

Join The Lab


If you are currently a student or faculty member at the University of Manitoba, send an e-mail to one of our lab's faculty members to find out how to join our mailing list and attend our lab meetings.

We have funding available to provide financial support for highly motivated and qualified graduate students interested in pursuing a M.Sc. or Ph.D. degree. We also welcome visitors that wish to participate in our lab's research projects. If you are interested in the above opportunities, send an e-mail to one of our lab's faculty members, and include the following:

  • Confirmation that you have read this web page
  • A brief description of topics or specific research problems in theoretical computer science that interest you (these could be, but need not be restricted to, topics related to our lab's current research)
  • An overview of any research experience you have (e.g., a research internship, a course project related to your research interests, your undergraduate thesis, or graduate courses taken)
  • Your curriculum vitae, including degrees obtained and their corresponding institutions, and a list of any academic awards, scholarships, or bursaries received
  • Your grade point average and, if available, an electronic (or scanned) copy of your transcripts
  • A list of senior courses you took in theoretical computer science and mathematics
  • A list of your publications (if any)
  • Contact information for at least two references (email and telephone)