ACM-SIAM Symposium on Discrete Algorithms (SODA10)

January 17-19, 2010
Hyatt Regency Austin
Austin, Texas

The twelfth Workshop on Algorithm Engineering and Experiments (ALENEX10) and the seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO10) will be held immediately preceding the conference, on January 16, at the same location.

SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.


Congratulations to the following award winners!

Best Student Paper Awards
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs
Aaron Bernstein

An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling
Sungjin Im and Benjamin Moseley

Best Paper Award
An O(log n /log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi

Student Travel Support is available.

The program schedule is available.

Program Committee

Gagan Aggarwal, Google Inc.
Matthew Andrews, Bell Laboratories
Lars Arge, Aarhus University, Denmark
Moses Charikar (chair), Princeton University
Esther Ezra, Duke University
Lisa K. Fleischer, Dartmouth College
Parikshit Gopalan, Microsoft Research, Silicon Valley
Venkatesan Guruswami, University of Washington and Carnegie Mellon University
Thore Husfeldt, ITU Copenhagen, Denmark, and Lund University, Sweden
Ravi Kannan, Microsoft Research, India
Sanjeev Khanna, University of Pennsylvania
Robert Krauthgamer, Weizmann Institute of Science, Israel
Eyal Lubetzky, Microsoft Research, Redmond
Andrew McGregor, University of Massachusetts, Amherst
Cris Moore, University of New Mexico and Santa Fe Institute
Rina Panigrahy, Microsoft Research, Silicon Valley
Kirk Pruhs, University of Pittsburgh
Rajmohan Rajaraman, Northeastern University
Sofya Rashkhodnikova, Pennsylvania State University
Asaf Shapira, Georgia Institute of Technology
Mohit Singh, Microsoft Research, New England
Daniel Stefankovic, University of Rochester
Maxim Sviridenko, IBM T.J. Watson Research Center
Wojciech Szpankowski, Purdue University
Kavitha Telikepalli, Indian Institute of Science, India
Kasturi Varadarajan, The University of Iowa
Suresh Venkatasubramanian, University of Utah
Jan Vondrak, IBM Almaden Research Center
Peter Winkler, Dartmouth College


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.

Funding Agency

Funding agencies will be listed here when available.


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

Aspects of Combinatorics and Discrete Mathematics, such as:

Aspects of Computer Science, such as:

Applications in the Sciences and Business such as:

Important Deadlines

June 29, 2009, 4:59 PM EDT - Paper Registration Deadline
July 6, 2009, 4:59 PM EDT - Final Submission Deadline

December 14, 2009

December 14, 2009

Donate · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube linkedin google+