LEADER 04778nam 22006855 450 001 9910427706603321 005 20251225183614.0 010 $a3-030-60440-3 024 7 $a10.1007/978-3-030-60440-0 035 $a(CKB)4100000011508789 035 $a(DE-He213)978-3-030-60440-0 035 $a(MiAaPQ)EBC6381488 035 $a(PPN)254946518 035 $a(EXLCZ)994100000011508789 100 $a20201015d2020 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 $e46th International Workshop, WG 2020, Leeds, UK, June 24?26, 2020, Revised Selected Papers /$fedited by Isolde Adler, Haiko Müller 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (XV, 416 p. 50 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12301 300 $aIncludes index. 311 08$a3-030-60439-X 327 $aCombinatorial Bounds for Conflict-free Coloring on Open Neighborhoods -- Guarding Quadrangulations and Stacked Triangulations with Edges -- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space -- Parameterized Inapproximability of Independent Set in H-Free Graphs -- Clique-Width of Point Configurations -- On the complexity of finding large odd induced subgraphs and odd colorings -- Knot Diagrams of Treewidth Two -- Treewidth versus clique number in graph classes with a forbidden structure -- Graph Isomorphism Restricted by Lists -- Clique-Width: Harnessing the Power of Atoms -- Edge elimination and weighted graph classes -- Well-partitioned chordal graphs: obstruction set and disjoint paths -- Plattenbauten: Touching Rectangles in Space Universal Geometric Graphs -- Computing Subset Transversals in H-Free Graphs -- Feedback Edge Sets in Temporal Graphs -- On flips in planar matchings -- Degree Distribution for Duplication-Divergence Graphs: Large Deviations -- On Finding Balanced Bicliques via Matchings -- Finding large matchings in 1-planar graphs of minimum degree 3 -- Strong cliques in diamond-free graphs -- Recognizing k-Clique Extendible Orderings -- Linear-Time Recognition of Double-Threshold Graphs -- Characterization and Linear-time Recognition of Paired Threshold Graphs -- Drawing Graphs as Spanners -- Inserting one edge into a simple drawing is hard -- Bitonic st-orderings for Upward Planar Graphs: The Variable Embedding Setting -- 2.5-Connectivity: Unique Components, Critical Graphs, and Applications Stable Structure on Safe Set Problems in Vertex-weighted Graphs II ? Recognition and Complexity -- The linear arboricity conjecture for 3-degenerate graphs -- Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width -- Weighted Additive Spanners. 330 $aThis book constitutes the revised papers of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, held in Leeds, UK, in June 2020. The workshop was held virtually due to the COVID-19 pandemic. The 32 full papers presented in this volume were carefully reviewed and selected from 94 submissions. They cover a wide range of areas, aiming to present emerging research results and to identify and explore directions of future research of concepts on graph theory and how they can be applied to various areas in computer science. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12301 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aMathematics$xData processing 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aData Science 606 $aSymbolic and Algebraic Manipulation 606 $aComputational Mathematics and Numerical Analysis 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aMathematics$xData processing. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aComputational Mathematics and Numerical Analysis. 676 $a004.0151 702 $aMuller$b Haiko 702 $aAdler$b Isolde 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910427706603321 996 $aGraph-Theoretic Concepts in Computer Science$92569248 997 $aUNINA