Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

48th International Workshop, WG 2022, Tübingen, Germany, June 22–24, 2022, Revised Selected Papers

  • Conference proceedings
  • © 2022

Overview

Editors:
  1. Michael A. Bekos

    1. University of Ioannina, Ioannina, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michael Kaufmann

    1. Universität Tübingen, Tübingen, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: WG 2022.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This LNCS 13453 constitutes the thoroughly refereed proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022.The 32 full papers presented in this volume were carefully reviewed and selected from a total of 96 submissions. The WG 2022 workshop aims to merge theory and practice by demonstrating how concepts from Graph Theory can be applied to various areas in Computer Science, or by extracting new graph theoretic problems from applications.

Similar content being viewed by others

Keywords

Table of contents (32 papers)

  1. Front Matter

    Pages i-xv
    Download chapter PDF

  2. Minimal Roman Dominating Functions: Extensions and Enumeration

    • Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann
    Pages 1-15

  3. Disjoint Compatibility via Graph Classes

    • Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber
    Pages 16-28

  4. Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)

    • Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
    Pages 29-42

  5. Twin-Width and Transductions of Proper k-Mixed-Thin Graphs

    • Jakub Balabán, Petr Hliněný, Jan Jedelský
    Pages 43-55

  6. Token Sliding on Graphs of Girth Five

    • Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz
    Pages 56-69

  7. Recognition of Linear and Star Variants of Leaf Powers is in P

    • Bergougnoux Benjamin, Svein Høgemo, Jan Arne Telle, Martin Vatshelle
    Pages 70-83

  8. Problems Hard for Treewidth but Easy for Stable Gonality

    • Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
    Pages 84-97

  9. Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

    • Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
    Pages 98-113

  10. An Algorithmic Framework for Locally Constrained Homomorphisms

    • Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
    Pages 114-128

  11. s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs

    • Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
    Pages 129-143

  12. Polychromatic Colorings of Unions of Geometric Hypergraphs

    • Vera Chekan, Torsten Ueckerdt
    Pages 144-157

  13. Kernelization for Feedback Vertex Set via Elimination Distance to a Forest

    • David Dekker, Bart M. P. Jansen
    Pages 158-172Open Access

  14. Finding k-Secluded Trees Faster

    • Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
    Pages 173-186Open Access

  15. On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy

    • Gabriel L. Duarte, Uéverton S. Souza
    Pages 187-200

  16. On the Lossy Kernelization for Connected Treedepth Deletion Set

    • Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan
    Pages 201-214

  17. Generalized \(k\)-Center: Distinguishing Doubling and Highway Dimension

    • Andreas Emil Feldmann, Tung Anh Vu
    Pages 215-229

  18. Extending Partial Representations of Circular-Arc Graphs

    • Jiří Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman
    Pages 230-243

  19. Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates

    • Mathew C. Francis, Atrayee Majumder, Rogers Mathew
    Pages 244-256

  20. Parameterized Complexity of Weighted Multicut in Trees

    • Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
    Pages 257-270
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Editors and Affiliations

  • University of Ioannina, Ioannina, Greece

    Michael A. Bekos

  • Universität Tübingen, Tübingen, Germany

    Michael Kaufmann

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation