Brian Lavallee

According to our database, Brian Lavallee authored at least 7 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Hardness of the generalized coloring numbers.

Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan

Eur. J. Comb., 2025

2024

Overlapping and Robust Edge-Colored Clustering in Hypergraphs.

Alex Crane, Brian Lavallee, Blair D. Sullivan, Nate Veldt

Proceedings of the 17th ACM International Conference on Web Search and Data Mining, 2024

2023

Parameterized Complexity of Gerrymandering.

Andrew Fraser, Brian Lavallee, Blair D. Sullivan

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2022

Gerrymandering Trees: Parameterized Hardness.

Andrew Fraser, Brian Lavallee, Blair D. Sullivan

CoRR, 2022

2020

Approximating Vertex Cover using Structural Rounding.

Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.

Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2013

Gridless submarine optical networks.

Brian Lavallee

Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013