Brian Lavallee

Brian Lavallee is a Lecturer in the Department of Computer Science at the University of Vermont, joining in 2024. His research bridges structural graph theory, parameterized complexity, and approximation algorithms to solve real-world computational problems. At UVM, he teaches foundational courses in programming, automata theory, and computational complexity.

• Education: Ph.D. in Computing (University of Utah, 2023), B.S. in Computer Science (Duke University, 2017)

Brian's research focuses on developing efficient algorithms for NP-hard problems through structural graph analysis and complexity-based approaches. His work on structural rounding and vertex cover approximation has advanced scalable solutions for graphs near tractable classes. Recent publications highlight his expertise in hypergraph clustering, gerrymandering complexity, and generalized coloring hardness.

In teaching, he emphasizes core computer science principles through courses like CS 1210 - Computer Programming I and CS 2250 - Computability and Complexity. His office is located in Innovation Hall, Room E322, at UVM's Burlington campus.