This volume constitutes the refereed post-conference proceedings of the International Conference on Theoretical Computer Science and Discrete Mathematics, held in Krishnankoil, India, in December 2016. The 57 revised full papers were carefully reviewed and selected from 210 submissions. The papers cover a broad range of topics such as line graphs and its generalizations, large graphs of given degree and diameter, graphoidal covers, adjacency spectrum, distance spectrum, b-coloring, separation dimension of graphs and hypergraphs, domination in graphs, graph labeling problems, subsequences of words and Parike matrices, lambda-design conjecture, graph algorithms and interference model for wireless sensor networks.

The refereed proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS 2003, held in Dijon, France, in July 2003. The 18 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 35 submissions. A broad variety of topics in discrete mathematics and the theory of computing is addressed including information theory, coding, algorithms, complexity, automata, computational mathematics, combinatorial computations, graph computations, algorithmic geometry, relational methods, game-theoretic methods, combinatorial optimization, and finite state systems.

This book is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science (EATCS) during the period 2000OCo2003. It presents many of the most active current research lines in theoretical computer science. The material appears in two volumes, OC Algorithms and ComplexityOCO and OC Formal Models and SemanticsOCO, reflecting the traditional division of the field. The list of contributors includes many of the well-known researchers in theoretical computer science. Most of the articles are reader-friendly and do not presuppose much knowledge of the area in question. Therefore, the book constitutes very suitable supplementary reading material for various courses and seminars in computer science. Contents: Vol 1: Algorithms; Computational Complexity; Distributed Computing; Natural Computing; Vol 2: Formal Specification; Logic in Computer Science; Concurrency; Formal Language Theory. Readership: Upper level undergraduates, graduate students and researchers in theoretical computer science and biocomputing."

This book constitutes the refereed proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2003, held in Mumbai, India in December 2003. The 23 revised full papers presented together with 4 invited papers and the abstract of an invited paper were carefully reviewed and selected from 160 submissions. A broad variety of current topics from the theory of computing are addressed, ranging from algorithmics and discrete mathematics to logics and programming theory.

The central question addressed in Foundations for the Future in Mathematics Education is this: What kind of understandings and abilities should be emphasized to decrease mismatches between the narrow band of mathematical understandings and abilities that are emphasized in mathematics classrooms and tests, and those that are needed for success beyond school in the 21st century? This is an urgent question. In fields ranging from aeronautical engineering to agriculture, and from biotechnologies to business administration, outside advisors to future-oriented university programs increasingly emphasize the fact that, beyond school, the nature of problem-solving activities has changed dramatically during the past twenty years, as powerful tools for computation, conceptualization, and communication have led to fundamental changes in the levels and types of mathematical understandings and abilities that are needed for success in such fields. For K-12 students and teachers, questions about the changing nature of mathematics (and mathematical thinking beyond school) might be rephrased to ask: If the goal is to create a mathematics curriculum that will be adequate to prepare students for informed citizenship—as well as preparing them for career opportunities in learning organizations, in knowledge economies, in an age of increasing globalization—how should traditional conceptions of the 3Rs be extended or reconceived? Overall, this book suggests that it is not enough to simply make incremental changes in the existing curriculum whose traditions developed out of the needs of industrial societies. The authors, beyond simply stating conclusions from their research, use results from it to describe promising directions for a research agenda related to this question. The volume is organized in three sections: *Part I focuses on naturalistic observations aimed at clarifying what kind of “mathematical thinking” people really do when they are engaged in “real life” problem solving or decision making situations beyond school. *Part II shifts attention toward changes that have occurred in kinds of elementary-but-powerful mathematical concepts, topics, and tools that have evolved recently—and that could replace past notions of “basics” by providing new foundations for the future. This section also initiates discussions about what it means to “understand” the preceding ideas and abilities. *Part III extends these discussions about meaning and understanding—and emphasizes teaching experiments aimed at investigating how instructional activities can be designed to facilitate the development of the preceding ideas and abilities. Foundations for the Future in Mathematics Education is an essential reference for researchers, curriculum developers, assessment experts, and teacher educators across the fields of mathematics and science education.

A collection of articles written by experienced primary, secondary, and collegiate educators. It explains why discrete mathematics should be taught in K-12 classrooms and offers guidance on how to do so. It offers school and district curriculum leaders material that addresses how discrete mathematics can be introduced into their curricula.

This book is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science (EATCS) during the period 2000-2003. It presents many of the most active current research lines in theoretical computer science. The material appears in two volumes, “Algorithms and Complexity” and “Formal Models and Semantics”, reflecting the traditional division of the field.The list of contributors includes many of the well-known researchers in theoretical computer science. Most of the articles are reader-friendly and do not presuppose much knowledge of the area in question. Therefore, the book constitutes very suitable supplementary reading material for various courses and seminars in computer science.

This book presents the basic concepts and algorithms of computer algebra using practical examples that illustrate their actual use in symbolic computation. A wide range of topics are presented, including: Groebner bases, real algebraic geometry, lie algebras, factorization of polynomials, integer programming, permutation groups, differential equations, coding theory, automatic theorem proving, and polyhedral geometry. This book is a must read for anyone working in the area of computer algebra, symbolic computation, and computer science.

This book constitutes the refereed proceedings of the 8th International Conference on Informatics in Schools: Situation, Evolution, and Perspectives, ISSEP 2015, held in Ljubljana, Slovenia, in September/October 2015. The 14 full papers presented together with 3 invited talks were carefully reviewed and selected from 36 submissions. The focus of the conference was on following topics: sustainable education in informatics for pupils of all ages; connecting informatics lessons to the students’ everyday lives; teacher education in informatics; and research on informatics in schools (empirical/qualitative/quantitative/theory building/research methods/comparative studies/transferability of methods and results from other disciplines).

International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of refereed international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing. For more information about the 300 other books in the IFIP series, please visit www.springer.com. For more information about IFIP, please visit www.ifip.org.