Program Committee

Glencora Borradaile, Oregon State University, USA
Shuchi Chawla, University of Wisconsin, Madison, USA
Edith Cohen, AT&T Labs-Research, USA
Artur Czumaj, University of Warwick, United Kingdom
David Eppstein, University of California, Irvine, USA
Vitaly Feldman, IBM Almaden, USA
Anna Gilbert, University of Michigan, USA
Mordecai Golin, Hong Kong University of Science and Technology, Hong Kong
Navin Goyal, Microsoft Research, India
Catherine Greenhill, University of New South Wales, Australia
Sudipto Guha, University of Pennsylvania, USA
Anupam Gupta, Carnegie Mellon University, USA
Sean Hallgren, Pennsylvania State University, USA
Piotr Indyk, Massachusetts Institute of Technology, USA
Satoru Iwata, Kyoto University, Japan
Kamal Jain, Microsoft Research, Redmond, USA
Satyen Kale, Yahoo Research, USA
David Karger, Massachusetts Institute of Technology, USA
Jonathan Katz, University of Maryland, USA
Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
David Kempe, University of Southern California, USA
Valerie King, University of Victoria, Canada
Michael Molloy, University of Toronto, Canada
Seffi Naor, Technion, Israel
Mihai Patrascu, AT&T Labs-Research, USA
Harald Räcke, University of Warwick, United Kingdom
Prasad Raghavendra, Microsoft Research, New England, USA
Dana Randall (chair), Georgia Institute of Technology, USA
David Shmoys, Cornell University, USA
Ileana Streinu, Smith College, USA
Description

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 agency information will be posted here when available.
Themes

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

Aspects of Combinatorics and Discrete Mathematics, such as:

* Algebra
* Combinatorial Structures
* Discrete Optimization
* Discrete Probability
* Finite Metric Spaces
* Graph Theory
* Mathematical Programming
* Number Theory
* Random Structures
* Topological Problems

Aspects of Computer Science, such as:

* Algorithm Analysis and Complexity
* Algorithmic Game Theory
* Algorithmic Mechanism Design
* Combinatorial Scientific Computing
* Communication Networks
* Computational Geometry
* Computer Graphics and Computer Vision
* Computer Systems
* Cryptography and Computer Security
* Data Compression
* Data Structures
* Databases and Information Retrieval
* Distributed and Parallel Computing
* Experimental Algorithmics
* Graph Algorithms
* Internet and Network Algorithms
* Machine Learning
* On-line Problems
* Quantum Computing
* Pattern Matching
* Robotics
* Scheduling and Resource Allocation Problems
* Symbolic Computation

Applications in the Sciences and Business such as:

* Bioinformatics
* Economics
* Finance
* Manufacturing
* Physics
* Sociology

Important Deadlines

SUBMISSION DEADLINES
July 2, 2010, 4:59 PM EDT - Paper Registration Deadline
July 7, 2010, 4:59 PM EDT - Final Submission Deadline

PRE-REGISTRATION DEADLINE
December 20, 2010

HOTEL RESERVATION DEADLINE
December 20, 2010