WADS Invited Talk (Monday, August 11th)
Dr. Prosenjit Bose, Carleton University
Short biography: Dr. Prosenjit Bose is a Chancellor’s Professor in the School of Computer Science at Carleton University. He earned his B.Math. and M.Math. from the University of Waterloo and his Ph.D. from McGill University in 1995, where he received the D.W. Ambridge Award for Best Ph.D. Thesis. After a Killam/NSERC Postdoctoral Fellowship at UBC and a faculty position at UQTR, he joined Carleton in 1997. He has since held adjunct positions at ULB (Brussels), UPC (Barcelona), Tufts (Boston), U. Manitoba and U. Windsor. He served as Associate Dean (Research and Graduate Studies) in the Faculty of Science from 2010 to 2016, and returned to the role in 2023 as Associate Dean (Research and International).
His research interests include computational geometry, graph theory, data structures, and the design and analysis of algorithms. A central focus of his work is on geometric graphs, which are used to model spatial relationships and form the foundation for efficient algorithms and data structures. These structures have applications in areas such as routing, spanners, triangulations, and geographic information systems. He has authored more than 200 peer-reviewed journal publications, which have received over 10,800 citations. Dr. Bose has received several honours for his research, including the Premier’s Research Excellence Award, multiple Carleton University Research Achievement Awards, and best paper awards at conferences such as Graph Drawing and SIROCCO. He has served on numerous program committees, has chaired several international conferences, and has held editorial board positions for various journals in his field.
WADS Invited Talk (Tuesday, August 12th)
Dr. Hsien-Chih Chang, Dartmouth College
Short biography: Dr. Hsien-Chih Chang is an assistant professor in the Department of Computer Science at Dartmouth College. He received a doctoral degree from the University of Illinois at Urbana-Champaign in 2018. His research interests include computational topology and geometry, graph theory and algorithms, and metric embedding. He received the NSF CAREER award on the topic of efficient sketching of graph metrics with geometric structures.
CCCG/WADS Invited Talk (Wednesday, August 13th)
Short biography: Dr. Piotr Indyk is the Thomas D. and Virginia W. Cabot Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, where he has been a faculty member since 2000. He earned his undergraduate degree from the University of Warsaw in 1995, followed by a Ph.D. in Computer Science from Stanford University in 2001. His research interests include algorithms for high-dimensional geometric problems, algorithms using sublinear time and/or space and streaming algorithms. Over the course of his career, Dr. Indyk received several prestigious honours, including a Packard Fellowship in 2003 and a Simons Investigator Award in 2013. In 2012, he was recognized with the Paris Kanellakis Theory and Practice Award for his influential contributions to Locality-Sensitive Hashing. He is a Fellow of the Association for Computing Machinery and a member of both the American Academy of Arts and Sciences and the U.S. National Academy of Sciences.
CCCG Invited Talk (Thursday, August 14th)
Dr. David Mount, University of Maryland
Short biography: Dr. David Mount is a professor in the Department of Computer Science at the University of Maryland with a joint appointment in the University of Maryland Institute for Advanced Computer Studies (UMIACS). He received his Ph.D. from Purdue University in Computer Science in 1983, and started at the University of Maryland in 1984. He was a visiting professor at the Hong Kong University of Science and Technology in 2001, 2009, and 2024.
He has written roughly 200 research publications on algorithms for geometric problems, particularly problems with applications in image processing, pattern recognition, information retrieval, and computer graphics. He currently serves on the editorial boards of a number of journals, including TheoretiCS, Computational Geometry: Theory and Applications, and the International Journal of Computational Geometry & Applications, and he has served on the editorial boards of ACM Transactions on Spatial Algorithms and Systems, ACM Trans. on Mathematical Software, and Pattern Recognition. He was co-recipient of the Symposium on Computational Geometry Test-of-Time Award in 2021. He was the conference chair for the 24th Annual Symposium on Computational Geometry in 2008 and he served as the program committee co-chair for the 19th ACM Symposium on Computational Geometry in 2003. From 2016-18 he served on the Computational Geometry Steering Committee.
CCCG Invited Talk (Firday, August 15th)
Dr. Birgit Vogtenhuber, Graz University of Technology
Short biography: Dr. Birgit Vogtenhuber is a tenured Associate Professor at the Institute of Algorithms and Theory at Graz University of Technology (TU Graz), Austria. She earned her Ph.D. in 2011 from TU Graz with a dissertation about Combinatorial Aspects of Point Sets in the Plane. Her research interests lie at the intersection of theoretical computer science and discrete mathematics, focusing on combinatorial, algorithmic, and complexity-theoretic questions in graph drawing, network visualization, and computational geometry. Dr. Vogtenhuber has an extensive publication record, including over 100 peer-reviewed articles in leading conferences and journals. She currently serves on the editorial boards of several journals, including Graphs and Combinatorics, Computing in Geometry and Topology, and the Journal of Graph Algorithms and Applications.