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

About

 
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.

Faculty

Stephane Durocher

Associate Professor
Home page

Avery Miller

Assistant Professor
Home page

Shahin Kamali

Assistant Professor
Home page

Members


Current

Ishan Chopra
Ivan Chernavtcev
Joe Vermander
Kenny Zhang
Nima Sheibani
Sameer Naib
Timothy Zapp
Yeganeh Bahoo
Former

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

Projects

Click on a project for more information

Recent Publications (2017/2018)

Click here for all publications

Title Authors Venue Links
Buffer Size for Routing Limited-Rate Adversarial TrafficAvery Miller
Boaz Patt-Shamir
CoRRPublication Link
Compact Representation of Graphs of Small Clique-WidthShahin Kamali
AlgorithmicaPublication Link
Competitive Online Routing on Delaunay TriangulationsProsenjit Bose
Jean-Lou De Carufel
Stephane Durocher
Perouz Taslakian
Int. J. Comput. Geometry Appl.Publication Link
Computing conforming partitions of orthogonal polygons with minimum stabbing numberStephane Durocher
Saeed Mehrabi
Theor. Comput. Sci.Publication Link
Constant-Length Labeling Schemes for Deterministic Radio BroadcastFaith Ellen
Barun Gorain
Avery Miller
Andrzej Pelc
CoRRPublication Link
Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$Avery Miller
Andrzej Pelc
CoRRPublication Link
Deterministic distributed construction of T-dominating sets in time TAvery Miller
Andrzej Pelc
Discrete Applied MathematicsPublication Link
Distributed Service Function ChainingReaz Ahmed
Raouf Boutaba
Milad Ghaznavi
Shahin Kamali
Nashid Shahriar
IEEE Journal on Selected Areas in CommunicationsPublication Link
Drawing Planar Graphs with Reduced HeightStephane Durocher
Debajyoti Mondal
J. Graph Algorithms Appl.Publication Link
Efficient broadcast trees for weighted verticesHovhannes A. Harutyunyan
Shahin Kamali
Discrete Applied MathematicsPublication Link
Exploring Increasing-Chord Paths and TreesYeganeh Bahoo
Stephane Durocher
Sahar Mehrpour
Debajyoti Mondal
CCCGPublication Link
Exploring Increasing-Chord Paths and TreesYeganeh Bahoo
Stephane Durocher
Sahar Mehrpour
Debajyoti Mondal
CoRRPublication Link
Guarding monotone art galleries with sliding cameras in linear timeMark de Berg
Stephane Durocher
Saeed Mehrabi
J. Discrete AlgorithmsPublication Link
Guarding orthogonal art galleries with sliding camerasStephane Durocher
Omrit Filtser
Robert Fraser
Saeed Mehrabi
Ali D. Mehrabi
Comput. Geom.Publication Link
Interference Minimization in k-Connected Wireless NetworksStephane Durocher
Sahar Mehrpour
CCCGPublication Link
On the list update problem with adviceJoan Boyar
Shahin Kamali
Kim S. Larsen
Alejandro López-Ortiz
Inf. Comput.Publication 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
Robust Multi-tenant Server Consolidation in the Cloud for Data Analytics WorkloadsKhuzaima Daudjee
Shahin Kamali
Joseph Mate
ICDCSPublication Link
The projection median as a weighted averageStephane Durocher
Alexandre Leblanc
Matthew Skala
JoCGPublication Link
Time vs. Information Tradeoffs for Leader Election in Anonymous TreesChristian Glacet
Avery Miller
Andrzej Pelc
ACM Trans. AlgorithmsPublication Link
Time-Space Trade-Off for Finding the -Visibility Region of a Point in a PolygonYeganeh Bahoo
Bahareh Banyassady
Prosenjit Bose
Stephane Durocher
Wolfgang Mulzer
WALCOMPublication 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)