Alina Ene
Alina Ene
Verified email at bu.edu - Homepage
Title
Cited by
Cited by
Year
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
2592008
Fast clustering using MapReduce
A Ene, S Im, B Moseley
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
2542011
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
862015
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
722009
Constrained submodular maximization: Beyond 1/e
A Ene, HL Nguyen
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
682016
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
642016
Approximation algorithms for submodular multiway partition
C Chekuri, A Ene
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 807-816, 2011
632011
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
462013
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
452011
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
442019
Submodular cost allocation problem and applications
C Chekuri, A Ene
International Colloquium on Automata, Languages, and Programming, 354-366, 2011
402011
Random coordinate descent methods for minimizing decomposable submodular functions
A Ene, H Nguyen
International Conference on Machine Learning, 787-795, 2015
382015
A nearly-linear time algorithm for submodular maximization with a knapsack constraint
A Ene, HL Nguyen
arXiv preprint arXiv:1709.09767, 2017
362017
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
352013
On approximating maximum independent set of rectangles
J Chuzhoy, A Ene
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
262016
Submodular maximization with matroid and packing constraints in parallel
A Ene, HL Nguyễn, A Vladu
Proceedings of the 51st annual ACM SIGACT symposium on theory of computing …, 2019
252019
A reduction for optimizing lattice submodular functions with diminishing returns
A Ene, HL Nguyen
arXiv preprint arXiv:1606.08362, 2016
222016
Prize-collecting survivable network design in node-weighted graphs
C Chekuri, A Ene, A Vakilian
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
222012
Geometric packing under non-uniform constraints
A Ene, S Har-Peled, B Raichel
Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012
22*2012
Computer-implemented method for obtaining a minimum biclique cover in a bipartite dataset
RS Schreiber, A Ene, N Milosavljevic, RE Tarjan, MA Shah
US Patent 8,209,742, 2012
172012
The system can't perform the operation now. Try again later.
Articles 1–20