Topics:
- Algorithmic Game Theory,
- Approximation Algorithms,
- Combinatorial Optimization,
- Combinatorics in Computer Science,
- Computational Biology,
- Computational Complexity,
- Computational Geometry,
- Cryptography,
- Data Structures,
- Design and Analysis of Algorithms,
- Machine Learning,
- Parallel, Distributed and External Memory Computing,
- Randomness in Computation,
- Quantum Computing.
PC members:
- Albert Atserias, Universitat Politècnica de Catalunya, Barcelona, Spain
- Andrej Brodnik, University of Ljubljana, Ljubljana, Slovenia
- Harry Buhrman, CWI, Amsterdam, The Netherlands
- Siu-Wing Cheng, The Hong Kong University of Science and Technology, Hongkong, China
- Amin Coja-Oghlan, University of Warwick, UK
- Benjamin Doerr, Max Planck Institute for Informatics in Saarbrücken, Germany
- Fedor Fomin, University of Bergen, Bergen, Norway
- Moritz Hardt, IBM Almaden Research, San Jose, USA
- Nicole Immorlica, Northwestern University, Chicago, USA
- Valerie King, University of Victoria, Victoria, Canada
- Elias Koutsoupias, University of Athens, Athens, Greece
- Piotr Krysta, University of Liverpool, UK
- Amit Kumar, IIT Delhi, Delhi, India
- Stefano Leonardi, Sapienza University of Rome, Italy
- Pinyan Lu, Microsoft Research Asia, Shanghai, China
- Kaz Makino, University of Tokyo, Tokyo, Japan
- Kurt Mehlhorn, Max Planck Institute for Informatics in Saarbrücken, Germany (chair)
- Julian Mestre, The University of Sydney, Sydney, Australia
- Rasmus Pagh, IT University of Copenhagen, Copenhagen, Denmark
- Rafael Pass, Cornell University, USA
- Harald Räcke, TU München, München, Germany
- Piotr Sankowski, Warsaw University, Warsaw, Poland
- Saket Saurabh, Institute of Mathematical Science, Chennai, India
- Angelika Steger, ETH Zürich, Zürich, Switzerland
- Suresh Venkatsubramanian, University of Utah, Salt Lake City, USA
