TAPAS: Theory and Practice of Algorithms in (Computer) Systems



Past:   Proceedings on DBLP

Future:  Post a CFP for 2013 or later   |   Invite the Organizers Email


All CFPs on WikiCFP

Event When Where Deadline
TAPAS 2012 2nd International Conference on Theory and Practice of Algorithms in (Computer) Systems
Dec 3, 2012 - Dec 5, 2012 Kibbutz Ein Gedi, Dead Sea, Israel Jul 29, 2012

Present CFP : 2012

2nd International Conference on Theory and Practice of Algorithms in (Computer) Systems -
TAPAS 2012
3-5 December 2012
Kibbutz Ein Gedi, Dead Sea, Israel



- 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


Yossi Azar (Tel-Aviv University, Israel)
Artur Czumaj (University of Warwick, United Kingdom)
Yishay Mansour (Tel-Aviv University, Israel)
David Peleg (Weizmann Institute of Science, Israel)


[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


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 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

The European Alliance for Innovation is a dynamic eco-system for fostering ICT enabled innovation to improve European competitiveness and to benefit society. EAI uses open e-platforms to inspire grassroots collaboration among all
relevant actors, from organizations to individuals, to stimulate community driven innovation to its institutional and individual members worldwide. Through EAI, organizations find ideas and talent, and individual innovators
find organizations for their ingenuity and craft. Join the innovation community at www.eai.eu

Related Resources

ECML-PKDD 2017   European Conference on Machine Learning and Principles and Practice of Knowledge Discovery
LOPAL 2018   International Conference on Learning and Optimization Algorithms: Theory and Applications
ISAAC 2017   International Symposium on Algorithms and Computation
WALCOM 2018   The 12th International Conference and Workshop on Algorithms and Computation (WALCOM)
SOFSEM 2018   44th International Conference on Current Trends in Theory and Practice of Computer Science
GRAPH-HOC 2017   9th International Conference on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
IPMU 2018   17th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference
Social Information Systems @ HICSS-51   Social Information Systems Minitrack - Hawaii International Conference on System Sciences (HICSS-51)
VISAPP 2018   International Conference on Computer Vision Theory and Applications