Klaus Meer – författare

Optimization Theory is becoming a more and more important mathematical as well as interdisciplinary area, especially in the interplay between mathematics and many other sciences like computer science, physics, engineering, operations research, etc. This volume gives a comprehensive introduction into the theory of (deterministic) optimization on an advanced undergraduate and graduate level. One main feature is the treatment of both continuous and discrete optimization at the same place. This allows to study the problems under different points of view, supporting a better understanding of the entire field. Audience: The book can be adapted well as an introductory textbook into optimization theory on a basis of a two semester course; however, each of its parts can also be taught separately. Many exercises are included to increase the reader's understanding.

Optimization Theory is becoming a more and more important mathematical as well as interdisciplinary area, especially in the interplay between mathematics and many other sciences like computer science, physics, engineering, operations research, etc. This volume gives a comprehensive introduction into the theory of (deterministic) optimization on an advanced undergraduate and graduate level. One main feature is the treatment of both continuous and discrete optimization at the same place. This allows to study the problems under different points of view, supporting a better understanding of the entire field. Audience: The book can be adapted well as an introductory textbook into optimization theory on a basis of a two semester course; however, each of its parts can also be taught separately. Many exercises are included to increase the reader's understanding.

This book constitutes the revised selected papers of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2018, held  in Cottbus, Germany, in June 2018.The 30 full papers presented in this volume were carefully reviewed and selected from 66 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.

This festschrift honors Johann A. Makowsky on the occasion of his 75th birthday. Gathering 24 research articles authored by scientific companions, friends, and colleagues, it covers a broad variety of areas to which Johann A. Makowsky made significant contributions himself. These include several areas of mathematical logic and its relevance for Computer Science including Graph polynomials, Algorithms for graph invariants, Algorithms and descriptive complexity theory, complexity of real and algebraic computations, Mathematical logic, Model theory, Design and theory of databases, Logic in computer science and AI and Logic programming. The volume is enriched with 4 biographical essays, and two contributions by the celebrant himself.