Alina Ene

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 72

Top Topics

Massive Datasets

Greedy Algorithm

Reweighted Least Squares

Top Venues

Publications

Ta Duy Nguyen, Alina Ene
Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems. CoRR (2024)
Fabian Spaeh, Alina Ene, Huy L. Nguyen
Online and Streaming Algorithms for Constrained k-Submodular Maximization. CoRR (2023)
Zijian Liu, Ta Duy Nguyen, Thien Hang Nguyen, Alina Ene, Huy Le Nguyen
High Probability Convergence of Stochastic Gradient Methods. CoRR (2023)
Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen
: Beyond Convexity, Non-Asymptotic Rate and Acceleration. ICLR (2023)
Fabian Spaeh, Alina Ene
Online Ad Allocation with Predictions. CoRR (2023)
Zijian Liu, Ta Duy Nguyen, Thien Hang Nguyen, Alina Ene, Huy Nguyen
High Probability Convergence of Stochastic Gradient Methods. ICML (2023)
Ta Duy Nguyen, Alina Ene, Huy Nguyen
On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis. NeurIPS (2023)
Ta Duy Nguyen, Thien Hang Nguyen, Alina Ene, Huy Nguyen
Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise. NeurIPS (2023)
Fabian Spaeh, Alina Ene
Online Ad Allocation with Predictions. NeurIPS (2023)
Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen
On the Convergence of AdaGrad on $\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration. CoRR (2022)
Alina Ene, Huy L. Nguyen
Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints. ICML (2022)
Alina Ene, Huy L. Nguyen
High Probability Convergence for Accelerated Stochastic Mirror Descent. CoRR (2022)
Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen
Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction. CoRR (2022)
Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen
Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction. ICML (2022)
Alina Ene, Huy Le Nguyen
Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence. AAAI (2022)
Zijian Liu, Ta Duy Nguyen, Thien Hang Nguyen, Alina Ene, Huy L. Nguyen
META-STORM: Generalized Fully-Adaptive Variance Reduced SGD for Unbounded Functions. CoRR (2022)
Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, Andrew Suh
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint. Math. Oper. Res. 47 (4) (2022)
Alina Ene, Huy L. Nguyen, Adrian Vladu
Projection-Free Bandit Optimization with Privacy Guarantees. AAAI (2021)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-weighted Network Design in Planar and Minor-closed Families of Graphs. ACM Trans. Algorithms 17 (2) (2021)
Sofia Maria Nikolakaki, Alina Ene, Evimaria Terzi
An Efficient Framework for Balancing Submodularity and Cost. KDD (2021)
Alina Ene, Huy L. Nguyen, Adrian Vladu
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities. AAAI (2021)
Alina Ene, Huy L. Nguyen
Adaptive and Universal Single-gradient Algorithms for Variational Inequalities. CoRR (2020)
Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, Andrew Suh
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. ICALP (2020)
Alina Ene, Huy L. Nguyen
Parallel Algorithm for Non-Monotone DR-Submodular Maximization. ICML (2020)
Alina Ene, Huy L. Nguyen, Adrian Vladu
Projection-Free Bandit Optimization with Privacy Guarantees. CoRR (2020)
Alina Ene
A note on maximizing the difference between a monotone submodular function and a linear function. CoRR (2020)
Alina Ene, Huy L. Nguyen, Adrian Vladu
Adaptive Gradient Methods for Constrained Convex Optimization. CoRR (2020)
Alina Ene, Huy L. Nguyen
Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time. SODA (2019)
Alina Ene, Adrian Vladu
Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares. ICML (2019)
Alina Ene, Huy L. Nguyen
Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint. ICALP (2019)
Alina Ene, Adrian Vladu
Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares. CoRR (2019)
Alina Ene, Huy L. Nguyen, Adrian Vladu
Submodular maximization with matroid and packing constraints in parallel. STOC (2019)
Alina Ene, Huy L. Nguyen
Parallel Algorithm for Non-Monotone DR-Submodular Maximization. CoRR (2019)
Alina Ene, Huy L. Nguyen
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. ICALP (2019)
Alina Ene, Huy L. Nguyen, Andrew Suh
An Optimal Streaming Algorithm for Non-monotone Submodular Maximization. CoRR (2019)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. CoRR (2019)
Alina Ene, Huy L. Nguyen, Adrian Vladu
A Parallel Double Greedy Algorithm for Submodular Maximization. CoRR (2018)
Alina Ene, Huy L. Nguyen
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint. CoRR (2018)
Chandra Chekuri, Alina Ene, Marcin Pilipczuk
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. 32 (3) (2018)
Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
Online Buy-at-Bulk Network Design. SIAM J. Comput. 47 (4) (2018)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular unsplittable flow on trees. Math. Program. 172 (1-2) (2018)
Alina Ene, Huy L. Nguyen, Adrian Vladu
Submodular Maximization with Packing Constraints in Parallel. CoRR (2018)
Alina Ene, Huy L. Nguyen
Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time. CoRR (2018)
Sofia Maria Nikolakaki, Charalampos Mavroforakis, Alina Ene, Evimaria Terzi
Mining Tours and Paths in Activity Networks. WWW (2018)
Alina Ene, Huy L. Nguyen, László A. Végh
Decomposable Submodular Function Minimization: Discrete and Continuous. CoRR (2017)
Alina Ene, Viswanath Nagarajan, Rishi Saket
Approximation Algorithms for Stochastic k-TSP. FSTTCS (2017)
Alina Ene, Huy L. Nguyen, László A. Végh
Decomposable Submodular Function Minimization: Discrete and Continuous. NIPS (2017)
Alina Ene, Huy L. Nguyen
A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. CoRR (2017)
Alina Ene, Sariel Har-Peled, Benjamin Raichel
Geometric Packing under Nonuniform Constraints. SIAM J. Comput. 46 (6) (2017)
Alina Ene, Huy L. Nguyen
Constrained Submodular Maximization: Beyond 1/e. CoRR (2016)
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
A New Framework for Distributed Submodular Maximization. FOCS (2016)
Julia Chuzhoy, Alina Ene
On Approximating Maximum Independent Set of Rectangles. CoRR (2016)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular Unsplittable Flow on Trees. IPCO (2016)
Chandra Chekuri, Alina Ene, Marcin Pilipczuk
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP (2016)
Alina Ene, Gary L. Miller, Jakub W. Pachocki, Aaron Sidford
Routing under Balance. CoRR (2016)
Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford
Routing under balance. STOC (2016)
Alina Ene, Huy L. Nguyen
Constrained Submodular Maximization: Beyond 1/e. FOCS (2016)
Alina Ene, Huy L. Nguyen
A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns. CoRR (2016)
Julia Chuzhoy, Alina Ene
On Approximating Maximum Independent Set of Rectangles. FOCS (2016)
Alina Ene, Viswanath Nagarajan, Rishi Saket
Approximation Algorithms for Stochastic k-TSP. CoRR (2016)
Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
On Routing Disjoint Paths in Bounded Treewidth Graphs. SWAT (2016)
Chandra Chekuri, Alina Ene
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program. 154 (1-2) (2015)
Alina Ene, Huy L. Nguyen
Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions. CoRR (2015)
Alina Ene, Jan Vondrák, Yi Wu
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. CoRR (2015)
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. ICML (2015)
Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi
Online Buy-at-Bulk Network Design. FOCS (2015)
Fotis Liarokapis, Athanasios Vourvopoulos, Alina Ene
Examining User Experiences through a Multimodal BCI Puzzle Game. IV (2015)
Alina Ene, Huy L. Nguyen
Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions. ICML (2015)
Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
On Routing Disjoint Paths in Bounded Treewidth Graphs. CoRR (2015)
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
A New Framework for Distributed Submodular Maximization. CoRR (2015)
Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi
Online Buy-at-Bulk Network Design. CoRR (2015)
Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. CoRR (2015)
Alina Ene, Ali Vakilian
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. STOC (2014)
Alina Ene, Huy L. Nguyên
From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route? ESA (2014)
Alina Ene, Jan Vondrák
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture. APPROX-RANDOM (2014)
Chandra Chekuri, Alina Ene
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. IPCO (2014)
Fotis Liarokapis, Kurt Debattista, Athanasios Vourvopoulos, Panagiotis Petridis, Alina Ene
Comparing interaction techniques for serious games through brain-computer interfaces: A user perception evaluation study. Entertain. Comput. 5 (4) (2014)
Chandra Chekuri, Alina Ene
Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. SODA (2013)
Alina Ene, Jan Vondrák, Yi Wu
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. SODA (2013)
Alina Ene, Sariel Har-Peled, Benjamin Raichel
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small CoRR (2013)
Fotis Liarokapis, Athanasios Vourvopoulos, Alina Ene, Panagiotis Petridis
Assessing Brain-Computer Interfaces for Controlling Serious Games. VS-GAMES (2013)
Alina Ene, Nitish Korula, Ali Vakilian
Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems CoRR (2013)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. ICALP (1) (2012)
Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li
Approximation algorithms and hardness of integral concurrent flow. STOC (2012)
Chandra Chekuri, Alina Ene, Ali Vakilian
Prize-Collecting Survivable Network Design in Node-Weighted Graphs. APPROX-RANDOM (2012)
Alina Ene, Sariel Har-Peled, Benjamin Raichel
Geometric packing under non-uniform constraints. SCG (2012)
Chandra Chekuri, Alina Ene
Submodular Cost Allocation Problem and Applications CoRR (2011)
Chandra Chekuri, Alina Ene
Submodular Cost Allocation Problem and Applications. ICALP (1) (2011)
Chandra Chekuri, Alina Ene
Approximation Algorithms for Submodular Multiway Partition. FOCS (2011)
Alina Ene, Sungjin Im, Benjamin Moseley
Fast clustering using MapReduce. KDD (2011)
Chandra Chekuri, Alina Ene
Approximation Algorithms for Submodular Multiway Partition CoRR (2011)
MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx
Prize-collecting Steiner Problems on Planar Graphs. SODA (2011)
Alina Ene, Sariel Har-Peled, Benjamin Raichel
Geometric Packing under Non-uniform Constraints CoRR (2011)
Alina Ene, Sungjin Im, Benjamin Moseley
Fast Clustering using MapReduce CoRR (2011)
Chandra Chekuri, Alina Ene, Nitish Korula
Prize-Collecting Steiner Tree and Forest in Planar Graphs CoRR (2010)
Chandra Chekuri, Alina Ene, Nitish Korula
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM (2009)
Alina Ene, William G. Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Endre Tarjan
Fast exact and heuristic methods for role minimization problems. SACMAT (2008)