HIGHLIGHTS

- The event is endorsed by the European Alliance for Innovation, a leading community-based 
organisation devoted to the advancement of innovation in the field of ICT
- All accepted papers will be published by Springer and made available through SpringerLink Digital
Library, one of the world's largest scientific libraries
- Proceedings will be submitted for indexing by Google Scholar, ISI, EI Compendex, Scopus and many more

CALL FOR PAPERS

[Important dates]

Submission deadline: 20 July, 2012 (23:59 EDT) 
Author notification:  3 Sept, 2012 
Camera-ready submission: 17 Sept, 2012 
Conference dates: 3-5 December, 2012

[Scope]

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.

[Topics]

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.

[Publications]

The proceedings will be published by Springer (Lecture Notes in Computer Science).

[Paper submission]

The maximum length of the paper (excluding the optional appendix) is 12 pages.
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.

[Conference organising committees]

General Chair:
Guy Even, Israel

Local Chair:
Gabriel Scalosub, Israel

TPC Co-Chairs:
Guy Even, Israel
Dror Rawitz, Israel

Program Commitee Members:
Hanna Bast, Germany
Niv Buchbinder, Israel
Matthias Englert, UK
Pierre Fraigniaud, France
Chien-Chung Huang, Germany
Giuseppe Italiano, Italy
Ilan Newman, Israel
Liam Roditty, Israel
Christian Scheideler, Germany
Baruch Schieber, USA
Tami Tamir, Israel
Berthold Voecking, Germany
Peter Widmayer, Switzerland
Christos Zaroliagis, Greece
Anke van Zuylen,  Germany

Publicity Chair:
Moti Medina, Israel

Steering Committee:
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

Conference Coordinator:
Justina Senkus, EAI, Italy