Mathematics

Graph Transformation

This book constitutes the refereed proceedings of the 18th International Conference on Graph Transformation, ICGT 2025, held in Koblenz, Germany, during June 11-12, 2025.The 10 full papers and 1 short paper included in this book were carefully reviewed and selected from 19 submissions.

1. Walter Hower

Discrete Mathematics

Walter Hower was born into a farming family. After Kindergarten and primary as well as secondary school he attended the high school – and enjoyed his favourite subject Mathematics. After his military period as air force NATO soldier he studied Computer Science (including the minor Economics) – with the main focus on Artificial Intelligence – at the University of Kaiserslautern, with a really heavy pillar on Mathematics (incl. Mathematik für Informatiker II [Prof. Dr. Heinz Lüneburg]). Already at that time he thought about the need or an alternative to present this difficult material – the inspiration for this book. Under supervision of Prof. PhD Jörg Siekmann he obtained the university (master) degree "Diplom-Informatiker". Later on, he worked as research assistant under the guidance of Prof. Dr. W. Bibel and as PhD candidate in the group of Prof. Dr. Manfred Rosendahl, where he obtained the degree "Dr. rer. nat." for his doctoral thesis "On constraint satisfaction and computer-aided layout design". Immediately afterwards, Dr. Hower accepted the offer by Prof. PhD Jim Bowen to head a research group at University College Cork, National University of Ireland, where he invigorates an expert team on Constraint Processing – which finally evolved into the famous Cork Constraint Computation Centre. After a period in research labs and business companies, since more than 20 years the author now works as professor for Computer Science and Fundamentals of Mathematics; he can be reached as follows: Albstadt-Sigmaringen University, Fakultät Informatik, Poststr. 6, D-72458 Albstadt-Ebingen, [email protected]. Prof. Dr. Hower received the Teaching Prize 2006 of the state Baden-Württemberg and germany-wide the 3rd place Professor of the Year in Engineering / Computer Science in 2009. Scientific activities include: A Lattice-based Constraint Formalism, First Australian Knowledge Engineering Congress, Workshop on AI & Creativity, Melbourne, Australia, March 14/15, 1989; The Relaxation of Unsolvable CSPs – General Problem Formulation and Specific Illustration in the Scheduling Domain, IJCAI-89 Workshop on Constraint Processing, Detroit, USA, August 20, 1989; Parallel global constraint satisfaction, IJCAI-91 Workshop on Parallel Processing for Artificial Intelligence (PPAI-91), Darling Harbour, Sydney, New South Wales, Australia, August 24/25, 1991; Notes on complexity issues within constraint satisfaction, In IJCAI-93 Workshop on Knowledge-based Production Planning, Scheduling and Control, pp. 179–186, Chambéry, Savoie, France, August 29, 1993 (co-author); Constraint Processing – Part I/II, Department of Mathematics and Computing Science, The University of the South Pacific, Suva, Fiji, March 29/30, 1994; On an improvement of a global algorithm for the NP-complete constraint satisfaction problem, International Computer Science Institute, Berkeley, California, USA, June 21, 1996; Computational Complexity in Constraint-based Combinatorial Auctions, INFORMATIK 2008, 38. Jahrestagung der Gesellschaft für Informatik, München, September 8–13, 2008 (co-author); On the nth doorkeeper of the pleasure garden in Fibonacci’s Liber Abbaci – Proof techniques in Discrete Mathematics on a generalization of a problem possibly from 1202, https://educ.ethz.ch/unterrichtsmaterialien/informatik/recurrence-relations.html, Zürich, Switzerland, 2008; Boolean Algebra and Probability Theory, EU Erasmus guest professor, Angers, France, November 2008; Reviewer for the Engineering and Physical Sciences Research Council, UK, 1996. His research interests are combinatorial optimization as well as cooperative and non-cooperative game theory. A lively insight into presentations of the author (on the identical cardinality of N with just the natural even numbers as well as on the funny Monty Hall problem) could be possible – although in German – via https://www.youtube.com/watch?v=zeCCMOHVS3w.

1. Benoît Gaüzère

Graph-Based Representations in Pattern Recognition

This book constitutes the refereed proceedings of the 14th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2025, held in Caen, France, in June 2025. The 25 full papers presented here were carefully reviewed and selected from 33 submissions.

1. Kenneth Lange

Algorithms from The Book

Kenneth Lange is the Rosenfeld Professor of Computational Genetics at UCLA and a faculty member in the Departments of Computational Medicine, Human Genetics, and Statistics. At various times during his career, he has held appointments at the University of New Hampshire, MIT, Harvard, the University of Michigan, the University of Helsinki, and Stanford. He is a fellow of the American Statistical Association, the Institute of Mathematical Statistics, and the American Institute for Medical and Biomedical Engineering. He won the Snedecor Award from the Joint Statistical Societies in 1993 and gave a platform presentation at the 2015 International Congress of Mathematicians. He was elected to the US National Academy of Sciences in 2020. His previously published books include Mathematical and Statistical Methods for Genetic Analysis, Numerical Analysis for Statisticians, Applied Probability, Optimization, and MM Optimization Algorithms. His research interests include human genetics, population modeling, cancer modeling, biomedical imaging, computational statistics, optimization theory, and applied stochastic processes.

Neutrosophic Paradigms: Advancements in Decision Making and Statistical Analysis

This book offers a comprehensive reference guide to neutrosophic theory and its applications in decision-making in numerous disciplines, ranging from business, economics and management, computer science, health and environmental sciences, and many others.

Integer Programming and Combinatorial Optimization

This book constitutes the refereed proceedings of the 26th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2025, held in Baltimore, MD, USA, during June 11–13, 2025. The 33 papers presented here were carefully reviewed and selected from 109 submissions.