Innovation Hall, Room E322
University of Vermont
82 University Place
Burlington, VT 05405
United States
- Ph.D. in Computing, University of Utah, 2023
- B.S. in Computer Science, Duke University, 2017
BIO
Brian joined UVM in 2024 after completing his Ph.D. at the University of Utah. His work focused on leveraging approximation algorithms, structural graph theory, and parameterized complexity into scalable solutions for real-world problems. At UVM, he teaches introductory programming, automata theory, and complexity.
Courses
- CS 1210 - Computer Programming I
- CS 2250 - Computability and Complexity
Area(s) of expertise
Structural graph theory, parameterized algorithms and complexity
Bio
Brian joined UVM in 2024 after completing his Ph.D. at the University of Utah. His work focused on leveraging approximation algorithms, structural graph theory, and parameterized complexity into scalable solutions for real-world problems. At UVM, he teaches introductory programming, automata theory, and complexity.
Courses
- CS 1210 - Computer Programming I
- CS 2250 - Computability and Complexity
Areas of Expertise
Structural graph theory, parameterized algorithms and complexity
Selected Publications
- E.D. Demaine, T.D. Goodrich, K. Kloster, B. Lavallee, Q.C. Liu, B.D. Sulivan, A. van der Poel. Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA 2019.
- B. Lavallee, H. Russel, B.D. Sullivan, A. van der Poel. Approximating Vertex Cover Using Structural Rounding. ALENEX 2020.
- M. Breen-McKay, B. Lavallee, B.D. Sullivan. Hardness of the Generalized Coloring Numbers. EuJC 2023.
- A. Fraser, B. Lavallee, B.D. Sullivan. Parameterized Complexity of Gerrymandering. SAGT 2023.
- A. Crane, B. Lavallee, B.D. Sullivan, N. Veldt. Overlapping and Robust Edge-Colored Clustering in Hypergraphs. WSDM 2024.