Professor Harold (Hal) Gabow is Chair of the Program
Committee for SODA 2007,
the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. This symposium
focuses on research topics related to efficient algorithms and data structures
for discrete problems. In addition to the design of such methods and structures,
the scope also includes their use, performance analysis, and the mathematical
problems related to their development or limitations.
The conference will include approximately 130 contributed papers. In addition,
the conference will have several plenary speakers:
(Department of Mathematics, Princeton University),
co-author of the recent proof of the Strong Perfect Graph Conjecture
(a 40-year conundrum in the world of graph theory);
Philippe Flajolet (INRIA),
world-authority on the mathematics of analysis of algorithms;
and Monika Henzinger (Google, Inc.),
a Google Research Director specializing in web information retrieval.
SODA 2007 is sponsored jointly by the
ACM Special Interest Group on Algorithms and Computation Theory
SIAM Activity Group on Discrete Mathematics.
The conference will be held January 7-9, 2007 in New Orleans.