Theoretical Computer Science
Theoretical Computer Science

Author: Zhiping Cai

Publisher: Springer Nature

Published: 2021-11-09

Total Pages: 258

ISBN-13: 9811674434

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed proceedings of the 39th National Conference of Theoretical Computer Science, NCTCS 2021, held in Yinchuan, China, in July 2021. The 67 full papers were carefully reviewed and selected from 145 submissions, and 14 of them were selected for the volume. The papers present recent research in the areas of information hiding, data detection and recognition, system scheduling, time series prediction, and formal analysis.

Algorithms and Complexity
Algorithms and Complexity

Author: Rosella Petreschi

Publisher: Springer Science & Business Media

Published: 2003-05-15

Total Pages: 300

ISBN-13: 3540401768

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 5th Italian Conference on Algorithms and Computation, CIAC 2003, held in Rome, Italy in May 2003. The 23 revised full papers presented were carefully reviewed and selected from 57 submissions. Among the topics addressed are complexity, complexity theory, geometric computing, matching, online algorithms, combinatorial optimization, computational graph theory, approximation algorithms, network algorithms, routing, and scheduling.

Combinatorial Geometry and Graph Theory
Combinatorial Geometry and Graph Theory

Author: Jin Akiyama

Publisher: Springer Science & Business Media

Published: 2005-01-31

Total Pages: 234

ISBN-13: 3540244018

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed post-proceedings of the Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003, held in Bandung, Indonesia in September 2003. The 23 revised papers presented were carefully selected during two rounds of reviewing and improvement. Among the topics covered are coverings, convex polygons, convex polyhedra, matchings, graph colourings, crossing numbers, subdivision numbers, combinatorial optimization, combinatorics, spanning trees, various graph characteristica, convex bodies, labelling, Ramsey number estimation, etc.

Algorithmic Aspects in Information and Management
Algorithmic Aspects in Information and Management

Author: Riccardo Dondi

Publisher: Springer

Published: 2016-07-04

Total Pages: 235

ISBN-13: 3319411683

DOWNLOAD EBOOK

This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016. The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.

Treewidth, Kernels, and Algorithms
Treewidth, Kernels, and Algorithms

Author: Fedor V. Fomin

Publisher: Springer Nature

Published: 2020-04-20

Total Pages: 350

ISBN-13: 303042071X

DOWNLOAD EBOOK

This Festschrift was published in honor of Hans L. Bodlaender on the occasion of his 60th birthday. The 14 full and 5 short contributions included in this volume show the many transformative discoveries made by H.L. Bodlaender in the areas of graph algorithms, parameterized complexity, kernelization and combinatorial games. The papers are written by his former Ph.D. students and colleagues as well as by his former Ph.D. advisor, Jan van Leeuwen. Chapter “Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Approximation and Online Algorithms
Approximation and Online Algorithms

Author: Jochen Koenemann

Publisher: Springer Nature

Published: 2022-01-01

Total Pages: 286

ISBN-13: 3030927024

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.

Global Computing
Global Computing

Author: Corrado Priami

Publisher: Springer

Published: 2005-02-09

Total Pages: 375

ISBN-13: 3540317945

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed post-proceedings of the IST/FET International Workshop on Global Computing, GC 2004, held in Rovereto, Italy in March 2004. The 18 revised full papers presented were carefully selected during two rounds of reviewing and improvement from numerous submissions. Among the topics covered are programming environments, dynamic reconfiguration, resource guarantees, peer-to-peer networks, analysis of systems and resources, resource sharing, and security, as well as foundational calculi for mobility.

Formal Verification of Object-Oriented Software
Formal Verification of Object-Oriented Software

Author: Bernhard Beckert

Publisher: Springer

Published: 2012-07-11

Total Pages: 259

ISBN-13: 3642317626

DOWNLOAD EBOOK

This book presents the thoroughly refereed post-conference proceedings of the International Conference on Formal Verification of Object-Oriented Software, FoVeOOS 2011, held in Turin, Italy, in October 2011 – organised by COST Action IC0701. The 10 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 19 submissions. Formal software verification has outgrown the area of academic case studies, and industry is showing serious interest. The logical next goal is the verification of industrial software products. Most programming languages used in industrial practice are object-oriented, e.g. Java, C++, or C#. FoVeOOS 2011 aimed to foster collaboration and interactions among researchers in this area.