This book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016.The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research.
Sequences of radius "k" for complete bipartite graphs.- Approximate Association via Dissociation.- Geodetic convexity parameters for graphs with few short induced paths.- Weighted Ecient Domination for P5-Free and for P6-Free Graphs.- Saving colors and Max Coloring: some xed-parameter tractability results.- Finding Two Edge-Disjoint Paths with Length Constraints.- Packing and covering immersion models of planar subcubic graphs.- The maximum weight stable set problem in (P 6, bull)-free graphs.- Parameterized Power Vertex Cover.- Exhaustive generation of k-critical H-free graphs.- Induced separation dimension.- Tight Bounds for Gomory-Hu-like Cut Counting.- Eccentricity Approximating Trees: Extended Abstract.- Drawing Planar Graphs with Prescribed Face Areas.- Vertex Cover Structural Parameterization Revisited.- Distance-d Independent Set and other problems in graphs with "few" minimal separators.- Parameterized complexity of the MINCCA problem on graphs ofbounded decomposability.
- On edge intersection graphs of paths with 2 bends.- Almost Induced Matching: Linear Kernels and Parameterized Algorithms.- Parameterized vertex deletion problems for hereditary graph classes with a block property.- Harmonious Coloring: Parameterized Algorithms and Upper bounds.- On Directed Steiner Trees with Multiple Roots.- A Faster Parameterized Algorithm for Group Feedback Edge Set.- Sequence Hypergraphs.- On subgraphs of bounded degeneracy in hypergraphs.
