Graph-theoretic concepts in computer science : 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised selected papers / Isolde Adler, Haiko Müller (eds.).Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 12301. | Lecture notes in computer science. Advanced research in computing and software science. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham : Springer, 2020Description: 1 online resource (xv, 416 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783030604400; 3030604403Other title: WG 2020Subject(s): Graph theory -- Data processing -- Congresses | Computer science -- Mathematics | Algorithms | Data structures (Computer science) | Graph theory -- Data processing | Algorithms | Computer science -- Mathematics | Data structures (Computer science)Genre/Form: Conference papers and proceedings. | Electronic books. | Electronic books. Additional physical formats: Print version:: Graph-theorectic concepts in computer science.DDC classification: 004.0151 LOC classification: QA166QA76.9.M35Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
This 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.
Combinatorial 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.