Advertisement

Table of contents

  1. Front Matter
  2. Kirk Pruhs
    Pages 6-7
  3. Paolo Santi
    Pages 8-8
  4. Leon Atkins, Guillaume Aupy, Daniel Cole, Kirk Pruhs
    Pages 9-20
  5. Roland Bader, Jonathan Dees, Robert Geisberger, Peter Sanders
    Pages 21-32
  6. Apostolos Bessas, Spyros Kontogiannis, Christos Zaroliagis
    Pages 33-44
  7. Hans L. Bodlaender, Johan M. M. van Rooij
    Pages 45-56
  8. Tiziana Calamoneri, Rossella Petreschi
    Pages 57-68
  9. Ho-Leung Chan, Tak-Wah Lam, Rongbin Li
    Pages 69-80
  10. Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino
    Pages 92-103
  11. Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann
    Pages 104-115
  12. Ulrich Faigle, Walter Kern, Britta Peis
    Pages 116-126
  13. Janick V. Frasch, Sven Oliver Krumke, Stephan Westphal
    Pages 127-138
  14. Marc Goerigk, Anita Schöbel
    Pages 139-150
  15. Tommi Junttila, Petteri Kaski
    Pages 151-162
  16. Walter Kern, Xian Qiu
    Pages 175-180
  17. Dariusz R. Kowalski, Mariusz A. Rokicki
    Pages 181-192
  18. Luigi Laura, Federico Santaroni
    Pages 193-205
  19. Giorgio Lucarelli, Ioannis Milis
    Pages 206-216
  20. Timo Berthold, Stefan Heinz, Jens Schulz
    Pages 229-239
  21. Hongyang Sun, Yuxiong He, Wen-Jing Hsu
    Pages 240-251
  22. Back Matter

About these proceedings

Introduction

This book constitutes the refereed proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, held in Rome, Italy, in April 2011. The 25 papers presented, including three short papers by invited speakers, were carefully reviewed and selected from 45 submissions. The papers all feature original research in the design, implementation and evaluation of algorithms with special focus on algorithms for combinatorial optimization problems, and to real-world applications, engineering and experimental analysis of algorithms - thus fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.

Keywords

constraint programming data structures distributed verification graph instantaneous parallelism linear programming memory management mixed integer programming modeling multiprocessors online algorithms parameterized complexity routing scalability scheduling wireless networks

Editors and affiliations

  • Alberto Marchetti-Spaccamela
    • 1
  • Michael Segal
    • 2
  1. 1.Department of Computer Science and Systemics "Antonio Ruberti"Sapienza University of RomeRomeItaly
  2. 2.Communication Systems Engineering DepartmentBen-Gurion University of the NegevBeer-ShevaIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-19754-3
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-19753-6
  • Online ISBN 978-3-642-19754-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site