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 book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007.

The 30 revised full papers presented together with 1 invited paper were carefully selected from 99 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.

This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001.
The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and combinatorial optimization. Divided into 11 cohesive sections, the handbook's 44 chapters focus on graph theory, combinatorial optimization, and algorithmic issues. The book provides readers with the algorithmic and theoretical foundations to: Understand phenomena as shaped by their graph structures Develop needed algorithmic and optimization tools for the study of graph structures Design and plan graph structures that lead to certain desirable behavior With contributions from more than 40 worldwide experts, this handbook equips readers with the necessary techniques and tools to solve problems in a variety of applications. Readers gain exposure to the theoretical and algorithmic foundations of a wide range of topics in graph theory and combinatorial optimization, enabling them to identify (and hence solve) problems encountered in diverse disciplines, such as electrical, communication, computer, social, transportation, biological, and other networks.

This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lubeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.

Graphen sind ein sehr haufig benutztes Modell bei der Beschreibung vielfaltiger struk- tureller Zusammenhange, so z. B. zur Informationsubertragung in Kommunikations- netzwerken, zum Transport von Waren oder zur Beschreibung hierarchischer Struktu- ren. Die Behandlung dieser Modelle mit den Mitteln der algorithmischen Graphentheorie stellt ein wichtiges Teilgebiet der Mathematik und Informatik dar. Das vorliegende Lehrbuch vermittelt eine Einfuhrung in dieses sich rasch entwickelnde Forschungsgebiet, wobei lediglich einfache Grundkenntnisse in Mathematik und Infor- matik vorausgesetzt werden, die i. a. im Grundstudium erworben werden. Zum Thema "Graphen und Algorithmen" gibt es bereits einige Lehrbucher, insbeson- dere in englischer Sprache. Da das Entwicklungstempo in dem ausgewahlten Gebiet jedoch sehr hoch ist, erscheint es sinnvoll, von Zeit zu Zeit die Darstellung klassischer Gebiete durch die Darstellung ausgewahlter Spezialgebiete zu erganzen. Dies geschieht in dem vorliegenden Lehrbuch. Die ersten Kapitel sind klassischen Gebieten gewidmet: - Euler- und Hamiltonkreise - Durchsuchen von Graphen - Minimalgeruste, greedy-Algorithmus und Matroide - Kurzeste Wege - Maximalfluss in Netzwerken - Unabhangige Knoten- und Kantenmengen (Farbungen, "matchings") Die letzten beiden Kapitel beschreiben neuere Ergebnisse aus den 80er und 90er Jah- ren, die in Lehrbuchform noch nicht erschienen sind und einen zentralen Aspekt der algorithmischen Graphentheorie darstellen, namlich - Graphen und Hypergraphen mit Baumstruktur (die eine Verallgemeinerung von Baumen darstellen) sowie - algorithmischer Nutzen dieser Strukturen 6 Im Unterschied zu bereits vorhandenen Lehrbuchern werden mehr die Struktureigen- schaften von Graphen, die oftmals die Grundlage der Effizienz von Algorithmen bilden, und weniger die begleitenden Datenstrukturen der Algorithmen betont.