This book constitutes the refereed proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, in December 2015. The 65 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 180 submissions for inclusion in the book. The focus of the volume is on the following topics: computational geometry; data structures; combinatorial optimization and approximation algorithms; randomized algorithms; graph algorithms and FPT; computational complexity; graph drawing and planar graphs; online and streaming algorithms; and string and DNA algorithms.

The 11th International Conference on the Principles and Practice of Constraint Programming (CP 2005) was held in Sitges (Barcelona), Spain, October 1-5, 2005. Information about the conference can be found on the web at http://www.iiia.csic.es/cp2005/.Informationaboutpastconferencesinthe series can be found athttp://www.cs.ualberta.ca/~ai/cp/. The CP conference series is the premier international conference on c- straint programming and is held annually. The conference is concerned with all aspects of computing with constraints, including: algorithms, applications, environments, languages, models and systems. This year, we received 164 submissions. All of the submitted papers received atleastthreereviews, andthepapersandtheirreviewswerethenextensivelyd- cussed during an online Program Committee meeting. As a result, the Program Committee chose 48 (29.3%) papers to be published in full in the proceedings and a further 22 (13.4%)papers to be published as short papers.The full papers werepresentedattheconferencein twoparalleltracksandtheshortpaperswere presented as posters during a lively evening session. Two papers were selected by a subcommittee of the ProgramCommittee--consisting of Chris Beck, Gilles Pesant, and myself--to receive best paper awards. The conference program also includedexcellentinvitedtalksbyHþ ectorGe?ner, IanHorrocks, FrancescaRossi, and Peter J. Stuckey. As a permanent record, the proceedings contain four-page extended abstracts of the invited talks.

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).

Do humans behave much like atoms? Sociophysics, which uses tools and concepts from the physics of disordered matter to describe some aspects of social and political behavior, answers in the affirmative. But advocating the use of models from the physical sciences to understand human behavior could be perceived as tantamount to dismissing the existence of human free will and also enabling those seeking manipulative skills . This thought-provoking book argues it is just the contrary. Indeed, future developments and evaluation will either show sociophysics to be inadequate, thus supporting the hypothesis that people can primarily be considered to be free agents, or valid, thus opening the path to a radically different vision of society and personal responsibility. This book attempts to explain why and how humans behave much like atoms, at least in some aspects of their collective lives, and then proposes how this knowledge can serve as a unique key to a dramatic leap forwards in achieving more social freedom in the real world. At heart, sociophysics and this book are about better comprehending the richness and potential of our social interaction, and so distancing ourselves from inanimate atoms.

This volume contains the papers presented at CP 2009: The 15th International Conference on Principles and Practice of Constraint Programming. It was held from September 20–24, 2009 at the Rectory of the New University of Lisbon, Portugal. Everyone involved with the conference thanks our sponsors for their support. There were 128 submissions to the research track, of which 53 were accepted for a rate of 41.4%. Each submission was reviewed by three reviewers, with a small number of additional reviews obtained in exceptional cases. Each review waseitherbyaProgrammeCommitteemember,orbyacolleagueinvitedtohelp by a committee member thanks to their particular expertise. Papers submitted as long papers were accepted at full length or not at all. It is important to note that papers submitted as short papers were held to the same high standards of qualityas long papers. There is thus no distinction in these proceedings between long and short papers, except of course the number of pages they occupy. As it happens, the acceptancerates of short and long papers wereverysimilar indeed. Therewere13submissionstotheapplicationtrack,ofwhich8wereaccepted, fora rateof61.5%.Papersunderwentthe samereviewprocessasregularpapers, and there was not a separate committee for reviewing application track papers. However, papers in the application track were not required to be original or novel research, but to be original and novel as an application of constraints.

This book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022. The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.

This book constitutes the revised selected papers of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017, held in Eindhoven, The Netherlands, in June 2017. The 31 full papers presented in this volume were carefully reviewed and selected from 71 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.