(apologies for duplicates)
************************************************************************
STACS 2015 CALL FOR PAPERS
32nd International Symposium on Theoretical Aspects of Computer Science
March 4 - 7, 2015, Garching near Munich, Germany
Submission Deadline: Sep 21, 2014 (23:59:59 GMT/UTC)
http://www14.in.tum.de/STACS2015
************************************************************************
SCOPE
*****
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.
PROGRAM COMMITTEE
*****************
Andris Ambainis, FPM, U Riga
Hagit Attiya, CS, Technion, Haifa
Johannes Blömer, CS, U Paderborn
Mikolaj Bojanczyk, II, U Warsaw
Tomás 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 Wrozlaw
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
INVITED SPEAKERS
****************
Sanjeev Arora, CS, Princeton
Manuel Bodirsky, CNRS, LIX, Palaiseau
Peter Sanders, KIT, Karlsruhe
TUTORIAL
********
Felix Brandt, TUM, Munich: Computational Social Choice
tba: Algorithmic Game Theory
IMPORTANT DATES
***************
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
SUBMISSIONS
***********
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
https://www.easychair.org/conferences/?conf=stacs2015
LIPICS STYLE FILES
******************
LIPIcs homepage: http://www.dagstuhl.de/en/publications/lipics
tar ball: http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz
CONTACT INFORMATION
*******************
http://www14.in.tum.de/STACS2015 (for general information)
pc-chairs-stacs2015@easychair.org (for information regarding paper
submission)
_______________________________________________________________________
Prof. Ernst W. Mayr Tel.: +49-89-289-17704
Lehrstuhl für Effiziente Algorithmen Sekr.: +49-89-289-17706
Fakultät für Informatik, I14 Fax: +49-89-289-17707
TU München E-Mail: mayr@in.tum.de
Boltzmannstraße 3
85748 Garching Raum: MI 03.09.052
Germany URL: http://www.in.tum.de/~mayr/
_______________________________________________________________________
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************