Fast exact and heuristic methods for role minimization problems. - Alina Ene; William G. Horne; Nikola Milosavljevic; Prasad Rao; Robert Schreiber; Robert Endre Tarjan (SACMAT, 2008)

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. - Chandra Chekuri; Alina Ene; Nitish Korula (APPROX-RANDOM, 2009)

Prize-Collecting Steiner Tree and Forest in Planar Graphs - Chandra Chekuri; Alina Ene; Nitish Korula (CoRR, 2010)

Approximation Algorithms for Submodular Multiway Partition. - Chandra Chekuri; Alina Ene (FOCS, 2011)

Submodular Cost Allocation Problem and Applications. - Chandra Chekuri; Alina Ene (ICALP (1), 2011)

Fast clustering using MapReduce. - Alina Ene; Sungjin Im; Benjamin Moseley (KDD, 2011)

Prize-collecting Steiner Problems on Planar Graphs. - MohammadHossein Bateni; Chandra Chekuri; Alina Ene; Mohammad Taghi Hajiaghayi; Nitish Korula; Dániel Marx (SODA, 2011)

Prize-Collecting Survivable Network Design in Node-Weighted Graphs. - Chandra Chekuri; Alina Ene; Ali Vakilian (APPROX-RANDOM, 2012)

Geometric packing under non-uniform constraints. - Alina Ene; Sariel Har-Peled; Benjamin Raichel (SCG, 2012)

Approximation algorithms and hardness of integral concurrent flow. - Parinya Chalermsook; Julia Chuzhoy; Alina Ene; Shi Li 001 (STOC, 2012)

Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. - Chandra Chekuri; Alina Ene (SODA, 2013)

Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. - Alina Ene; Jan Vondrák; Yi Wu 002 (SODA, 2013)

Assessing Brain-Computer Interfaces for Controlling Serious Games. - Fotis Liarokapis; Athanasios Vourvopoulos; Alina Ene; Panagiotis Petridis (VS-GAMES, 2013)

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small - Alina Ene; Sariel Har-Peled; Benjamin Raichel (CoRR, 2013)

Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems - Alina Ene; Nitish Korula; Ali Vakilian (CoRR, 2013)

Approximation algorithms for submodular optimization and graph problems - Alina Ene (2013)

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture. - Alina Ene; Jan Vondrák (APPROX-RANDOM, 2014)

From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route? - Alina Ene; Huy L. Nguyên (ESA, 2014)

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. - Alina Ene; Ali Vakilian (STOC, 2014)

Comparing interaction techniques for serious games through brain-computer interfaces: A user perception evaluation study. - Fotis Liarokapis; Kurt Debattista; Athanasios Vourvopoulos; Panagiotis Petridis; Alina Ene (Entertain. Comput., 2014)

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. - Rafael da Ponte Barbosa; Alina Ene; Huy L. Nguyen; Justin Ward (ICML, 2015)

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions. - Alina Ene; Huy L. Nguyen (ICML, 2015)

Examining User Experiences through a Multimodal BCI Puzzle Game. - Fotis Liarokapis; Athanasios Vourvopoulos; Alina Ene (IV, 2015)

The all-or-nothing flow problem in directed graphs with symmetric demand pairs. - Chandra Chekuri; Alina Ene (Math. Program., 2015)

A New Framework for Distributed Submodular Maximization. - Rafael da Ponte Barbosa; Alina Ene; Huy L. Nguyen; Justin Ward (FOCS, 2016)

On Approximating Maximum Independent Set of Rectangles. - Julia Chuzhoy; Alina Ene (FOCS, 2016)

Constrained Submodular Maximization: Beyond 1/e. - Alina Ene; Huy L. Nguyen (FOCS, 2016)

Routing under balance. - Alina Ene; Gary L. Miller; Jakub Pachocki; Aaron Sidford (STOC, 2016)

On Routing Disjoint Paths in Bounded Treewidth Graphs. - Alina Ene; Matthias Mnich; Marcin Pilipczuk; Andrej Risteski (SWAT, 2016)

A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns. - Alina Ene; Huy L. Nguyen (CoRR, 2016)

Approximation Algorithms for Stochastic k-TSP. - Alina Ene; Viswanath Nagarajan; Rishi Saket (FSTTCS, 2017)

Decomposable Submodular Function Minimization: Discrete and Continuous. - Alina Ene; Huy L. Nguyen; László A. Végh (NIPS, 2017)

Geometric Packing under Nonuniform Constraints. - Alina Ene; Sariel Har-Peled; Benjamin Raichel (SIAM J. Comput., 2017)

Mining Tours and Paths in Activity Networks. - Sofia Maria Nikolakaki; Charalampos Mavroforakis; Alina Ene; Evimaria Terzi (WWW, 2018)

Submodular Maximization with Packing Constraints in Parallel. - Alina Ene; Huy L. Nguyen; Adrian Vladu (CoRR, 2018)

A Parallel Double Greedy Algorithm for Submodular Maximization. - Alina Ene; Huy L. Nguyen; Adrian Vladu (CoRR, 2018)

Submodular unsplittable flow on trees. - Anna Adamaszek; Parinya Chalermsook; Alina Ene; Andreas Wiese (Math. Program., 2018)

Online Buy-at-Bulk Network Design. - Deeparnab Chakrabarty; Alina Ene; Ravishankar Krishnaswamy; Debmalya Panigrahi (SIAM J. Comput., 2018)

Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. - Chandra Chekuri; Alina Ene; Marcin Pilipczuk (SIAM J. Discret. Math., 2018)

A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. - Alina Ene; Huy L. Nguyen (ICALP, 2019)

Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint. - Alina Ene; Huy L. Nguyen (ICALP, 2019)

Improved Convergence for $ ell_1$ and $ ell_∞$ Regression via Iteratively Reweighted Least Squares. - Alina Ene; Adrian Vladu (ICML, 2019)

Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time. - Alina Ene; Huy L. Nguyen (SODA, 2019)

Submodular maximization with matroid and packing constraints in parallel. - Alina Ene; Huy L. Nguyen; Adrian Vladu (STOC, 2019)

Improved Convergence for $ ell_ infty$ and $ ell_1$ Regression via Iteratively Reweighted Least Squares. - Alina Ene; Adrian Vladu (CoRR, 2019)

An Optimal Streaming Algorithm for Non-monotone Submodular Maximization. - Alina Ene; Huy L. Nguyen; Andrew Suh (CoRR, 2019)

Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. - Naor Alaluf; Alina Ene; Moran Feldman; Huy L. Nguyen; Andrew Suh (ICALP, 2020)

Parallel Algorithm for Non-Monotone DR-Submodular Maximization. - Alina Ene; Huy L. Nguyen (ICML, 2020)

A note on maximizing the difference between a monotone submodular function and a linear function. - Alina Ene (CoRR, 2020)

Adaptive Gradient Methods for Constrained Convex Optimization. - Alina Ene; Huy L. Nguyen; Adrian Vladu (CoRR, 2020)

Adaptive and Universal Single-gradient Algorithms for Variational Inequalities. - Alina Ene; Huy L. Nguyen (CoRR, 2020)

Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities. - Alina Ene; Huy L. Nguyen; Adrian Vladu (AAAI, 2021)

Projection-Free Bandit Optimization with Privacy Guarantees. - Alina Ene; Huy L. Nguyen; Adrian Vladu (AAAI, 2021)

An Efficient Framework for Balancing Submodularity and Cost. - Sofia Maria Nikolakaki; Alina Ene; Evimaria Terzi (KDD, 2021)

Node-weighted Network Design in Planar and Minor-closed Families of Graphs. - Chandra Chekuri; Alina Ene; Ali Vakilian (ACM Trans. Algorithms, 2021)

Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence. - Alina Ene; Huy Le Nguyen (AAAI, 2022)

Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints. - Alina Ene; Huy L. Nguyen (ICML, 2022)

Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction. - Zijian Liu 003; Ta Duy Nguyen; Alina Ene; Huy L. Nguyen (ICML, 2022)

On the Convergence of AdaGrad on $ R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration. - Zijian Liu 003; Ta Duy Nguyen; Alina Ene; Huy L. Nguyen (CoRR, 2022)

META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions. - Zijian Liu 003; Ta Duy Nguyen; Thien Hang Nguyen; Alina Ene; Huy L. Nguyen (CoRR, 2022)

High Probability Convergence for Accelerated Stochastic Mirror Descent. - Alina Ene; Huy L. Nguyen (CoRR, 2022)

An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint. - Naor Alaluf; Alina Ene; Moran Feldman; Huy L. Nguyen; Andrew Suh (Math. Oper. Res., 2022)

On the Convergence of AdaGrad(Norm) on ℝd: Beyond Convexity, Non-Asymptotic Rate and Acceleration. - Zijian Liu 003; Ta Duy Nguyen; Alina Ene; Huy L. Nguyen (ICLR, 2023)

High Probability Convergence of Stochastic Gradient Methods. - Zijian Liu 003; Ta Duy Nguyen; Thien Hang Nguyen; Alina Ene; Huy Nguyen (ICML, 2023)

On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis. - Ta Duy Nguyen; Alina Ene; Huy Nguyen (NeurIPS, 2023)

Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise. - Ta Duy Nguyen; Thien Hang Nguyen; Alina Ene; Huy Nguyen (NeurIPS, 2023)

Online Ad Allocation with Predictions. - Fabian Spaeh; Alina Ene (NeurIPS, 2023)

High Probability Convergence of Stochastic Gradient Methods. - Zijian Liu 003; Ta Duy Nguyen; Thien Hang Nguyen; Alina Ene; Huy Le Nguyen (CoRR, 2023)

Online and Streaming Algorithms for Constrained k-Submodular Maximization. - Fabian Spaeh; Alina Ene; Huy L. Nguyen (CoRR, 2023)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems. - Ta Duy Nguyen; Alina Ene (ICML, 2024)

Online and Streaming Algorithms for Constrained k-Submodular Maximization. - Fabian Christian Spaeh; Alina Ene; Huy Nguyen (AAAI, 2025)

Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures. - Alina Ene; Alessandro Epasto; Vahab Mirrokni; Hoai-An Nguyen; Huy L. Nguyen; David P. Woodruff; Peilin Zhong (CoRR, 2025)

Solving Linear Programs with Differential Privacy. - Alina Ene; Huy Le Nguyen; Ta Duy Nguyen; Adrian Vladu (CoRR, 2025)

Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue. - Alina Ene; Troy Lee; Piotr Micek; Sushant Sachdeva (ACM Trans. Algorithms, 2025)