LEADER 04672nam 22007095 450 001 996466363303316 005 20230330063112.0 010 $a3-030-00256-X 024 7 $a10.1007/978-3-030-00256-5 035 $a(CKB)4100000006098225 035 $a(DE-He213)978-3-030-00256-5 035 $a(MiAaPQ)EBC6302941 035 $a(PPN)23053855X 035 $a(EXLCZ)994100000006098225 100 $a20180901d2018 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] $e44th International Workshop, WG 2018, Cottbus, Germany, June 27?29, 2018, Proceedings /$fedited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XIII, 384 p. 102 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11159 311 $a3-030-00255-1 327 $aOn Dispersable Book Embeddings -- Characterising AT-free Graphs with BFS -- Edge Partitions of Optimal 2-plane and 3-plane Graphs -- On Minimum Connecting Transition Sets in Graphs -- Recognizing Hyperelliptic Graphs in Polynomial Time -- On Directed Feedback Vertex Set Parameterized by Treewidth -- Optimality Program in Segment and String Graphs -- Anagram-Free Chromatic Number is Not Pathwidth-Bounded -- Tight Lower Bounds for the Number of st-Cuts -- Sub-exponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity -- Computing Small Pivot-Minors -- Saving Probe Bits by Cube Domination -- Graph Amalgamation under Logical Constraints -- Optimal General Matchings -- Quasimonotone Graphs -- Equiangular Polygon Contact Representations -- Temporal Graph Classes: A View Through Temporal Separators -- Covering A Graph with Nontrivial Vertex-disjoint Paths: Existence and Optimization -- On the Relation of Strong Triadic Closure and Cluster Deletion -- On Perfect Linegraph Squares -- On Weak Isomorphism of Rooted Vertex-Colored Graphs -- Connected Vertex Cover for (sP_1+P_5)-Free Graphs -- Structurally Parameterized d-Scattered Set -- Popular Matchings of Desired Size -- Convexity-Increasing Morphs of Planar Graphs -- Treedepth Bounds in Linear Colorings -- An Improved FPT lgorithm for Independent Feedback Vertex Set -- Construction and Local Routing for Angle-Monotone Graphs -- Characterization and Recognition of Tree 3-Spanner dmissible Directed Path Graphs of Diameter Three. . 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11159 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer arithmetic and logic units 606 $aComputer graphics 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aData Science 606 $aArithmetic and Logic Structures 606 $aComputer Graphics 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer arithmetic and logic units. 615 0$aComputer graphics. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aArithmetic and Logic Structures. 615 24$aComputer Graphics. 676 $a511.5 702 $aBrandstädt$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKöhler$b Ekkehard$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMeer$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466363303316 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNISA