/ DirectedGraphs / DiscreteMathematics / Diskrete Mathematik / Grafikprogrammierung / graphalgorithmsanalysis / graphicmethods / graphtheory / Informationstheorie / MathematicalOptimization / Mathematics / Mathematik für Informatiker / polynomialapproximation / problems,reductionsandcompleteness / signalprocessing / Theoryofcomputation / weightedgraph

The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawingand graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic and

randomized algorithms; and streaming algorithms.