Authors are ordered alphabetically unless otherwise noted.
Coauthors that were my student or postdoc at the time are underlined.
Conference Publications

Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities
Alina Ene, Huy Lê Nguyễn, Adrian Vladu
In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), 2021
[arXiv]

ProjectionFree Bandit Optimization with Privacy Guarantees
Alina Ene, Huy Lê Nguyễn, Adrian Vladu
In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), 2021
[arXiv]

Parallel Algorithm for NonMonotone DRSubmodular Maximization
Alina Ene, Huy Lê Nguyễn
In Proceedings of the 37th International Conference on Machine Learning (ICML), 2020
[arXiv]
[video]

Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints
Naor Alaluf, Alina Ene, Moran Feldman, Huy Lê Nguyễn, Andrew Suh
In Proceedings of the 47th International Colloquium on Automata, Languages and Programming (ICALP), 2020
[arXiv]
[video by my student Andrew]
Note: This paper is a merger of two preprints: arXiv:1906.11237 and arXiv:1911.12959v1

Improved Convergence for l_infinity and l_1 Regression via Iteratively Reweighted Least Squares
Alina Ene, Adrian Vladu
In Proceedings of the 36th International Conference on Machine Learning (ICML), 2019
[arXiv]
[video by my postdoc Adrian]

Towards Nearlylinear Time Algorithms for Submodular Maximization with a Matroid Constraint
Alina Ene, Huy Lê Nguyễn
In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP), 2019
[arXiv]

A Nearlylinear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Alina Ene, Huy Lê Nguyễn
In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP), 2019
[arXiv]

Submodular Maximization with Matroid and Packing Constraints in Parallel
Alina Ene, Huy Lê Nguyễn, Adrian Vladu
In Proceedings of the 51st ACM Symposium on Theory of Computing (STOC), 2019
[arXiv]

Submodular Maximization with Nearlyoptimal Approximation and Adaptivity in Nearlylinear Time
Alina Ene, Huy Lê Nguyễn
In Proceedings of the 30th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2019
[arXiv]

Mining Tours and Paths in Activity Networks
(in contribution order) Sofia Maria Nikolakaki, Charalampos Mavroforakis, Alina Ene, Evimaria Terzi
In Proceedings of The Web Conference (WWW), 2018.
[pdf]

Decomposable Submodular Function Minimization: Discrete and Continuous
Alina Ene, Huy Lê Nguyễn, László Végh
In Proceedings of the 30th Advances in Neural Information Processing Systems (NeurIPS), 2017
Spotlight presentation
[pdf]
[arXiv]

Approximation Algorithms for Stochastic kTSP
Alina Ene, Viswanath Nagarajan, Rishi Saket
In Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2017
[arXiv]

Constrained Submodular Maximization: Beyond 1/e
Alina Ene, Huy Lê Nguyễn
In Proceedings of the 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016
[arXiv]

A New Framework for Distributed Submodular Maximization
Rafael Barbosa, Alina Ene, Huy Lê Nguyễn, Justin Ward
In Proceedings of the 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016
[arXiv]

On Approximating the Maximum Independent Set of Rectangles
Julia Chuzhoy, Alina Ene
In Proceedings of the 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016
[arXiv]

Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
Chandra Chekuri, Alina Ene, Marcin Pilipczuk
In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP), 2016
[pdf]

On Routing Disjoint Paths in Bounded Treewidth Graphs
Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
In Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 2016
[arXiv]

Routing under Balance
Alina Ene, Gary Miller, Jakub Pachocki, Aaron Sidford
In Proceedings of the 48th ACM Symposium on Theory of Computing (STOC), 2016
[arXiv]

Submodular Unsplittable Flow on Trees
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
In Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2016
[pdf]

Online BuyatBulk Network Design
Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
In Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS), 2015
[arXiv]

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions
Alina Ene, Huy Lê Nguyễn
In Proceedings of the 32nd International Conference on Machine Learning (ICML), 2015
[arXiv]

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets
Rafael Barbosa, Alina Ene, Huy Lê Nguyễn, Justin Ward
In Proceedings of the 32nd International Conference on Machine Learning (ICML), 2015
[arXiv]

From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?
Alina Ene, Huy Lê Nguyễn
In Proceedings of the 22nd European Symposium on Algorithms (ESA), 2014
[pdf]

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture
Alina Ene, Jan Vondrák
In Proceedings of the 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014
[pdf]

Improved Approximation Algorithms for Degreebounded Network Design Problems with Node Connectivity Requirements
Alina Ene, Ali Vakilian
In Proceedings of the 46th ACM Symposium on Theory of Computing (STOC), 2014
[pdf]

The AllorNothing Flow Problem in Directed Graphs with Symmetric Demand Pairs
Chandra Chekuri, Alina Ene
In Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO) 2014
[pdf]

Polylogarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
Chandra Chekuri, Alina Ene
In Proceedings of the 24th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2013
[pdf]

Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
Alina Ene, Jan Vondrák, Yi Wu
In Proceedings of the 24th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2013
[arXiv]

Prizecollecting Survivable Network Design in Nodeweighted Graphs
Chandra Chekuri, Alina Ene, Ali Vakilian
In Proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2012
[pdf]

Nodeweighted Network Design in Planar and Minorclosed Families of Graphs
Chandra Chekuri, Alina Ene, Ali Vakilian
In Proceedings of the 39th International Colloquium on Automata Languages and Programming (ICALP), 2012
[pdf]

Approximation Algorithms and Hardness of Integral Concurrent Flow
Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li
In Proceedings of the 44th ACM Symposium on Theory of Computing (STOC), 2012
[pdf (extended abstract)]
[pdf (full version)]

Geometric Packing under Nonuniform Constraints
Alina Ene, Sariel HarPeled, Benjamin Raichel
In Proceedings of the 28th Annual ACM Symposium on Computational Geometry (SoCG), 2012
[arXiv]

Approximation Algorithms for Submodular Multiway Partition
Chandra Chekuri, Alina Ene
In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), 2011
[pdf]
[arXiv]

Fast Clustering using MapReduce
Alina Ene, Sungjin Im, Benjamin Moseley
In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD), 2011
Oral Presentation
[arXiv]

Submodular Cost Allocation Problem and Applications
Chandra Chekuri, Alina Ene
In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), 2011
[arXiv]

Prizecollecting Steiner Problems on Planar Graphs
Mohammad Hossein Bateni, Chandra Chekuri, Alina Ene, MohammadTaghi Hajiaghayi, Nitish Korula, and Dániel Marx
In Proceedings of the 22nd Annual ACMSIAM Symposium on Discrete Algorithms (SODA), 2011
[pdf]

Unsplittable Flow in Paths and Trees, and ColumnRestricted Packing Integer Programs
Chandra Chekuri, Alina Ene, Nitish Korula
In Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2009
[pdf]

Fast Exact and Heuristic Methods for Role Minimization Problems
Alina Ene, William Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Tarjan
In Proceedings of the 13th ACM Symposium on Access Control Models and Technologies (SACMAT), 2008
[pdf]
Journal Publications

NodeWeighted Network Design in Planar and MinorClosed Families of Graphs
Chandra Chekuri, Alina Ene, Ali Vakilian
Transactions on Algorithms (TALG), 2021.
[arXiv]

Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
Chandra Chekuri, Alina Ene, Marcin Pilipczuk
SIAM Journal on Discrete Mathematics (SIDMA), 2018

Online BuyatBulk Network Design
Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
SIAM Journal on Computing (SICOMP), 2018

Geometric Packing under Nonuniform Constraints
Alina Ene, Sariel HarPeled, Benjamin Raichel
SIAM Journal on Computing (SICOMP), 2017

Submodular Unsplittable Flow on Trees
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Mathematical Programming Series B (MAPR), 2017

The AllorNothing Flow Problem in Directed Graphs with Symmetric Demand Pairs
Chandra Chekuri, Alina Ene
Mathematical Programming Series B (MAPR), 2015
Manuscripts

Adaptive and Universal Singlegradient Algorithms for Variational Inequalities
Alina Ene, Huy Lê Nguyễn)
Manuscript, 2020
[arXiv]

Team Formation: Striking a Balance between Coverage and Cost
Alina Ene, Sofia Maria Nikolakaki, Evimaria Terzi
Manuscript, 2020
[arXiv]

A Parallel Double Greedy Algorithm for Submodular Maximization
Alina Ene, Huy Lê Nguyễn, Adrian Vladu
Manuscript, 2018
[arXiv]

A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns
Alina Ene, Huy Lê Nguyễn
Manuscript, 2016
[arXiv]

Connected Domatic Packings in Nodecapacitated Graphs
Alina Ene, Nitish Korula, Ali Vakilian
Manuscript, 2013
[pdf]

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small
Alina Ene, Sariel HarPeled, Benjamin Raichel
Manuscript, 2013
[arXiv]