**Susanne Albers** (TU München) *design and analysis of algorithms (in particular online and approximation algorithms), algorithmic game theory, algorithm engineering*

**Stephen Alstrup** (University of Copenhagen) *algorithms, big data, data structures, graph theory*

**Lars Arge** (Aarhus University) *computational geometry, data structures, I/O-efficient and cache-oblivious algorithms, algorithm engineering*

**Yossi Azar** (Tel Aviv University) *online algorithms, approximations algorithms, resource allocation, algorithmic game theory*

**Nikhil Bansal** (Eindhoven University of Technology) *approximation algorithms, online algorithms, machine learning*

**Hannah Bast** (University of Freiburg) *information retrieval, route planning, applied algorithmics*

**Petra Berenbrink** (University of Hamburg) *parallel algorithms and randomized processes*

**Jarosław Byrka** (University of Wrocław) *LP-based approximation algorithm, facility location, network design*

**Sergio Cabello** (University of Ljubljana)*computational geometry, computational topology, graph algorithms*

**Ioannis Caragiannis** (Aarhus University) *design and analysis of algorithms, approximation and online algorithms, algorithmic game theory, computational social choice*

**Keren Censor-Hillel** (Technion) *distributed computing, especially probabilistic algorithms and lower bounds, and theory of computing in general*

**Vincent Cohen-Addad **(Google Research, Zürich) *design of algorithms for clustering and network design problems*

**Graham Cormode **(University of Warwick) *streaming algorithms, data summarization, privacy and anonymization*

**Marek Cygan** (University of Warsaw) *fixed parameter tractability, approximation algorithms, graph algorithms*

**Artur Czumaj** (University of Warwick) *algorithms and data structures, randomized, approximation and distributed algorithms, graph algorithms, algorithmic game theory, and discrete mathematics*

**Ilias Diakonikolas** (UW Madison) *algorithms for machine learning, statistics, computational economics*

**Anne Driemel** (University of Bonn) *algorithms and data structures, discrete and computational geometry*

**Guy Even** (Tel-Aviv University) *approximation algorithms, online algorithms, algorithmic issues in networks*

**Andreas Emil Feldmann** (Charles University) *parameterized approximation algorithms*

**Amos Fiat **(Tel-Aviv University) *online algorithms, algorithmic game theory, data structures*

**Fedor V. Fomin** (University of Bergen) *graph algorithms, parameterized complexity, kernelization*

**Pierre Fraigniaud** (CNRS and University Paris Diderot) *distributed computing, network algorithms*

**Mohsen Ghaffari** (ETH Zürich) *distributed algorithms, parallel algorithms, and network algorithms*

**Inge Li Gørtz** (Technical University of Denmark) * pattern matching, data compression, compressed computation, and approximation algorithms*

**Fabrizio Grandoni** (IDSIA) *approximation algorithms, network design, combinatorial optimization*

**Martin Grohe** (RWTH Aachen) *algorithmic graph structure theory, fixed-parameter tractability, logic, database theory*

**Magnus M. Halldorsson** (Reykjavik University) *design and analysis of algorithms, and problems in wireless communication*

**Monika Henzinger** (University of Vienna) *efficient algorithms and data structures, specifically dynamic graph algorithms, algorithmic game theory*

**Thore Husfeldt** (Lund University and IT University of Copenhagen) *algorithms, combinatorial optimization, and exponential time algorithms*

**Giuseppe F. Italiano** (LUISS University) *graph algorithms, massive data sets, string algorithms*

**Haim Kaplan** (Tel-Aviv University) *design and analysis of data structures and algorithms*

**Michael Kapralov** (EPFL) *theoretical foundations of big data analysis, sublinear algorithms, streaming, sketching, sparse recovery and Fourier sampling*

**Elias Koutsoupias** (University of Oxford) *algorithmic aspects of game theory, economics and networks, online algorithms*

**Robert Krauthgamer** (The Weizmann Institute of Science) *data analysis and massive data sets, combinatorial optimization and approximation algorithms, embeddings of finite metrics*

**Stefano Leonardi** (University of Rome “Sapienza”) *online and approximation algorithms, algorithmic game theory and auction design, web algorithmics and graph mining*

**Yishay Mansour** (Tel-Aviv University) *machine learning, algorithmic game theory, communication networks, online algorithms, theory of computation*

**Alberto Marchetti-Spaccamela** (University of Rome “Sapienza”) *design and analysis of algorithms (mainly, approximation, on-line and dynamic algorithms) and their applications to scheduling in real time systems, networks of computers, bioinformatics and healthcare*

**Claire Mathieu** (École Normale Supérieure) *approximation algorithms for hard problems in combinatorial optimization, probabilistic models and analysis*

**Aleksander Mądry** (MIT) *graph algorithms, fast optimization methods, coping with uncertainty in optimization*

**Nicole Megow** (University of Bremen) *combinatorial optimization, discrete optimization, efficient algorithms, approximation algorithms, scheduling, resource allocation, packing, network design, routing, uncertainty models*

**Kurt Mehlhorn** (Max Planck Institute for Computer Science) *combinatorial optimization, data structures, algorithmic game theory, geometric computing, computer algebra, software libraries, software engineering*

**Ulrich Meyer** (Goethe University Frankfurt am Main) *graph algorithms, randomization, algorithms and data structures for advanced models of computation*

**Friedhelm Meyer auf der Heide **(University of Paderborn) *distributed algorithms, local network algorithms, coping with dynamics in networks*

**Danupon Nanongkai** (KTH, Sweden) *graph algorithms and complexity*

**Seffi Naor** (Technion) *algorithms and data structures*

**Rasmus Pagh** (IT University of Copenhagen) *randomized algorithms and data structures for big data, parallel and distributed computation*

**Merav Parter** (The Weizmann Institute of Science) *fault tolerant graph structures, spanners, theory of distributed systems and its synergy with cryptography*

**Mike Paterson** (University of Warwick) *optimal algorithms, geometry, parity and mean payoff games, online algorithms*

**Yuval Rabani** (Hebrew University) *theory of combinatorial algorithms and discrete optimization*

**Harald Räcke** (TU München) *graph partitioning, online algorithms, randomized algorithms*

**Eva Rotenberg** (Technical University of Denmark) *dynamic graph algorithms*

**Adi Rosén** (CNRS and Université Paris Diderot) *online algorithms, streaming algorithms, algorithmic problems in communication networks, communication complexity*

**Ronitt Rubinfeld **(MIT and Tel-Aviv University) *sub-linear time algorithms, property testing, randomized algorithms, approximation algorithms*

**Peter Sanders** (Karlsruhe Institute of Technology) *algorithm theory and algorithm engineering*

**Piotr Sankowski** (University of Warsaw) *algebraic algorithms, dynamic algorithms, stochastic algorithms, planar graph algorithms, approximation algorithms, algorithmic game theory, algorithmic engineering*

**Christian Sohler **(University of Cologne) *foundations of algorithms for big data, streaming algorithms, property testing, computational geometry*

**Jukka Suomela** (Aalto University) *distributed computing, local algorithms and local graphs*

**Ola Svensson** (EPFL) *approximation algorithms, combinatorial optimization, hardness of approximation*

**Mikkel ****T****horup** (University of Copenhagen) *algorithms and data structures*

**Luca Trevisan** (Bocconi University) *computational complexity theory, algorithms, and topics at the intersection of theoretical computer science and pure mathematics*

**Volker Turau** (Hamburg University of Technology) *distributed computing, graph algorithms, self-stabilizing algorithms*

**László Végh** (London School of Economics) *fundamental questions in algorithms and optimisation: exact and approximation algorithms for problems related to network design, flows, matchings, and equilibrium computation, with a particular focus on strongly polynomial computability*

**Jens Vygen** (University of Bonn) *combinatorial optimization; traveling salesman problem and vehicle routing*

**Dorothea Wagner** (Karlsruhe Institute of Technology) *algorithm engineering, graph algorithms, transport optimization, social network analysis, network visualization*

**Peter Widmayer **(ETHZ) *algorithms for discrete problems with applications, uncertainty in optimization*