Search

A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.New for the fourth edition New chapters on matchings in bipartite graphs, online algorithms, and machine learningNew material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays140 new exercises and 22 new problemsReader feedback–informed improvements to old problemsClearer, more personal, and gender-neutral writing styleColor added to improve visual presentationNotes, bibliography, and index updated to reflect developments in the fieldWebsite with new supplementary materialWarning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.

This textbook introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational biology, bioinformatics, and computational chemistry. Centered around the fundamental issue of graph isomorphism, this book goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Furthermore, Python code for all algorithms presented is given in a appendix. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference.

Packed with new material and research, this second edition of George Friedman's bestselling Constraint Theory remains an invaluable reference for all engineers, mathematicians, and managers concerned with modeling. As in the first edition, this text analyzes the way Constraint Theory employs bipartite graphs and presents the process of locating the “kernel of constraint” trillions of times faster than brute-force approaches, determining model consistency and computational allowability. Unique in its abundance of topological pictures of the material, this book balances left- and right-brain perceptions to provide a thorough explanation of multidimensional mathematical models. Much of the extended material in this new edition also comes from Phan Phan's PhD dissertation in 2011, titled “Expanding Constraint Theory to Determine Well-Posedness of Large Mathematical Models.”Praise for the first edition:'Dr. George Friedman is indisputably the fatherof the very powerful methods of constraint theory.'--Cornelius T. Leondes, UCLA'Groundbreaking work.... Friedman's accomplishment represents engineering at its finest.... The credibility of the theory rests upon the formal proofs which are interspersed among the illuminating hypothetical dialog sequences between manager and analyst, which bring out distinctions that the organization must face, en route to accepting Friedman's work as essential to achieve quality control in developing and applying large models.'--John N. Warfield

This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory. The book is appropriate for researchers in theoretical computer science, in particular computational complexity.

Matching is a classic problem with a rich history and a significant impact on both the theory of algorithms and in practice. Recently, there has been a surge of interest in the online version of matching and its generalizations. This is due to the important new application domain of Internet advertising. The theory of online matching and allocation has played a critical role in designing algorithms for ad allocation. Online Matching and Ad Allocation surveys the key problems, models, and algorithms from online matchings, as well as their implication in the practice of ad allocation. It provides a classification of the problems in this area, an introduction into the techniques used, a glimpse into the practical impact, and ponders some of the open questions that will be of interest in the future. Matching continues to find core applications in diverse domains, and the advent of massive online and streaming data emphasizes the future applicability of the algorithms and techniques surveyed here. Online Matching and Ad Allocation is an ideal primer for anyone interested in matching, and particularly in the online version of the problem, in bipartite graphs

Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational molecular biology and computational chemistry. Centered around the fundamental issue of graph isomorphism, this text goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. This book introduces graph algorithms on an intuitive basis followed by a detailed exposition in a literate programming style, with correctness proofs as well as worst-case analyses. Furthermore, full C++ implementations of all algorithms presented are given using the LEDA library of efficient data structures and algorithms. Numerous illustrations, examples, and exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference

Graph algorithms are easy to visualize and indeed there already exists a variety of packages to animate the dynamics when solving problems from graph theory. Still it can be difficult to understand the ideas behind the algorithm from the dynamic display alone. CATBox consists of a software system for animating graph algorithms and a course book which we developed simultaneously. The software system presents both the algorithm and the graph and puts the user always in control of the actual code that is executed. In the course book, intended for readers at advanced undergraduate or graduate level, computer exercises and examples replace the usual static pictures of algorithm dynamics. For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows, weighted and unweighted matchings both for bipartite and non-bipartite graphs. Find more information at http://schliep.org/CATBox/.

Data Visualization Hacks: Tricks for Clear Insights explores the vital role of data visualization in making sense of vast amounts of information. In our digital age, data has become abundant and cheap, yet processing and understanding it can be challenging. This book guides readers through the steps of the data science process, emphasizing the importance of visualizing data to draw meaningful conclusions. We explain how to discover new patterns and spot trends using various visualization techniques. Beyond traditional methods like pie charts and histograms, we delve into advanced representations such as heat maps and fever charts. We also differentiate between data science and data visualization, highlighting the career opportunities in this field. Our book is designed for both beginners and seasoned professionals, making complex concepts easy to understand and apply. By the end, readers will have the knowledge to effectively visualize data and harness its power for business and personal insights.

This book constitutes the refereed proceedings of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2024, held in Gozd Martuljek, Slovenia in June 2024, The 31 papers presented in this volume were carefully reviewed and selected from 89 submissions. Additionally, this volume also contains a survey on approximation algorithms for tree-width, path-width, and tree-depth prepared by Hans Bodlander, who delivered the Test of Time Award talk at WG 2024. The WG 2024 workshop aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science or by extracting new graph-theoretic problems from applications.

This book constitutes the refereed proceedings of the 18th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2024), consisting of the 18th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 5th International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, SAR, China, during July 29-31, 2024. FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science. To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. The 20 full papers and 3 short papers included in this book were carefully reviewed and selected from 43 submissions. They focused tracks on algorithms, blockchain theory, computational economics and algorithmic game theory.

Formal Concept Analysis is a field of applied mathematics based on the math­ematization of concept and conceptual hierarchy. It thereby activates math­ematical thinking for conceptual data analysis and knowledge processing. The underlying notion of “concept” evolved early in the philosophical theory of concepts and still has effects today. In mathematics it played a special role during the emergence of mathematical logic in the 19th century. Subsequently, however, it had virtually no impact on mathematical thinking. It was not until 1979 that the topic was revisited and treated more thoroughly. Since then, Formal Concept Analysis has fully emerged, sparking a multitude of publications for which the first edition of this textbook established itself as the standard reference in the literature, with a total of 10000+ citations. This is the second edition, revised and extended, of the textbook published originally in German (1996) and translated into English (1999), giving a systematic presentation of the mathematical foundations while also focusing on their possible applications for data analysis and knowledge processing. In times of digital knowledge processing, formal methods of conceptual analysis are gaining in importance. The book makes the basic theory for such methods accessible in a compact form, and presents graphical methods for representing concept systems that have proved themselves essential in communicating knowledge. The textbook complements each chapter with further notes, references and trends, putting the work in modern context and highlighting potential directions for further research. Additionally, the book contains an entirely new chapter on contextual concept logic, including a section on description logics and relational concept analysis. As such, it should be a valuable resource for students, instructors and researchers at the crossroads of subject areas like Applied and Discrete Mathematics, Logics, Theoretical Computer Science, Knowledge Processing, Data Science, and is meant to be used both for research and in class, as a teaching resource.

This book constitutes the proceedings of the 8th International Conference on Mathematical Software, ICMS 2024, held in Durham, UK, during July 22–25, 2024. The 37 full papers presented were carefully reviewed and selected from 46 submissions. The papers are organized in subject areas as follows: plenary lectures; number theory and related areas; novel formalisations of mathematics in lean; software for the applications of group theory to combinatorics; classical algebraic geometry & modern computer algebra: innovative software design and its applications; advancing computer algebra with massively parallel methods; computer algebra applications in the life sciences; machine learning within computer algebra systems; numerical software for special functions; mathematical research data; symbolic-numeric methods in algebraic geometry; Polyhedral geometry and combinatorics; general session.

This book gathers selected research articles presented in the “6th International Conference on Mathematical Modelling, Applied Analysis and Computation (ICMMAAC)”, held at JECRC University, Jaipur, during August 3–5, 2023. This book is focused on articles dealing with necessary theory and techniques in a balanced manner, and contributes towards solving mathematical problems arising in physics, engineering, chemistry, biological systems, medicine, networking system, control systems, environmental sciences, social issues of current interest and more. Annually held since 2018, the ICMMAAC conference aimed, in particular, to foster cooperation among practitioners and theoreticians in these fields. This proceedings is an invaluable resource for researchers, academicians and professionals associated or interested in current advances in different aspects of mathematical modelling, computational algorithms and analysis necessary for handling real-world problems.

This book constitutes the proceedings of the 21st Australasian Conference on Data Science and Machine Learning, AusDM 2023, held in Auckland, New Zealand, during December 11–13, 2023.The 20 full papers presented in this book were carefully reviewed and selected from 50 submissions. The papers are organized in the following topical sections: research track and application track. They deal with topics around data science and machine learning in everyday life.

This book constitutes the refereed proceedings of the 34th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2024, held in Milan, Italy, during September 9–10, 2024. The 12 full papers and 1 short paper included in this book were carefully reviewed and selected from 28 submissions. They were organized in topical sections as follows: Synthesis and Transformation; Decision Procedures; Deployment; Specification, Refactoring and Testing; and Term and Graph Rewriting.

This two-volume set LNAI 14810-14811 constitutes the refereed proceedings of the 16th International Conference on Computational Collective Intelligence, ICCCI 2024, held in Leipzig, Germany, during September 9–11, 2024. The 59 revised full papers presented in these proceedings were carefully reviewed and selected from 234 submissions. Part I: collective intelligence and collective decision-making; deep learning techniques; natural language processing; data mining and machine learning Part II: social networks and intelligent system; cybersecurity, blockchain technology, and internet of things; cooperative strategies for decision making and optimization; computational intelligence for digital content understanding; knowledge engineering and application for industry 4.0

This book constitutes the refereed proceedings of the 18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023, held in Harbin, China, during September 23–24, 2023.The 38 full papers and 1 short paper included in this book were carefully reviewed and selected from 111 submissions. They were organized in topical sections as follows: Industrial Digitization and Applications, Edge Intelligence, Mobile Sensing and Computing, Cyber-Physical-Social Systems, Pervasive and Green Computing and Wireless and Ubiquitous Networking.

This book constitutes the refereed proceedings of the 10th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2024, held in Bhilai, India during February 15–17, 2024. The 22 full papers included in this book were carefully reviewed and selected from 57 submissions. They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry; Discrete Applied Mathematics; Graph Algorithms; Graph Theory.

This two-volume set LNCS 14465-14466 constitutes the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, GD 2023, held in Isola delle Femmine, Palermo, Italy, in September 2023. The 31 full papers, 7 short papers, presented together with 2 invited talks, and one contest report, were thoroughly reviewed and selected from the 100 submissions. The abstracts of 11 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: beyond planarity; crossing numbers; linear layouts; geometric aspects; visualization challenges; graph representations; graph decompositions; topological aspects; parameterized complexity for drawings; planar graphs; frameworks; algorithmics.

This book constitutes the refereed proceedings of the 20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024, held in Egham, UK, in September 2024. The 14 full papers presented here were carefully reviewed and selected from 26 submissions. These papers focus on the Algorithmic aspects of Wireless networks, including the design and analysis of Algorithms, Models of computation and Experimental analysis, involved in various types of computational entities.

This book discusses the role of proofs in mathematics and computer science. In mathematics, a proof involves validating a proposition through logical deductions from axioms. Computer scientists focus on demonstrating program accuracy, given the increasing error susceptibility of software. A community of specialists aims to enhance program precision, extending to verifying computer processor chips for leading manufacturers. Creating mathematical models to affirm program validity is an active study area. A proof, in this context, involves a sequence of logical deductions from axioms and established statements, leading to the desired proposition. While crafting proofs may seem daunting, standard templates offer a framework. Some templates can be interconnected, providing both high-level structure and detailed guidance. The Principle of Mathematical Induction is applied to validate algorithms without computer reliance. Sets underpin modern mathematics and software engineering, introduced with language and typical tasks. Primary set operations'understanding enables proof techniques for functions, relations, and graphs, validating algorithms for specific tasks. The book delves into language describing element collections and sets, providing proof templates for comprehension and construction. The book covers common set operations, introduces additional proof templates, and addresses numbering elements and the Principle of Mathematical Induction. This exploration deepens the understanding of mathematical proofs and their role in computer science applications.

This proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021. As has been a tradition since its inception in 1970, this edition once more brought together mathematicians, practitioners, and scientists around novel findings in combinatorics, graph theory and computing, and their interactions.The lectures and works presented at the Conference have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional activities in business, industry, and government. Such an environment promotes a better understanding of the roles of modern applied mathematics, combinatorics, and computer science. Many works have demonstrated that disciplines have increasingly contributed to each other. With this series of Conferences, the gaps between the fields tend to decrease even further.This volume is of particular interest for the community of pure and applied mathematicians in academia, industry, and government, working in combinatorics and graph theory, as well as related areas of computer science and the interactions among these fields. Its findings can also benefit a general audience of practitioners and students from related fields.

本書は、全世界で標準的なアルゴリズムの教科書として位置づけられてきた'Introduction to Algorithms'の第4版の翻訳書である。 第4版ではコンピュータサイエンスの第一線を捉えるために、安定結婚問題（2 部グラフでのマッチング問題）、オンラインアルゴリズム、機械学習などの新しい章や、再帰的漸化式の解法、ハッシュアルゴリズムなど、新しい話題を豊富に取り入れている。これまでの版と同様、各節末には多様なレベルの問題が配置され、学部や大学院の講義用教科書として、また技術系専門家の手引書、あるいは事典としても活用できる。 第2巻ではPart4〜6までの「高度な設計と解析の手法」「高度なデータ構造」「グラフアルゴリズム」を収載。

This two-volume set LNCS 15179-15180 constitutes the refereed proceedings of the 18th International Conference on Algorithmic Aspects in Information and Management, AAIM 2024, which took place virtually during September 21-23, 2024. The 45 full papers presented in these two volumes were carefully reviewed and selected from 76 submissions. The papers are organized in the following topical sections: Part I: Optimization and applications; submodularity, management and others, Part II: Graphs and networks; quantum and others.

This book focuses on the latest developments in computer science research. Chapter 1 dives into the historical twists and turns of our understanding of logical modalities that have been intricate and fascinating. Chapter 2 is aimed at new viewpoints on cybersecurity due to the rise in Artificial Intelligence (AI). Chapter 3 targets the deep learning model called Generative Adversarial Networks (GAN), and Generative AI (Gen AI). Chapter 4 focuses on the two-base algebraic system denoted as the Boolean algebra of meaning (BAM). Chapter 5 discusses Blockchain technology's role in cybersecurity to ensure the safety of the pharmaceutical industry supply chain. Chapter 6 is dedicated to the field and denotative methods of present-day voice cloning technology, as well as ethical implications related to the use of such tools. Chapter 7 explores the possibility of creating low-profile robot paraeducators to assist teachers and students. Finally, Chapter 8 presents a solution to a large percentage of dynamic random-access memories (DRAMs) that are not protected by error control codes (ECCs).

Computers and electronics have become so ubiquitous in daily life that we rarely give them a second thought these days, and even image processing is something else that we now largely take for granted. This book presents the proceedings of IPEC2024, the 5th Asia-Pacific Conference on Image Processing, Electronics and Computers, held from 12 to 14 April 2024 in Dalian, China. The aim of the IPEC conferences is to facilitate exchange and collaboration between academic researchers and industry, driving interdisciplinary integration and innovative development in image processing, electronics, and computer engineering. A total of 207 full paper submissions were received for the conference, of which 61 papers were ultimately selected for presentation at the conference and publication here after a rigorous review process which took into account significance, novelty, and technical quality. These are divided into 3 sections: Image Processing; Electronics and Automation; and Computer Application. Topics covered transcend the boundaries of traditional disciplines and reflect the interdisciplinary nature of the conference. They include graphics, computer vision, signal and information processing, distributed systems, software information engineering, computer science, electrical engineering, and automation and control engineering. The book provides a current overview of the latest developments, and will serve as a valuable resource for researchers, practitioners, and enthusiasts alike. It will be of interest to all those working in the fields of image processing, electronics, and computers.

This book constitutes the refereed proceedings of the 35th International Workshop on Combinatorial Algorithms, IWOCA 2024, held in Ischia, Italy, during July 1–3, 2024. The 40 full papers included in this book were carefully reviewed and selected from 110 submissions. The IWOCA conference series has provided an annual forum for researchers who design algorithms to address the myriad combinatorial problems underlying computer applications in science, engineering, and business.

This book constitutes the proceedings of the 45th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2024, held in Geneva, Switzerland, during June 26-28, 2024. The 19 full papers and 2 invited papers included in this book were carefully reviewed and selected from 42 submissions. They were organized in topical sections as follows: Business Process Modelling and Mining, Semantics and Complexity, Reachability, Verification and Model Checking, Applications and Tools.

This book constitutes the proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation, TAMC 2024, which was held in Hong Kong, China, during May 13–15, 2024. The 30 full papers presented in this book were carefully reviewed and selected from 69 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory, as well as their integration with machine learning theory and the foundations of artificial intelligence.

This book constitutes the proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, held in Cochem, Germany, in February 2024. The 33 full papers presented in this book were carefully reviewed and selected from 81 submissions. The book also contains one invited talk in full paper length. They focus on original research and challenges in foundations of computer science including algorithms, AI-based methods, computational complexity, and formal models.

This unique book provides a self-contained exposition of the theory of cellular automata on groups and explores its deep connections with recent developments in geometric and combinatorial group theory, amenability, symbolic dynamics, the algebraic theory of group rings, and other branches of mathematics and theoretical computer science. The topics treated include the Garden of Eden theorem for amenable groups, the Gromov–Weiss surjunctivity theorem, and the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. Entirely self-contained and now in its second edition, the volume includes 10 appendices and more than 600 exercises, the solutions of which are presented in the companion book Exercises in Cellular Automata and Groups (2023) by the same authors. It will appeal to a large audience, including specialists and newcomers to the field.

This two-volume set LNCS 14465-14466 constitutes the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, GD 2023, held in Isola delle Femmine, Palermo, Italy, in September 2023. The 31 full papers, 7 short papers, presented together with 2 invited talks, and one contest report, were thoroughly reviewed and selected from the 100 submissions. The abstracts of 11 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: beyond planarity; crossing numbers; linear layouts; geometric aspects; visualization challenges; graph representations; graph decompositions; topological aspects; parameterized complexity for drawings; planar graphs; frameworks; algorithmics.

This two-volume set LNCS 15179-15180 constitutes the refereed proceedings of the 18th International Conference on Algorithmic Aspects in Information and Management, AAIM 2024, which took place virtually during September 21-23, 2024. The 45 full papers presented in these two volumes were carefully reviewed and selected from 76 submissions. The papers are organized in the following topical sections: Part I: Optimization and applications; submodularity, management and others, Part II: Graphs and networks; quantum and others.

This volume constitutes the refereed proceedings of 17th International Symposium on Algorithmic Game Theory, SAGT 2024, held in Amsterdam, The Netherlands, during September 3–6, 2024. The 29 full papers included in this book were carefully reviewed and selected from 84 submissions. They were organized in topical sections as follows: matching; fair division and resource allocation; mechanism design; game theory and repeated games; pricing, revenue, and regulation; matroid theory in game theory; information sharing and decision making; computational complexity and resource allocation.

This book constitutes the refereed proceedings of the 25th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2024, held in Wrocław, Poland, during July 3–5, 2024. The 33 full papers presented were carefully reviewed and selected from 101 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

The 6-volume set LNAI 14645-14650 constitutes the proceedings of the 28th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2024, which took place in Taipei, Taiwan, during May 7–10, 2024. The 177 papers presented in these proceedings were carefully reviewed and selected from 720 submissions. They deal with new ideas, original research results, and practical development experiences from all KDD related areas, including data mining, data warehousing, machine learning, artificial intelligence, databases, statistics, knowledge engineering, big data technologies, and foundations.

This LNCS conference volume constitutes the proceedings of the 13th International Symposium, FoIKS 2024, in Sheffield, UK, in April 2024. The 18 full papers together with 3 short papers included in this volume were carefully reviewed and selected from 42 submissions.The Symposium focuses on fundamental aspect of information and knowledge systems, including submissions that apply ideas, theories, or methods from specific disciplines to information and knowledge systems. Examples of such disciplines are discrete mathematics, logic and algebra, model theory, databases, information theory, complexity theory, algorithmics and computation, statistics, and optimization.

The 7-volume set LNCS 14832 – 14838 constitutes the proceedings of the 24th International Conference on Computational Science, ICCS 2024, which took place in Malaga, Spain, during July 2–4, 2024. The 155 full papers and 70 short papers included in these proceedings were carefully reviewed and selected from 430 submissions. They were organized in topical sections as follows: Part I: ICCS 2024 Main Track Full Papers; Part II: ICCS 2024 Main Track Full Papers; Part III: ICCS 2024 Main Track Short Papers; Advances in High-Performance Computational Earth Sciences: Numerical Methods, Frameworks and Applications; Artificial Intelligence and High-Performance Computing for Advanced Simulations; Part IV: Biomedical and Bioinformatics Challenges for Computer Science; Computational Health; Part V: Computational Optimization, Modelling, and Simulation; Generative AI and Large Language Models (LLMs) in Advancing Computational Medicine; Machine Learning and Data Assimilation for Dynamical Systems; Multiscale Modelling and Simulation; Part VI: Network Models and Analysis: From Foundations to Artificial Intelligence; Numerical Algorithms and Computer Arithmetic for Computational Science; Quantum Computing; Part VII: Simulations of Flow and Transport: Modeling, Algorithms and Computation; Smart Systems: Bringing Together Computer Vision, Sensor Networks, and Artificial Intelligence; Solving Problems with Uncertainties; Teaching Computational Science

This book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18–20, 2024. The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.

This book constitutes the proceedings of the 21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2024, held in Uppsala, Sweden, during May 28–31, 2024.The 33 full papers and the 9 short papers presented in the proceedings were carefully reviewed and selected from a total of 104 submissions. The content of the papers focus on new techniques or applications in the area and foster the integration of techniques from different fields dealing with large and complex problems.

This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22–24, 2024. The 30 full papers included in this book were carefully reviewed and selected from 46 submissions. They were organized in topical sections as follows: integer programming; graph theory; parameterized algorithms; approximation algorithms; integer programming for machine learning; and applications.

The year 2022 marks the 100th birth anniversary of Kathleen Hylda Valerie Booth, who wrote the first assembly languageand designed the assembler and auto code for the first computer systems at Birkbeck College, University of London.She helped design three different machines including the ARC (Automatic Relay Calculator), SEC (Simple ElectronicComputer), and APE(X). School of Computer Science and Engineering, under the aegis of Lovely Professional University,pays homage to this great programmer of all times by hosting “BOOTH100”—6th International Conference on ComputingSciences.

This book constitutes the refereed proceedings of the 19th International Workshop on Modelling and Mining Networks, WAW 2024, held in Warsaw, Poland, during June 3–6, 2024. The 12 full papers presented in this book were carefully reviewed and selected from 19 submissions. The aim of this workshop was to further the understanding of networks that arise in theoretical as well as applied domains. The goal was also to stimulate the development of high-performance and scalable algorithms that exploit these networks.

The two-volume proceedings constitutes the refereed proceedings of the 24th International Conference on Progress in Cryptology, INDOCRYPT 2023, Goa, India, in December 2023. The 26 full papers were carefully reviewed and selected from 74 submissions. They are organized in topical sections as follows: Part I: Symmetric-key cryptography, Hash functions, Authenticated Encryption Modes; Elliptic curves, Zero-knowledge proof, Signatures; Attacks. Part II: Secure computation, Algorithm hardness, Privacy; Post-quantum cryptography.

This book contains the proceedings of the 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, held during June 20-22, 2023, in Garmisch-Partenkirchen, Germany. This successful series of international workshops is known to attract high-quality research on the theory and application of discrete algorithms, graphs, and combinatorial optimization in a wide sense. The papers collected in this book represent cutting-edge research by leading researchers and attract a broad readership in academia worldwide. The book is addressed to researchers and advanced students, but also to professionals in industry concerned with algorithm design and optimization problems in different areas of application.

This book constitutes the refereed proceedings of the 6th International Conference on Tools and Methods of Program Analysis, TMPA 2021, held in Tomsk, Russia, during November 25–27, 2021.The 15 full papers and 3 short papers included in this book were carefully reviewed and selected from 45 submissions. They focus on various aspects of application of modern methods of data science to the analysis of software quality.

This book constitutes the refereed proceedings of the 23rd International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2024, held in Omsk, Russia, during June 30 - July 6, 2024. The 30 full papers included in this book were carefully reviewed and selected from 79 submissions. This book also contains two invited talk. They were organized in topical sections as follows: mathematical programming; combinatorial optimization; game theory; and operations research.

This book constitutes the refereed proceedings of the 31th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024, held in Haifa, Israel in May 2024. The 24 full papers and 6 short papers presented in this book were carefully reviewed and selected from 49 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication.

Petri nets model concurrent and distributed systems where active components communicate through the production and absorption of various kinds of resources. Although the dynamic properties of such systems may be very complex, they may sometimes be connected to the static structure of a Petri net. Many properties are decidable, but their complexity may be huge. It is often opportune to restrict oneself to classes of systems, to partial algorithms, and to similar but simpler properties. Instead of analysing a given system, it is also possible to search for a system satisfying some desired properties by construction. This comprehensive textbook/reference presents and discusses these issues in-depth in the context of one of the most fundamental Petri net models, called place/transition nets. The presentation is fortified by means of many examples and worked exercises. Among topics addressed: • In which order may actions may be generated and scheduled? • What states and configurations may be reached in a concurrent system? • Which interesting classes of systems can be analysed relatively efficiently? • Is it possible to synthesise a system of some class from its behaviour? • How can systems be represented algebraically, compositionally, and concisely? This unique text, based on introductory as well as on advanced courses on distributed systems, will serve as an invaluable guide for students and (future) researchers interested in theoretical—as well as in practical—aspects of Petri nets and related system models. Eike Best has been a full professor (now retired) affiliated to Carl von Ossietzky Universität Oldenburg, Germany. Raymond Devillers has been a full professor (now retired) affiliated to Université Libre de Bruxelles, Belgium. The authors have a long record as collaborators in the fields of Petri nets and the semantics of concurrency.

This book constitutes the refereed joint proceedings of the 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and the 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, held in Fort Lauderdale, FL, USA, during January 8–10, 2024. The 14 full papers presented were carefully reviewed and selected from 25 submissions. The papers cover topics from AI, theoretical computer science, mathematics, medicine, robotics, defense, and security.