Topics
Dowload here the .pdf version of the Call For Papers
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.
Invited Speakers
- 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)
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.
