ICALP 2019 will take place at the Conference & Cultural Center of the University of Patras.

Important Dates

  • Submission deadline: Monday 18 February 2019, 23:59 AoE
  • Notification: Friday 19 April 2019
  • Workshop submission deadline: Saturday 15 December 2018
  • Final manuscript due: Monday 29 April 2019
  • Early registration deadline: Thursday 30 May 2019
  • Workshops: 8 July 2019
  • Main conference:  9-12 July 2019



Authors are invited to submit an extended abstract of no more than 12 pages, excluding references presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style and submitted via Easychair to the appropriate track of the conference, using the following link:

The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit.

No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed.

Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC.

Best Paper Awards

As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission.


Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are:

Track A: Algorithms, complexity and games

  • Approximation Algorithms
  • Combinatorial Optimization
  • Combinatorics in Computer Science
  • Computational Biology
  • Computational Complexity
  • Computational Geometry
  • Cryptography
  • Data Structures
  • Design and Analysis of Algorithms
  • Foundations of Algorithmic Game Theory
  • Machine Learning
  • Parallel, Distributed and External Memory Computing
  • Quantum Computing
  • Randomness in Computation

Track B: Automata, logic, semantics, and theory of programming

  • Algebraic and Categorical Models
  • Automata, Games, and Formal Languages
  • Emerging and Non-standard Models of Computation
  • Databases, Semi-Structured Data and Finite Model Theory
  • Logic in Computer Science, Theorem Proving and Model Checking
  • Models of Concurrent, Distributed, and Mobile Systems
  • Models of Reactive, Hybrid and Stochastic Systems
  • Principles and Semantics of Programming Languages
  • Program Analysis and Transformation
  • Specification, Verification and Synthesis
  • Type Systems and Theory, Typed Calculi

Track C: Foundations of networks and multi-agent systems: models, algorithms and information management

  • Algorithmic Aspects of Networks and Networking
  • Algorithmic Game Theory
  • Formal Methods for Network Information Management
  • Foundations of Privacy, Trust and Reputation in Networks
  • Foundations of Complex Networks
  • Message-Passing Models of Distributed Computing
  • Mobile and Wireless Networks and Communication
  • Network Economics and Incentive-Based Computing Related to Networks
  • Networks of Low Capability Devices
  • Network Mining and Analysis
  • Overlay Networks and P2P Systems
  • Specification, Semantics, Synchronization of Networked Systems
  • Theory of Security in Networks

Focus of track C: The aim for Track C is to be the leading venue for theory papers motivated by networking applications, and/or proposing theoretical results relevant to networking, certified analytically.


ICALP proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. This is a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge.

ICALP 2019 Proceedings Chairs

Ioannis Chatzigiannakis (Sapienza University of Rome, Italy)
Emanuela Merelli (University of Camerino, Italy)

Program Committees

Track A: Algorithms, complexity and games

Yossi Azar (Tel-Aviv University)
Sayan Bhattacharya (University of Warwick)
Aaron Bernstein (Rutgers University)
Jarosław Byrka (University of Wroclaw)
Karl Bringmann (Max-Planck-Institut für Informatik, Saarbrücken)
Gerth Stølting Brodal (Aarhus University)
Parinya Chalermsook (Aalto University)
Paul Duetting (London School of Economics)
Uriel Feige (Weizmann Institute, Rehovot)
Claudio Gentile (INRIA, Lille and Google Research, New York)
Mohsen Ghaffari (ETH Zurich)
Antoine Joux (IMJ-PRG, Sorbonne)
Thomas Kesselheim (University of Bonn)
Michal Koucký (Charles University of Prague)
Alexander Kulikov (Steklov Institute of Mathematics, St. Petersburg)
Sophie Laplante (Université Paris Diderot)
François Le Gall (Kyoto University)
Stefano Leonardi (Sapienza University of Rome, chair)
Vangelis Markakis (Athens University of Economics and Business)
Renato Paes-Leme (Google Research, New York)
Marcin Pilipczuk (University of Warsaw)
MS Ramanujan (University of Warwick)
Adi Rosén (CNRS and U. Paris Diderot)
Eva Rotenberg (Technical University of Denmark)
Rahul Santhanam (University of Oxford)
Alessandra Scafuro (North Carolina State University)
Sandeep Sen (IIT Delhi)
Francesco Silvestri (University of Padua)
Paul Spirakis (U. Liverpool and U. Patras)
Leen Stougie (CWI, Amsterdam)
Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai)
Chaitanya Swamy (University of Waterloo)
Stefan Szeider (Technical University of Vienna)
Rico Zenklusen (ETH Zurich)

Track B: Automata, logic, semantics, and theory of programming

Parosh Abdulla (Uppsala University)
Christel Baier (TU Dresden, chair)
Krishnendu Chatterjee (IST)
Thomas Colcombet (CNRS and U. Paris Diderot)
Laure Daviaud (University Warwick)
Pedro D’Argenio (Universidad Nacional de Córdoba)
Josee Desharnais (Université Laval)
Mariangiola Dezani (Università di Torino)
Amina Doumane (ENS Lyon)
Rocco de Nicola (IMT Lucca)
Nathanaël Fijalkow (CNRS, U. Bordeaux)
Wan Fokkink (Vrije Universiteit Amsterdam)
Christoph Haase (University of Oxford)
Ichiro Hasuo (National Institute of Informatics, Tokyo)
Rahda Jagadeesan (De Paul University Chicago)
Markus Lohrey (Universität Siegen)
Radu Mardare (Aarlborg University)
Matteo Mio (ENS Lyon)
Madhusudan Parthasarathy (University of Illinois)
Mickael Randour (Université de Mons)
Sven Schewe (University of Liverpool)
Lutz Schröder (Universität Erlangen-Nürnberg)
Helmut Seidl (TU München)
Michal Skrzypczak (University of Warsaw)
Pawel Sobocinski (University of Southampton)
Christine Tasson (Université Paris Diderot)

Track C: Foundations of networks and multi-agent systems: models, algorithms and information management

Amotz Bar-Noy (CUNY)
Vittorio Bilo' (University of Salento)
Bogdan S. Chlebus (University of Colorado Denver)
Xiaotie Deng (Peking University, Beijing)
Paola Flocchini (University of Ottawa, chair)
Leszek Gasieniec (University of Liverpool)
Tobias Harks (University of Augsburg)
Magnús Halldórsson (Reykjavik University)
Christos Kaklamanis (University of Patras)
Ralf Klasing (CNRS and University of Bordeaux)
Max Klimm (Humboldt Universität zu Berlin)
Ravi Kumar (Google Mountain View)
Silvio Lattanzi (Google Zurich)
Toshimitsu Masuzawa (University of Osaka)
Ruta Mehta (U. Illinois Urbana-Champaign)
Olga Nikolaevna Goussevskaia (Federal University of Minas Gerais)
Ariel Orda (Technion)
Gopal Pandurangan (University of Houston)
Pino Persiano (University of Salerno)
Maria Potop-Butucaru (U. Paris VI)
Giuseppe Prencipe (University of Pisa)
Andrea Richa (Arizona State U.)
Patrick Thiran (EPFL)
Nicola Santoro (Carleton University)
Jukka Suomela (Aalto University)
Peter Widmayer (ETH Zurich)