A list of papers accepted for presentation at SODA06 is now available here.

A limited number of student travel grants are available. Please click HERE for more information.

About the Symposium

If applying for a visa, please remember to allow ample time for the application process. See “Conference Information” for a link to the National Academies who can provide further information.

The 8th Workshop on Algorithm Engineering and Experiments (ALENEX06) and the 3rd Workshop on Analytic Algorithmics and Combinatorics (ANALCO06) will be held immediately preceding the conference, on January 21, at the same location.


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. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.


Themes and application areas include, but are not limited to, the following topics:

Combinatorics and other aspects of Discrete Mathematics such as:

  • Algebra
  • Combinatorial Structures
  • Discrete Optimization
  • Discrete Probability
  • Game Theory
  • Graph Drawing
  • Graphs and Networks
  • Mathematical Programming
  • Number Theory
  • Random Structures
  • Topological Problems

other aspects of Computer Science such as:

  • Combinatorial Scientific Computing
  • Communication Networks
  • Computational Geometry
  • Computer Graphics and Computer Vision
  • Computer Systems
  • Cryptography and Security
  • Data Compression
  • Databases and Information Retrieval
  • Distributed and Parallel Computing
  • Experimental Algorithmics
  • Internet Algorithmics
  • Machine Learning
  • On-line Problems
  • Quantum Computing
  • Pattern Matching
  • Robotics
  • Scheduling and Resource Allocation Problems
  • Symbolic Computation

and applications in the Sciences and Business such as: Biology, Physics, Manufacturing and Finance.


Jointly sponsored by ACM Special Interest Group on Algorithms and Computation Theory and SIAM Activity Group on Discrete Mathematics.

Program Committee

Cliff Stein (Chair), Columbia University
Dimitris Achlioptas, Microsoft Research
Yossi Azar, Tel Aviv University, Israel
Graham Brightwell, London School of Economics, United Kingdom
Joseph Cheriyan, University of Waterloo, Canada
Jens Gustedt, LORIA & INRIA Lorraine, France
Pavol Hell, Simon Fraser University, Canada
John Iacono, Polytechnic University
Stephen Kobourov, University of Arizona
Stavros Kolliopoulos, University of Athens, Greece
Richard Ladner, University of Washington
Moshe Lewenstein, Bar-Ilan University, Israel
Mohammad Mahdian, Microsoft Research
Greg Plaxton, University of Texas, Austin
Bruce Reed, McGill University, Canada
Ronitt Rubinfeld, Massachusetts Institute of Technology
Alexander Russell, University of Connecticut
Jay Sethuraman, Columbia University
Martin Skutella, University of Dortmund, Germany
Angelika Steger, ETH Zurich, Switzerland
Shang-Hua Teng, Boston University/Akamai
Peter Winkler, Dartmouth College
Neal Young, University of California, Riverside



Created 5/6/05
DHTML Menus by http://www.milonic.com/