This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K H Kim, F W Roush and Susan Williams. The papers deal with some of the most exciting and promising developments in the areas of coding theory in relation to number theory, lattice theory and its applications, graph theory and its applications, topological techniques in combinatorics, symbolic dynamics and mathematical social science.

Chapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.

This book constitutes the joint refereed proceedings of the 20th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2013, 6th International Workshop on Digital Mathematics Libraries, DML 2013, Systems and Projects, held in Bath, UK as part of CICM 2013, the Conferences on Intelligent Computer Mathematics. The 7 revised full papers out of 18 submissions for MKM 2013, 5 revised full papers out of 12 submissions for Calculemus 2013, 6 revised full papers out of 8 submissions for DML 2013, and 12 revised full papers out of 16 submissions for Systems and Project track presented together with 3 invited talks were carefully reviewed and selected, resulting in 33 papers from a total of 73 submissions.

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.

This book constitutes the joint refereed proceedings of the 11th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2012, 19th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2012, 5th International Workshop on Digital Mathematics Libraries, DML 2012, 11th International Conference on Mathematical Knowledge Management, MKM 2012, Systems and Projects, held in Bremen, Germany as CICM 2012, the Conferences on Intelligent Computer Mathematics. The 13 revised full papers out of 19 submissions for MKM 2012, 6 revised full papers out of 9 submissions for Calculemus 2012, 6 revised full papers out of 8 submissions for AISC 2012, 2 revised full papers out of 3 submissions for DML 2012, and 11 revised full papers out of 12 submissions for Systems and Project track presented were carefully reviewed and selected, resulting in 38 papers from a total of 52 submissions.

Research and development in the pioneering field of quantum computing involve just about every facet of science and engineering, including the significant areas of mathematics and physics. Based on the firm understanding that mathematics and physics are equal partners in the continuing study of quantum science, Mathematics of Quantum Computation an

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects. The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers. The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science. Features: Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys Surveys highlight open questions to inspire further research Chapters are written by experts in their fields Extensive bibliographies are provided at the end of each chapter