Christos Kaklamanis – författare

This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in  September 2020 as part of ALGO 2020.The 15 revised full papers presented this book were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2018 were graph algorithms, inapproximability results, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems, algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational -finance, cuts and connectivity, geometric problems, mechanism design, resource augmentation, real-world applications.Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems.

This book constitutes the proceedings of the workshops of the 23rd International Conference on Parallel and Distributed Computing, Euro-Par 2016, held in Grenoble, France in August 2016.   The 65 full papers presented were carefully reviewed and selected from 95 submissions.The volume includes the papers from the following workshops: Euro-EDUPAR (Second European Workshop on Parallel and Distributed Computing Education for Undergraduate Students) – HeteroPar 2016 (the 14th International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms) – IWMSE (5th International Workshop on Multicore Software Engineering) – LSDVE (Fourth Workshop on Large-Scale Distributed Virtual Environments) -  PADABS (Fourth Workshop on Parallel and Distributed Agent-Based Simulations) – PBio (Fourth International Workshop on Parallelism in Bioinformatics) – PELGA (Second Workshop on Performance Engineering for Large-Scale Graph Analytics) – REPPAR (Third International Workshop on Reproducibility in Parallel Computing) – Resilience (9th Workshop in Resilience in High Performance Computing in Clusters, Clouds, and Grids) – ROME (Fourth Workshop on Runtime and Operating Systems for the Many-Core Era) – UCHPC (9th Workshop on UnConventional High-Performance Computing).

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions.

The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2007 took place in Eilat, Israel, during October 11–12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. In response to the call for - pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.

This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Trustworthy Global Computing, TGC 2008 held in Barcelona, Spain, in November 2008. The 12 revised papers presented together with one invited paper were carefully selected from 26 submissions during two rounds of reviewing and improvement. The TGC 2008 symposium papers focus on providing tools and frameworks for constructing well-behaved applications and for reasoning about their behavior and properties in models of computation that incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices.