LEADER 04505nam  22007335  450 
001 996465412303316
005 20230329233531.0
010   $a3-662-53536-X
024 7 $a10.1007/978-3-662-53536-3
035   $a(CKB)3710000000872977
035   $a(DE-He213)978-3-662-53536-3
035   $a(MiAaPQ)EBC6288224
035   $a(MiAaPQ)EBC5586125
035   $a(Au-PeEL)EBL5586125
035   $a(OCoLC)960195809
035   $a(PPN)195511395
035   $a(EXLCZ)993710000000872977
100   $a20160927d2016      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aGraph-Theoretic Concepts in Computer Science$b[electronic resource] $e42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers /$fedited by Pinar Heggernes
205   $a1st ed. 2016.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2016.
215   $a1 online resource (X, 307 p. 51 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9941
300   $aIncludes index.
311   $a3-662-53535-1 
327   $aSequences 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.
330   $aThis 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. .
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9941
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aAlgorithms
606   $aArtificial intelligence?Data processing
606   $aComputer graphics
606   $aGeometry
606   $aDiscrete Mathematics in Computer Science
606   $aAlgorithms
606   $aData Science
606   $aComputer Graphics
606   $aGeometry
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aAlgorithms.
615  0$aArtificial intelligence?Data processing.
615  0$aComputer graphics.
615  0$aGeometry.
615 14$aDiscrete Mathematics in Computer Science.
615 24$aAlgorithms.
615 24$aData Science.
615 24$aComputer Graphics.
615 24$aGeometry.
676   $a511.5
702   $aHeggernes$b Pinar$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465412303316
996   $aGraph-Theoretic Concepts in Computer Science$92569248
997   $aUNISA