38. ICALP 2011: Zurich, Switzerland - Part I

Network Design Problems

Quantum Computing

Graph Algorithms

Games, Approximation Schemes, Smoothed Analysis

Online Algorithms

Data Structures, Distributed Computing

Complexity, Randomness

Submodular Optimization, Matroids

Cryptography, Learning

Fixed Parameter Tractability

Hardness of Approximation

Counting, Testing


Proof Complexity

Sorting, Matchings, Paths

Constraint Satisfaction, Algebraic Complexity

Steiner Problems, Clustering

maintained by Schloss Dagstuhl LZI at University of Trier