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

Postdoc, Center for Computational Intractability, Princeton University. September 2013 - September 2014.

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.

My research interests are broad, and they span theoretical computer science, optimization, and theoretical machine learning. My interests include submodularity, graph algorithms including routing and network design, algorithms for massive data, and applications in machine learning and computer vision.

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

CS 136: Discrete Mathematics and its Applications I, Term 1, 2015/16.

CS 254: Algorithmic Graph Theory, Term 2, 2015/16.
CS 131:
Mathematics for Computer Science II,
Term 2, 2014/15.

**PhD:** Rafael da Ponte Barbosa

**MSc:** James Soffe

**Undergraduate:** Sara Jenkins

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

A New Framework for Distributed Submodular Maximization (with Rafael Barbosa, Huy Lê Nguyễn and Justin Ward).
*Manuscript*, 2015.

[arXiv]

Online Buy-at-Bulk Network Design (with Deeparnab Chakrabarty, Ravishankar Krishnaswamy and Debmalya Panigrahi).
In Proceedings of the 56th Annual Symposium on Foundations of
Computer Science **(FOCS)**, 2015.

[arXiv]

Random Coordinate Descent Methods for
Minimizing Decomposable Submodular Functions (with Huy
Lê Nguyễn).
In Proceedings of the 32nd International Conference on Machine
Learning **(ICML)**, 2015.

[arXiv]

The Power of Randomization: Distributed Submodular Maximization on
Massive Datasets (with Rafael Barbosa, Huy Lê Nguyễn and Justin
Ward).
In Proceedings of the 32nd International Conference on Machine
Learning **(ICML)**, 2015.

[arXiv]

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.

[pdf]

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.

[pdf]

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.

[pdf]

The All-or-Nothing Flow Problem in Directed Graphs with Symmetric
Demand Pairs (with Chandra Chekuri).
In Mathematical Programming Series B, December, 2014. Preliminary
version in **IPCO** 2014.

[pdf]

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

[pdf]

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.

[pdf]

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.

[arXiv]

Fast Clustering with Lower Bounds: No Customer too Far, No Shop
too Small (with Sariel Har-Peled and Benjamin Raichel).
*Manuscript*, 2013.

[arXiv]

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

[abstract]

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.

[pdf]

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.

[pdf]

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.

[pdf (extended abstract)]
[pdf (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.

[pdf]
[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.

[pdf]

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.

[pdf]

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.

[pdf]

Approximation algorithms for submodular
optimization and graph problems.
Computer Science Department, UIUC. August 2013.

[pdf]

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.