Skip to main content
  • Conference proceedings
  • © 2020

Graph-Theoretic Concepts in Computer Science

46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12301)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science

Conference proceedings info: WG 2020.

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-60440-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (32 papers)

  1. Front Matter

    Pages i-xv
  2. Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods

    • Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
    Pages 1-13
  3. Guarding Quadrangulations and Stacked Triangulations with Edges

    • Paul Jungeblut, Torsten Ueckerdt
    Pages 14-26
  4. Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space

    • Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, Karol Węgrzycki
    Pages 27-39
  5. Parameterized Inapproximability of Independent Set in H-Free Graphs

    • Pavel Dvořák, Andreas Emil Feldmann, Ashutosh Rai, Paweł Rzążewski
    Pages 40-53
  6. Clique-Width of Point Configurations

    • Onur Çağırıcı, Petr Hliněný, Filip Pokrývka, Abhisekh Sankaran
    Pages 54-66
  7. Knot Diagrams of Treewidth Two

    • Hans L. Bodlaender, Benjamin Burton, Fedor V. Fomin, Alexander Grigoriev
    Pages 80-91
  8. Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure

    • Clément Dallard, Martin Milanič, Kenny Štorgel
    Pages 92-105
  9. Graph Isomorphism Restricted by Lists

    • Pavel Klavík, Dušan Knop, Peter Zeman
    Pages 106-118
  10. Clique-Width: Harnessing the Power of Atoms

    • Konrad K. Dabrowski, Tomáš Masařík, Jana Novotná, Daniël Paulusma, Paweł Rzążewski
    Pages 119-133
  11. Edge Elimination and Weighted Graph Classes

    • Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač et al.
    Pages 134-147
  12. Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths

    • Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima
    Pages 148-160
  13. Plattenbauten: Touching Rectangles in Space

    • Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
    Pages 161-173
  14. Universal Geometric Graphs

    • Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
    Pages 174-186
  15. Computing Subset Transversals in H-Free Graphs

    • Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
    Pages 187-199
  16. Feedback Edge Sets in Temporal Graphs

    • Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken
    Pages 200-212
  17. On Flips in Planar Matchings

    • Marcel Milich, Torsten Mütze, Martin Pergel
    Pages 213-225
  18. Degree Distribution for Duplication-Divergence Graphs: Large Deviations

    • Alan Frieze, Krzysztof Turowski, Wojciech Szpankowski
    Pages 226-237
  19. On Finding Balanced Bicliques via Matchings

    • Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo
    Pages 238-247

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

    46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers

About this book

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.

Keywords

  • approximation algorithms
  • approximation theory
  • artificial intelligence
  • bipartite graphs
  • directed graphs
  • graph g
  • graph theory
  • graphic methods
  • numerical model
  • parameterization
  • planar graph
  • polynomial approximation
  • sensor networks
  • weighted graph
  • wireless sensor networks
  • wireless telecommunication systems
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • University of Leeds, Leeds, UK

    Isolde Adler, Haiko Müller

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-60440-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)