32nd International Symposium on Theoretical Aspects of Computer Science

March 4 - 7, 2015, Garching near München, Germany

Submission Deadline: Sep 21, 2014 (23:59:59 GMT/UTC)


Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include (but are not limited to):

  • algorithms and data structures, including: parallel, distributed, approximation, and randomized algorithms, computational geometry, cryptography, algorithmic learning theory, algorithmic game theory, analysis of algorithms;
  • automata and formal languages;
  • computational complexity, parameterized complexity, randomness in computation;
  • logic in computer science, including: semantics, specification and verification, rewriting and deduction;
  • current challenges, for example: natural computing, quantum computing, mobile and net computing.



  • Andris Ambainis, FPM, U Riga
  • Hagit Attiya, CS, Technion, Haifa
  • Johannes Blömer, CS, U Paderborn
  • Mikołaj Bojańczyk, II, U Warsaw
  • Tomáš Brázdil, Masaryk U, Brno
  • Niv Buchbinder, SOR, Tel Aviv U
  • Anuj Dawar, CL, U Cambridge
  • Adrian Dumitrescu, CS, U Wisconsin-Milwaukee
  • Matthias Englert, DIMAP/DCS, U Warwick
  • Funda Ergun, SoIC, Indiana U
  • Fedor Fomin, IN, U Bergen
  • Tobias Friedrich, FMI, FSU Jena
  • Christian Glaßer, I1, U Würzburg
  • Etienne Grandjean, GREYC, Caen
  • Tomasz Jurdzinski, U Wroclaw
  • Manfred Kufleitner, FMI, U Stuttgart
  • Jerome Leroux, CNRS, LaBRI, Bordeaux
  • Ernst W. Mayr, TUM, München (co-chair)
  • Peter Bro Miltersen, CS, U Aarhus
  • Nicolas Ollinger, LIFO, Orléans (co-chair)
  • Sylvain Perifel, LIAFA, Paris 7
  • Jayalal Sarma, IIT, Madras
  • Nicolas Schabanel, CNRS, LIAFA, Paris 7
  • Lutz Schröder, FAU Erlangen-Nürnberg
  • Dimitrios M. Thilikos, CNRS, LIRMM, Montpellier
  • Gerhard Woeginger, TUE, Eindhoven



  • Sanjeev Arora, CS, Princeton
  • Manuel Bodirsky, TU Dresden
  • Peter Sanders, KIT, Karlsruhe



  • Felix Brandt, TUM, München: Computational Social Choice
  • tba: Algorithmic Game Theory



Submission website opens: Jun 22, 2014
Submission deadline: Sep 21, 2014 (23:59:59 GMT/UTC)
Rebuttal period: Nov 15 - 17, 2014
Notification: Dec 5, 2014
Final version due: Jan 7, 2015
Symposium: Mar 4 - 7, 2015



Authors are invited to submit a draft of a full paper with at most 12 pages (excluding the references section). The usage of pdflatex and the LIPIcs style file (see below) are mandatory; no changes to font size, page geometry etc. are permitted.  Submissions not in the correct format or submitted after the deadline will not be considered.

The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be put into an appendix, to be read by the program committee members at their discretion.

Simultaneous submission to other conferences with published proceedings or to journals is not allowed. PC members are excluded from submitting. As a novelty for STACS, there will also be a rebuttal period for authors. Authors will receive the reviews of their submissions (via EasyChair) on Nov 14/15 and have three days (Nov 15 - 17) to submit rebuttals (via EasyChair). These rebuttals become part of the PC meeting, but entail no specific responses.

The submission site, which opens on Jun 22, 2014, is



LIPIcs homepage:


CONTACT INFORMATION (for general information)
This email address is being protected from spambots. You need JavaScript enabled to view it. (for information regarding paper submission)