A Trail Guide to Parameterized Graph Algorithms in Practice

Abstract: This talk will aim to introduce the audience to a mixture of classic and recent algorithmic techniques which originate primarily in the theoretical computer science community and exploit the non-uniformity of computational hardness. In particular, the focus will be on ideas that Blair thinks hold promise for real-world network analysis in the next decade — despite often being completely impractical in their current form! She will also briefly discuss lessons learned from applications where some of these techniques have been engineered successfully to impact domain science, and highlight what Blair sees as key challenges in the space.

Bio: Blair D. Sullivan is a professor in the Kahlert School of Computing at the University of Utah. Prior to joining Utah, Dr. Sullivan was an associate professor at North Carolina State University and a research scientist at Oak Ridge National Laboratory. She received her Ph.D. in Mathematics from Princeton University.

See upcoming and previous presentations at CS Seminar Series.