Jérôme Urhausen’s presentation of the paper, Diverse Partitions of Colored Points, was selected by the program committee for the Best Student Presentation Award for WADS 2021. Congratulations to the winner!
This is the news blog for WADS 2021.
WADS 2021 ended on August 11. We had 256 participants for WADS 2021 (we also had 257 participants for CCCG 2021, and since most folks attended both, the total registration count for WADS/CCCG 2021 was 302). We would like to thank everyone for participating in the conference and contributing to it! I would like to …
The Proceedings of WADS 2021 can now be accessed from our Conference Proceedings page.
The Program page of this website has been updated with a detailed schedule.
We have open the registration server. See our Registration page for more information. We look forward to seeing you at WADS 2021!
Due to the COVID situation, WADS 2021 will be held fully online. The details of conference registration will be made available later.
The following contribution by Pawel Gawrychowski and Przemyslaw Uznanski, “Better distance labeling for unweighted planar graphs“ has been voted Best Paper of WADS 2021 by the Program Committee. Congratulations to the authors!
Helena Bergold, Winfried Hochstättler and Uwe Mayer. The Neighborhood Polynomial of Chordal Graphs Jim Apple. HalftimeHash: modern hashing without 64-bit multipliers or finite fields Shelby Kimmel and R. Teal Witter. A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs Logan Pedersen and Haitao Wang. Algorithms for the Line-Constrained Disk Coverage and Related Problems Giulia Bernardini, Paola Bonizzoni and Pawel Gawrychowski. Incomplete Directed Perfect …
Call for Papers WADS 2021Algorithms and Data Structures SymposiumAugust 9-11, 2021Dalhousie University, Halifax, Nova Scotia, Canada The Algorithms and Data Structures Symposium, WADS, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. We …