I am an Assistant Professor in the Computer Science department at the University of Warwick. I am also affiliated with DIMAP.

**Previous Affiliations**

Postdoc, Center for Computational Intractability, Princeton University. September 2013 - September 2014 (on leave October 2013).

Ph.D. student (advisor: Chandra Chekuri), Algorithms and Theory Group, Computer Science department, University of Illinois at Urbana-Champaign. August 2008 - July 2013.

Undegraduate student (advisor: Robert Tarjan), Princeton University. September 2004 - June 2008. Graduated with a high honors (magna cum laude) B.S.E. degree in Computer Science.

**Research Interests**

I have broad research interests in theoretical computer science and
optimization. I am currently working on approximation algorithms for
combinatorial optimization problems. The main areas of approximation that I
have worked in are submodular optimization, routing, and network design. I have
also worked on geometric approximation problems, general packing and covering,
and large data analysis using MapReduce.

**Contact**

The best way to reach me is by email; A.Ene *at* warwick
*dot* ac *dot* uk, or aene *at* cs *dot*
princeton *dot* edu.

**Copyright warning:** The copyright of each paper belongs to the
respective publisher. The local copy is only for non-commercial,
personal use.

From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route? (with Huy Lê Nguyễn). In Proceedings of the 22nd European Symposium on Algorithms (ESA), 2014.

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture (with Jan Vondrák). In Proceedings of the 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014.

Improved Approximation Algorithms for Degree-bounded Network Design Problems with Node Connectivity Requirements (with Ali Vakilian). In Proceedings of the 46th ACM Symposium on Theory of Computing (STOC), 2014.

The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs (with Chandra Chekuri). In Proceedings of the 17th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2014.

Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion (with Chandra Chekuri). In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013.

Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems (with Jan Vondrák and Yi Wu). In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013.

Prize-collecting Survivable Network Design in Node-weighted Graphs (with Chandra Chekuri and Ali Vakilian). In Proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2012.

Node-weighted Network Design in Planar and Minor-closed Families of Graphs (with Chandra Chekuri and Ali Vakilian). In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP), 2012.

- Approximation Algorithms and Hardness of Integral Concurrent Flow (with Parinya Chalermsook, Julia Chuzhoy, and Shi Li). In Proceedings of the 44th ACM Symposium on Theory of Computing (STOC), 2012. A full version.
Geometric Packing under Non-uniform Constraints (with Sariel Har-Peled and Benjamin Raichel). In Proceedings of the 28th Annual ACM Symposium on Computational Geometry (SoCG), 2012. [arXiv]

- Approximation Algorithms for Submodular Multiway Partition (with Chandra Chekuri). In Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS), 2012. [arXiv]
Fast Clustering using MapReduce (with Sungjin Im and Benjamin Moseley). In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD), 2011. Oral Presentation. [arXiv]

Submodular Cost Allocation Problem and Applications (with Chandra Chekuri). In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), 2011. [arXiv]

Prize-collecting Steiner Problems on Planar Graphs (with Mohammad Hossein Bateni, Chandra Chekuri, MohammadTaghi Hajiaghayi, Nitish Korula, and Dániel Marx). In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.

Unsplittable Flow in Paths and Trees, and Column-Restricted Packing Integer Programs (with Chandra Chekuri and Nitish Korula). In Proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2009.

Fast Exact and Heuristic Methods for Role Minimization Problems (with William Horne, Nikola Milosavljevic, Prasad Rao, Robert Schreiber, Robert Tarjan). In Proceedings of the 13th ACM Symposium on Access Control Models and Technologies (SACMAT), 2008.

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions (with Huy Lê Nguyễn). 2015. [arXiv]

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets (with Rafael Barbosa, Huy Lê Nguyễn and Justin Ward). 2015.[arXiv]

Connected Domatic Packings in Node-capacitated Graphs (with Nitish Korula and Ali Vakilian). 2013.

Approximation Algorithms for Stochastic k-TSP (with Viswanath Nagarajan and Rishi Saket). 2012.

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small (with Sariel Har-Peled and Benjamin Raichel). 2012. [arXiv]

Unsplittable Flow in Paths and Trees, and Column-Restricted Packing Integer Programs (with Chandra Chekuri and Nitish Korula). A longer version of the APPROX 2009 paper with additional results and improvements. 2011.

Approximation algorithms for submodular optimization and graph problems. PhD thesis, August 2013.

26th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015.

12th Workshop on Approximation and Online Algorithms (WAOA), 2014.

17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014.