Associate Professor
Alina Ene is an Associate Professor in the Computer Science department at Boston University. Her research interests include the design and analysis of algorithms, the mathematical aspects of combinatorial optimization topics such as submodularity and graphs, and their applications to machine learning. Prior to joining BU, she was an Assistant Professor at the University of Warwick, a Faculty Fellow at the Alan Turing Institute for Data Science, and a postdoc in the Center for Computational Intractability at Princeton University. Alina obtained her PhD in Computer Science from the University of Illinois at Urbana-Champaign in 2013 under the supervision of Chandra Chekuri. She graduated with a BSE degree in Computer Science from Princeton University in 2008, with High Honors in Computer Science.
Selected Publications
A New Framework for Distributed Submodular Maximization (with Rafael Barbosa, Huy Le Nguyen and Justin Ward). In Proceedings of the 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016.
Routing under Balance (with Gary Miller, Jakub Pachocki and Aaron Sidford). In Proceedings of the 48th ACM Symposium on Theory of Computing (STOC), 2016.
Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions (with Huy Le Nguyen). In Proceedings of the 32nd International Conference on Machine Learning (ICML), 2015.
Approximation Algorithms for Submodular Multiway Partition (with Chandra Chekuri). In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), 2011.