Hung Le presents "Geometric Techniques for Designing Algorithms in Planar Graphs and Beyond" at the DIMACS Workshop on Modern Techniques in Graph Algorithms held at Rutgers University on June 12, 2023 - June 15, 2023.
Abstract: In this talk, I will provide a brief survey of ideas from geometry in designing efficient algorithms for planar and minor-free graphs. The talk focuses on recent developments in embeddings into small treewidth graphs, VC dimension, tree cover, and related problems. There will be no heavy technical details.
The DIMACS Workshop on Modern Techniques in Graph Algorithms presented major advances in the design of efficient graph algorithms that have occurred over the last decade. The goal of this workshop was to bring together researchers from different areas of graph algorithms to share the techniques that have been recently influential in their areas. Topics covered not only fast graph algorithms in the classical setting, but also algorithms in various computational models such as dynamic algorithms, streaming algorithms, and sublinear algorithms.
