default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlina Ene
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c50]Ta Duy Nguyen, Alina Ene:
Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems. ICML 2024- [i40]Ta Duy Nguyen, Alina Ene:
Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems. CoRR abs/2405.18809 (2024) - 2023
- [c49]Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen:
On the Convergence of AdaGrad(Norm) on ℝd: Beyond Convexity, Non-Asymptotic Rate and Acceleration. ICLR 2023 - [c48]Zijian Liu, Ta Duy Nguyen, Thien Hang Nguyen, Alina Ene
, Huy Nguyen:
High Probability Convergence of Stochastic Gradient Methods. ICML 2023: 21884-21914 - [c47]Ta Duy Nguyen, Alina Ene, Huy Nguyen:
On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis. NeurIPS 2023 - [c46]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 - [c45]Fabian Spaeh, Alina Ene:
Online Ad Allocation with Predictions. NeurIPS 2023 - [i39]Fabian Spaeh, Alina Ene:
Online Ad Allocation with Predictions. CoRR abs/2302.01827 (2023) - [i38]Zijian Liu, Ta Duy Nguyen, Thien Hang Nguyen, Alina Ene, Huy Le Nguyen:
High Probability Convergence of Stochastic Gradient Methods. CoRR abs/2302.14843 (2023) - [i37]Fabian Spaeh, Alina Ene, Huy L. Nguyen:
Online and Streaming Algorithms for Constrained k-Submodular Maximization. CoRR abs/2305.16013 (2023) - 2022
- [j8]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): 2667-2690 (2022) - [c44]Alina Ene, Huy Le Nguyen:
Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence. AAAI 2022: 6559-6567 - [c43]Alina Ene, Huy L. Nguyen:
Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints. ICML 2022: 5944-5967 - [c42]Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen:
Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction. ICML 2022: 13947-13994 - [i36]Zijian Liu, Ta Duy Nguyen, Alina Ene, Huy L. Nguyen:
Adaptive Accelerated (Extra-)Gradient Methods with Variance Reduction. CoRR abs/2201.12302 (2022) - [i35]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 abs/2209.14827 (2022) - [i34]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 abs/2209.14853 (2022) - [i33]Alina Ene, Huy L. Nguyen:
High Probability Convergence for Accelerated Stochastic Mirror Descent. CoRR abs/2210.00679 (2022) - 2021
- [j7]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-weighted Network Design in Planar and Minor-closed Families of Graphs. ACM Trans. Algorithms 17(2): 14:1-14:25 (2021) - [c41]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities. AAAI 2021: 7314-7321 - [c40]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Projection-Free Bandit Optimization with Privacy Guarantees. AAAI 2021: 7322-7330 - [c39]Sofia Maria Nikolakaki, Alina Ene, Evimaria Terzi:
An Efficient Framework for Balancing Submodularity and Cost. KDD 2021: 1256-1266 - 2020
- [c38]Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, Andrew Suh:
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. ICALP 2020: 6:1-6:19 - [c37]Alina Ene, Huy L. Nguyen:
Parallel Algorithm for Non-Monotone DR-Submodular Maximization. ICML 2020: 2902-2911 - [i32]Alina Ene:
A note on maximizing the difference between a monotone submodular function and a linear function. CoRR abs/2002.07782 (2020) - [i31]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Adaptive Gradient Methods for Constrained Convex Optimization. CoRR abs/2007.08840 (2020) - [i30]Alina Ene, Huy L. Nguyen:
Adaptive and Universal Single-gradient Algorithms for Variational Inequalities. CoRR abs/2010.07799 (2020) - [i29]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Projection-Free Bandit Optimization with Privacy Guarantees. CoRR abs/2012.12138 (2020)
2010 – 2019
- 2019
- [c36]Alina Ene, Huy L. Nguyen:
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. ICALP 2019: 53:1-53:12 - [c35]Alina Ene, Huy L. Nguyen:
Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint. ICALP 2019: 54:1-54:14 - [c34]Alina Ene, Adrian Vladu:
Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares. ICML 2019: 1794-1801 - [c33]Alina Ene, Huy L. Nguyen:
Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time. SODA 2019: 274-282 - [c32]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Submodular maximization with matroid and packing constraints in parallel. STOC 2019: 90-101 - [i28]Alina Ene, Adrian Vladu:
Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares. CoRR abs/1902.06391 (2019) - [i27]Alina Ene, Huy L. Nguyen:
Parallel Algorithm for Non-Monotone DR-Submodular Maximization. CoRR abs/1905.13272 (2019) - [i26]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. CoRR abs/1910.07616 (2019) - [i25]Alina Ene, Huy L. Nguyen, Andrew Suh:
An Optimal Streaming Algorithm for Non-monotone Submodular Maximization. CoRR abs/1911.12959 (2019) - 2018
- [j6]Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese:
Submodular unsplittable flow on trees. Math. Program. 172(1-2): 565-589 (2018) - [j5]Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. SIAM J. Comput. 47(4): 1505-1528 (2018) - [j4]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. 32(3): 2134-2160 (2018) - [c31]Sofia Maria Nikolakaki, Charalampos Mavroforakis, Alina Ene, Evimaria Terzi:
Mining Tours and Paths in Activity Networks. WWW 2018: 459-468 - [i24]Alina Ene, Huy L. Nguyen:
Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time. CoRR abs/1804.05379 (2018) - [i23]Alina Ene, Huy L. Nguyen, Adrian Vladu:
Submodular Maximization with Packing Constraints in Parallel. CoRR abs/1808.09987 (2018) - [i22]Alina Ene, Huy L. Nguyen:
Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint. CoRR abs/1811.07464 (2018) - [i21]Alina Ene, Huy L. Nguyen, Adrian Vladu:
A Parallel Double Greedy Algorithm for Submodular Maximization. CoRR abs/1812.01591 (2018) - 2017
- [j3]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric Packing under Nonuniform Constraints. SIAM J. Comput. 46(6): 1745-1784 (2017) - [c30]Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. FSTTCS 2017: 27:27-27:14 - [c29]Alina Ene, Huy L. Nguyen, László A. Végh:
Decomposable Submodular Function Minimization: Discrete and Continuous. NIPS 2017: 2870-2880 - [i20]Alina Ene, Huy L. Nguyen, László A. Végh:
Decomposable Submodular Function Minimization: Discrete and Continuous. CoRR abs/1703.01830 (2017) - [i19]Alina Ene, Huy L. Nguyen:
A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint. CoRR abs/1709.09767 (2017) - 2016
- [c28]Alina Ene, Huy L. Nguyen:
Constrained Submodular Maximization: Beyond 1/e. FOCS 2016: 248-257 - [c27]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
A New Framework for Distributed Submodular Maximization. FOCS 2016: 645-654 - [c26]Julia Chuzhoy, Alina Ene:
On Approximating Maximum Independent Set of Rectangles. FOCS 2016: 820-829 - [c25]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP 2016: 7:1-7:14 - [c24]Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese:
Submodular Unsplittable Flow on Trees. IPCO 2016: 337-349 - [c23]Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Routing under balance. STOC 2016: 598-611 - [c22]Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski:
On Routing Disjoint Paths in Bounded Treewidth Graphs. SWAT 2016: 15:1-15:15 - [i18]Alina Ene, Gary L. Miller, Jakub Pachocki, Aaron Sidford:
Routing under Balance. CoRR abs/1603.09009 (2016) - [i17]Alina Ene, Huy L. Nguyen:
A Reduction for Optimizing Lattice Submodular Functions with Diminishing Returns. CoRR abs/1606.08362 (2016) - [i16]Julia Chuzhoy, Alina Ene:
On Approximating Maximum Independent Set of Rectangles. CoRR abs/1608.00271 (2016) - [i15]Alina Ene, Huy L. Nguyen:
Constrained Submodular Maximization: Beyond 1/e. CoRR abs/1608.03611 (2016) - [i14]Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. CoRR abs/1610.01058 (2016) - 2015
- [j2]Chandra Chekuri, Alina Ene:
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program. 154(1-2): 249-272 (2015) - [c21]Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. FOCS 2015: 545-562 - [c20]Alina Ene, Huy L. Nguyen:
Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions. ICML 2015: 787-795 - [c19]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. ICML 2015: 1236-1244 - [c18]Fotis Liarokapis, Athanasios Vourvopoulos, Alina Ene:
Examining User Experiences through a Multimodal BCI Puzzle Game. IV 2015: 488-493 - [i13]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. CoRR abs/1502.02606 (2015) - [i12]Alina Ene, Huy L. Nguyen:
Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions. CoRR abs/1502.02643 (2015) - [i11]Alina Ene, Jan Vondrák, Yi Wu:
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. CoRR abs/1503.03905 (2015) - [i10]Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
A New Framework for Distributed Submodular Maximization. CoRR abs/1507.03719 (2015) - [i9]Deeparnab Chakrabarty, Alina Ene, Ravishankar Krishnaswamy, Debmalya Panigrahi:
Online Buy-at-Bulk Network Design. CoRR abs/1509.03212 (2015) - [i8]Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski:
On Routing Disjoint Paths in Bounded Treewidth Graphs. CoRR abs/1512.01829 (2015) - 2014
- [j1]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): 391-399 (2014) - [c17]Alina Ene, Jan Vondrák:
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture. APPROX-RANDOM 2014: 144-159 - [c16]Alina Ene, Huy L. Nguyên:
From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route? ESA 2014: 382-393 - [c15]Chandra Chekuri, Alina Ene:
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. IPCO 2014: 222-233 - [c14]Alina Ene, Ali Vakilian:
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. STOC 2014: 754-763 - 2013
- [b1]Alina Ene:
Approximation algorithms for submodular optimization and graph problems. University of Illinois Urbana-Champaign, USA, 2013 - [c13]Alina Ene, Jan Vondrák, Yi Wu:
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. SODA 2013: 306-325 - [c12]Chandra Chekuri, Alina Ene:
Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. SODA 2013: 326-341 - [c11]Fotis Liarokapis, Athanasios Vourvopoulos, Alina Ene, Panagiotis Petridis:
Assessing Brain-Computer Interfaces for Controlling Serious Games. VS-GAMES 2013: 1-4 - [i7]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small. CoRR abs/1304.7318 (2013) - [i6]Alina Ene, Nitish Korula, Ali Vakilian:
Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems. CoRR abs/1305.4308 (2013) - 2012
- [c10]Chandra Chekuri, Alina Ene, Ali Vakilian:
Prize-Collecting Survivable Network Design in Node-Weighted Graphs. APPROX-RANDOM 2012: 98-109 - [c9]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric packing under non-uniform constraints. SCG 2012: 11-20 - [c8]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. ICALP (1) 2012: 206-217 - [c7]Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li:
Approximation algorithms and hardness of integral concurrent flow. STOC 2012: 689-708 - 2011
- [c6]Chandra Chekuri, Alina Ene:
Approximation Algorithms for Submodular Multiway Partition. FOCS 2011: 807-816 - [c5]Chandra Chekuri, Alina Ene:
Submodular Cost Allocation Problem and Applications. ICALP (1) 2011: 354-366 - [c4]Alina Ene, Sungjin Im, Benjamin Moseley:
Fast clustering using MapReduce. KDD 2011: 681-689 - [c3]MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx:
Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049 - [i5]Chandra Chekuri, Alina Ene:
Submodular Cost Allocation Problem and Applications. CoRR abs/1105.2040 (2011) - [i4]Chandra Chekuri, Alina Ene:
Approximation Algorithms for Submodular Multiway Partition. CoRR abs/1105.2048 (2011) - [i3]Alina Ene, Sariel Har-Peled, Benjamin Raichel:
Geometric Packing under Non-uniform Constraints. CoRR abs/1107.2949 (2011) - [i2]Alina Ene, Sungjin Im, Benjamin Moseley:
Fast Clustering using MapReduce. CoRR abs/1109.1579 (2011) - 2010
- [i1]Chandra Chekuri, Alina Ene, Nitish Korula:
Prize-Collecting Steiner Tree and Forest in Planar Graphs. CoRR abs/1006.4357 (2010)
2000 – 2009
- 2009
- [c2]Chandra Chekuri, Alina Ene, Nitish Korula:
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM 2009: 42-55 - 2008
- [c1]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: 1-10
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
