ACO Research Program
Research areas being investigated by faculty of the
ACO Program include
such topics as
- structural and topological graph theory
- coloring problems (including the
- paths, cycles and flows in graphs
- probabilistic methods in combinatorics
- probability on graphs
- algebraic combinatorics
- computational algebra and geometry
- distributed computing
- algorithm complexity
- the design and analysis of algorithms
- approximation algorithms
- algorithmic problems in coding theory
- fault-tolerant computing
- voting theory
- airline crew and fleet scheduling
- parallel computation
- interior point methods in mathematical optimization
- the geometry of convex bodies
- other related areas
For more information, you may look at the personal Web pages
of ACO affiliated faculty members.
Seminars and Colloquia
The ACO Program sponsors a
which brings visiting speakers
to the campus,
and the participating departments hold weekly
research seminars in areas such as
Theory of Computing.
The individual departments also host a number
of visiting faculty members each year in subjects related to the program.
Please have a look at the
ACO-related events page
for more information about past and upcoming events.
. . . . . . . . . . . . . .
This page is maintained by the
School of Mathematics,
Georgia Institute of Technology.
Last modified: October 30, 2011
Georgia Tech Disclaimer:
Notwithstanding any language to the contrary, nothing contained
herein constitutes nor is intended to constitute an offer, inducement,
promise, or contract of any kind. The data contained herein is for
informational purposes only and is not represented to be error free.
Any links to non-Georgia Tech information are provided as a courtesy.
They are not intended to nor do they constitute an endorsement by the
Georgia Institute of Technology of the linked materials.