Welcome to the ACO Program Home Page

This is the home page for the program in
Algorithms, Combinatorics and Optimization
at Carnegie Mellon University.

Carnegie Mellon University has taken the initiative of offering an interdisciplinary Ph.D program in Algorithms, Combinatorics and Optimization. It is administered jointly by the Tepper School of Business (Operations Research group), the Computer Science Department (Algorithms and Complexity group) and the Department of Mathematical Sciences (Discrete Mathematics group).

More About the Program	Admission/Application Information
Ph.D. Program Requirements	ACO Seminar

Faculty

Egon Balas	Polyhedral combinatorics, combinatorial optimization.
Guy Blelloch	Parallel algorithms and languages.
Avrim Blum	Machine learning, approximation and on-line algorithms, AI planning.
Manuel Blum	Complexity Theory, cryptography, program checking.
Thomas A. Bohman	Extremal Combinatorics.
Gerard Cornuéjols	Combinatorial optimization, graph theory, integer programming.
Alan Frieze	Average case analysis of algorithms, combinatorics.
Irina Gheorghiciuc	Combinatorics.
Anupam Gupta	Approximation algorithms, metric embeddings, network algorithms.
Mor Harchol-Balter	Queueing theory, stochastic modeling, probability theory, heavy-tailed workloads, Web servers, networking.
John Hooker	Operations research techniques in logic, artificial intelligence.
John Lafferty	Speech and natural language processing, statistical learning algorithms, information theory.
Bruce Maggs	Parallel algorithms and architectures, computer networks.
François Margot	Integer Linear Programming, Polyhedral Combinatorics, Enumeration Problems.
Gary Miller	Algorithm design, parallel algorithms, scientific computing.
Dhruv Mubayi	Extremal graph theory and Ramsey theory.
Ryan O'Donnell	Complexity theory, analysis of boolean functions, approximation hardness.
Javier Pena	Theory and algorithms for convex optimization, numerical analysis.
Oleg Pikhurko	Extremal graph theory and Ramsey theory.
R. Ravi	Approximation algorithms, combinatorial optimization, computational biology.
Steven Rudich	Complexity theory, cryptography, combinatorics.
Daniel Sleator	Data structures, algorithms, parsing.
Richard Statman	Theory of computation, symbolic computation.
Michael Trick	Computational integer and combinatorial optimization, applications in sports and the social sciences.
Willem Van Hoeve	Combinatorial optimization; constraint programming; mathematical programming; integration of constraint programming and mathematical programming.

Key:

Computer Science
Department

Tepper School of Business

Department of
Mathematical Sciences

Students

Barbara Anthony with Anupam Gupta	Combinatorial optimization and Graph theory.
Amitabh Basu with Gerard Cornuejols	Integer Programming, Metric Embeddings, Computational Geometry
Patrick Bennett
Prasad Chebolu with Alan Frieze	Graph theory, Combinatorics and Number theory.
Xi Chen
Latife Genc with John Hooker	Combinatorics, Algorithms and Optimization.
Vineet Goyal with R. Ravi	Approximation algorithms, Combinatorial optimization.
Samid Hoda
Pall Melsted with Alan Frieze	Graph theory and Algorithms.
Viswanath Nagarajan with R. Ravi	Approximation algorithms, Combinatorial Optimization, Routing and Scheduling.
David Offner with Oleg Pikhurkho	Extremal Graph Theory
Michael Picollelli with Thomas Bohman	Combinatorics and Graph theory
Andrea Qualizza
Anureet Saxena	Combinatrial optimisation, Graph algorithms
Seyed Amin Sayedi Roshkar
Mohit Singh with R. Ravi	Approximation algorithms, Randomized algorithms and Graph theory.
Christopher Wallace with Egon Balas	Algebra, Algorithms and Complexity, Combinatorics, Graph theory, Number theory.
Karl Wimmer with Ryan O'Donnell	Graph theory, Combinatorics, Algebra, and Number theory.
Zelealem Yilma with Oleg Pikhurkho	Extremal Graph Theory