Friday, September 17, 2010

TAPAS 2011, Call for Papers


Call for Papers

TAPAS 2011
Theory and Practice of Algorithms in Computer Systems

April 18-20, 2011, Rome, Italy


In the light of continuously increasing interaction between communication
and computing, there arise a number of interesting, and difficult
algorithmic issues in diverse areas including coverage, mobility, routing,
cooperation, capacity planning, scheduling, and power control. The aim of
TAPAS is to provide a forum for presentation of original research in the
design, implementation and evaluation of algorithms. TAPAS is dedicated
to the use, design and evaluation of algorithms for combinatorial
optimization problems (either efficient optimal or efficient approximation
algorithms) and to real-world applications, engineering and experimental
analysis of algorithms. It aims, in particular, at fostering the
cooperation among researchers in computer science, networking, discrete
mathematics, mathematical programming and operations research.


The conference will focus on the design, engineering, theoretical and
experimental performance analysis of algorithms for problems arising in
different areas of computation. We invite submissions that present
significant case studies in theoretical and experimental analysis and
evaluation of algorithms with specific areas including communications
networks, combinatorial optimization and approximation, parallel and
distributed computing, computer systems and architecture, economics, game
theory, social networks and the world wide web. Novel uses of discrete
algorithms in all disciplines and the evaluation of algorithms for
realistic environments are particularly welcome.

Submitted papers will consider a succinct summary of the problem and of
the results obtained (emphasizing the significance and potential impact
of the research), and a clear comparison with related work, all accessible
to non-specialist readers. The remainder of the extended abstract should
provide sufficient detail to allow the program committee to evaluate the
validity, quality, and relevance of the contribution.

* The maximum length of the paper (excluding the optional appendix) is 12

* Proofs and any other material omitted due to space constraints must be
placed in an appendix to be read by the program committee members at
their discretion.

The proceeding will be published by Springer (Lecture Notes in Computer


* Paper submission due: October 24, 2010
* Notification of acceptance: December 17, 2010


Alberto Marchetti-Spaccamela
(Sapienza University of Rome, Italy)

Michael Segal
(Ben-Gurion University of the Negev, Israel)


Stefano Basagni (Northeastern University, USA)
Alex Kesselman (Google Inc., USA)
Peng-Jun Wan (Illinois Institute of Technology, USA)
Peter Widmayer (ETH, Switzerland)
Stefan Funke (Universität Stuttgart, Germany)
Alessandro Mei (Sapienza University of Rome, Italy)
Leen Stougie (VU University, Amsterdam, Netherlands)
Alon Efrat (University of Arizona, USA)
Jack Snoeyink (University of North Carolina at Chapel Hill, USA)
Andrei Broder (Yahoo Inc., USA)
Gerhard Woeginger (Eindhoven University of Technology, Netherlands)
Michael Juenger (Universität Köln, Germany)
Hanan Shpungin (University of Calgary, Canada)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), co-Chair
Michael Segal (Ben-Gurion University of the Negev, Israel), co-Chair


David Peleg (Weizmann Institute, Israel)
Paul Spirakis (University of Patras, Greece))
Imrich Chlamtac (University of Trento, Italy)
Pankaj Agarwal (Duke University, USA)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy)
Michael Segal (BGU, Israel)
Roger Wattenhofer (ETH, Switzerland)