This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.

Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with emphasis on conceptual needs of computer science. Each part is divided into a "basic concepts" chapter emphasizing intuitive needs of the subject, followed by four "topics" chapters that explore these ideas in depth. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures.

Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. - Named a 2013 Notable Computer Book for Computing Methodologies by Computing Reviews - Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understanding - Presents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols - Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises

Combinatorial Scientific Computing explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures. It includes contributions from international researchers who are pioneers in designing software and applications for high-performance computing systems. The book offers a state-of-the-art overview of the latest research, tool development, and applications. It focuses on load balancing and parallelization on high-performance computers, large-scale optimization, algorithmic differentiation of numerical simulation code, sparse matrix software tools, and combinatorial challenges and applications in large-scale social networks. The authors unify these seemingly disparate areas through a common set of abstractions and algorithms based on combinatorics, graphs, and hypergraphs. Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations and their importance continues to grow with the demands of new applications and advanced architectures. By addressing current challenges in the field, this volume sets the stage for the accelerated development and deployment of fundamental enabling technologies in high-performance scientific computing.

This book constitutes the refereed proceedings of the 10th Annual International Computing and Combinatorics Conference, COCOON 2004, held in Jeju Island, Korea, in August 2004. The 46 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 109 submissions. The papers are organized in topical sections on data structures and algorithms, computational geometry, games and combinatorics, combinatorial optimization, graph algorithms, automata and learning theory, scheduling, graph drawing, complexity theory, parallel and distributed architectures, and computational biology.

This book constitutes the refereed proceedings of the 6th Annual International Conference on Computing and Combinatorics, COCOON 2000, held in Sydney, Australia in July 2000.The 44 revised full papers presented together with two invited contributions were carefully reviewed and selected from a total of 81 submissions. The book offers topical sections on computational geometry; graph drawing; graph theory and algorithms; complexity, discrete mathematics, and number theory; online algorithms; parallel and distributed computing; combinatorial optimization; data structures and computational biology; learning and cryptography; and automata and quantum computing.

This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. The 49 revised full papers and 11 shorter papers presented were carefully reviewed and selected from various submissions. The papers cover various topics including algorithms and data structures; algorithmic game theory; approximation algorithms and online algorithms; automata, languages, logic and computability; complexity theory; computational learning theory; cryptography, reliability and security; database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization; graph theory, communication networks, optimization and parallel and distributed computing.