Graph-Theoretic Concepts in Computer Science 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers /

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...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Heggernes, Pinar. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
Edition:1st ed. 2016.
Series:Theoretical Computer Science and General Issues ; 9941
Subjects:
Online Access:https://doi.org/10.1007/978-3-662-53536-3
LEADER 04674nam a22005895i 4500
001 978-3-662-53536-3
003 DE-He213
005 20210624234555.0
007 cr nn 008mamaa
008 160927s2016 gw | s |||| 0|eng d
020 |a 9783662535363  |9 978-3-662-53536-3 
024 7 |a 10.1007/978-3-662-53536-3  |2 doi 
050 4 |a QA76.9.M35  
072 7 |a PBD  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a PBD  |2 thema 
072 7 |a UYAM  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Graph-Theoretic Concepts in Computer Science  |h [electronic resource] :  |b 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers /  |c edited by Pinar Heggernes. 
250 |a 1st ed. 2016. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2016. 
300 |a X, 307 p. 51 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 9941 
505 0 |a 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 of bounded 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. 
520 |a 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. . 
650 0 |a Computer science—Mathematics. 
650 0 |a Algorithms. 
650 0 |a Data structures (Computer science). 
650 0 |a Computer graphics. 
650 0 |a Geometry. 
650 1 4 |a Discrete Mathematics in Computer Science.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I17028 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I16021 
650 2 4 |a Data Structures.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I15017 
650 2 4 |a Computer Graphics.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I22013 
650 2 4 |a Geometry.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M21006 
650 2 4 |a Algorithms.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M14018 
700 1 |a Heggernes, Pinar.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783662535356 
776 0 8 |i Printed edition:  |z 9783662535370 
830 0 |a Theoretical Computer Science and General Issues ;  |v 9941 
856 4 0 |u https://doi.org/10.1007/978-3-662-53536-3 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)