Alina R. Ene
Alina R. Ene
Verified email at bu.edu - Homepage
TitleCited byYear
Fast exact and heuristic methods for role minimization problems
A Ene, W Horne, N Milosavljevic, P Rao, R Schreiber, RE Tarjan
Proceedings of the 13th ACM symposium on Access control models and …, 2008
2072008
Fast clustering using MapReduce
A Ene, S Im, B Moseley
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
2012011
The power of randomization: Distributed submodular maximization on massive datasets
R Barbosa, A Ene, H Nguyen, J Ward
International Conference on Machine Learning, 1236-1244, 2015
632015
Unsplittable flow in paths and trees and column-restricted packing integer programs
C Chekuri, A Ene, N Korula
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
592009
Sungjin Im
A Ene
Benjamin Moseley, Fast clustering using MapReduce, Proceedings of the 17th …, 2011
572011
Approximation algorithms for submodular multiway partition
C Chekuri, A Ene
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 807-816, 2011
492011
A new framework for distributed submodular maximization
RP Barbosa, A Ene, HL Nguyen, J Ward
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
402016
Constrained submodular maximization: Beyond 1/e
A Ene, HL Nguyen
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
392016
Prize-collecting Steiner problems on planar graphs
M Bateni, C Chekuri, A Ene, MT Hajiaghayi, N Korula, D Marx
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
392011
Local distribution and the symmetry gap: Approximability of multiway partitioning problems
A Ene, J Vondrák, Y Wu
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
372013
Submodular cost allocation problem and applications
C Chekuri, A Ene
International Colloquium on Automata, Languages, and Programming, 354-366, 2011
342011
Poly-logarithmic approximation for maximum node disjoint paths with constant congestion
C Chekuri, A Ene
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
312013
Random coordinate descent methods for minimizing decomposable submodular functions
A Ene, H Nguyen
International Conference on Machine Learning, 787-795, 2015
262015
Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time
A Ene, HL Nguyễn
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
222019
Prize-collecting survivable network design in node-weighted graphs
C Chekuri, A Ene, A Vakilian
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
192012
Geometric packing under non-uniform constraints
A Ene, S Har-Peled, B Raichel
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
19*2012
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
A Ene, A Vakilian
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
142014
Node-weighted network design in planar and minor-closed families of graphs
C Chekuri, A Ene, A Vakilian
International Colloquium on Automata, Languages, and Programming, 206-217, 2012
142012
A reduction for optimizing lattice submodular functions with diminishing returns
A Ene, HL Nguyen
arXiv preprint arXiv:1606.08362, 2016
132016
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
C Chekuri, A Ene
Mathematical Programming 154 (1-2), 249-272, 2015
132015
The system can't perform the operation now. Try again later.
Articles 1–20