This book constitutes the refereed proceedings of the Thailand-Japan Joint Conference on Computational Geometry and Graphs, TJJCCGG 2012, held in Bangkok, Thailand, in December 2012. The 15 original research papers presented were selected from among six plenary talks, one special public talk and 41 talks by participants from about 20 countries around the world. TJJCCGG 2012 provided a forum for researchers working in computational geometry, graph theory/algorithms and their applications.

This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995. The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.

This book constitutes the refereed proceedings of the 10th International Conference on Digital Geometry for Computer Imagery, DGCI 2002, held in Bordeaux, France, in April 2002.The 22 revised full papers and 13 posters presented together with 3 invited papers were carefully reviewed and selected from 67 submissions. The papers are organized in topical sections on topology, combinatorial image analysis, morphological analysis, shape representation, models for discrete geometry, segmentation and shape recognition, and applications.

This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi'an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.

This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Computation, ISAAC 2001, held in Christchurch, New Zealand in December 2001. The 62 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 124 submissions. The papers are organized in topical sections on combinatorial generation and optimization, parallel and distributed algorithms, graph drawing and algorithms, computational geometry, computational complexity and cryptology, automata and formal languages, computational biology and string matching, and algorithms and data structures.

The emerging field of computational topology utilizes theory from topology and the power of computing to solve problems in diverse fields. Recent applications include computer graphics, computer-aided design (CAD), and structural biology, all of which involve understanding the intrinsic shape of some real or abstract space. A primary goal of this book is to present basic concepts from topology and Morse theory to enable a non-specialist to grasp and participate in current research in computational topology. The author gives a self-contained presentation of the mathematical concepts from a computer scientist's point of view, combining point set topology, algebraic topology, group theory, differential manifolds, and Morse theory. He also presents some recent advances in the area, including topological persistence and hierarchical Morse complexes. Throughout, the focus is on computational challenges and on presenting algorithms and data structures when appropriate.

This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7–11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures.

This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995. The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.

This book constitutes the thoroughly refereed post-conference proceedings of the 10th International Conference on Large-Scale Scientific Computations, LSSC 2015, held in Sozopol, Bulgaria, in June 2015. The 49 revised full papers presented were carefully reviewed and selected from 64 submissions. The general theme for LSSC 2015 was Large-Scale Scientific Computing with a particular focus on the organized special sessions: enabling exascale computation; control and uncertain systems; computational microelectronics - from monte carlo to deterministic approaches; numerical methods for multiphysics problems; large-scale models: numerical methods, parallel computations and applications; mathematical modeling and analysis of PDEs describing physical problems; a posteriori error control and iterative methods for maxwell type problems; efficient algorithms for hybrid HPC systems; multilevel methods on graphs; and applications of metaheuristics to large-scale problems.