Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Daniël Paulusma

    1. Durham University, Durham, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bernard Ries

    1. University of Fribourg, Fribourg, Switzerland

    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 14093)

Included in the following conference series:

Conference proceedings info: WG 2023.

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

Access this book

Log in via an institution
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

Table of contents (33 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Proportionally Fair Matching with Multiple Groups

    • Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov
    Pages 1-15

  3. Reconstructing Graphs from Connected Triples

    • Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens et al.
    Pages 16-29

  4. Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1

    • Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
    Pages 30-43

  5. Odd Chromatic Number of Graph Classes

    • Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos
    Pages 44-58

  6. Deciding the Erdős-Pósa Property in 3-Connected Digraphs

    • Julien Bensmail, Victor Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva
    Pages 59-71

  7. New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth

    • Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
    Pages 72-85

  8. Nonplanar Graph Drawings with k Vertices per Face

    • Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta et al.
    Pages 86-100

  9. Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)

    • Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová
    Pages 101-115

  10. Cutting Barnette Graphs Perfectly is Hard

    • Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
    Pages 116-129

  11. Metric Dimension Parameterized by Treewidth in Chordal Graphs

    • Nicolas Bousquet, Quentin Deschamps, Aline Parreau
    Pages 130-142

  12. Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs

    • Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
    Pages 143-156

  13. Generating Faster Algorithms for d-Path Vertex Cover

    • Radovan Červený, Ondřej Suchý
    Pages 157-171

  14. A New Width Parameter of Graphs Based on Edge Cuts: \(\alpha \)-Edge-Crossing Width

    • Yeonsu Chang, O-joung Kwon, Myounghwan Lee
    Pages 172-186

  15. Snakes and Ladders: A Treewidth Story

    • Steven Chaplick, Steven Kelk, Ruben Meuwese, Matúš Mihalák, Georgios Stamoulis
    Pages 187-200

  16. Parameterized Results on Acyclic Matchings with Implications for Related Problems

    • Juhi Chaudhary, Meirav Zehavi
    Pages 201-216

  17. \(\mathcal {P}\)-Matchings Parameterized by Treewidth

    • Juhi Chaudhary, Meirav Zehavi
    Pages 217-231

  18. Algorithms and Hardness for Metric Dimension on Digraphs

    • Antoine Dailly, Florent Foucaud, Anni Hakanen
    Pages 232-245

  19. Degreewidth: A New Parameter for Solving Problems on Tournaments

    • Tom Davot, Lucas Isenmann, Sanjukta Roy, Jocelyn Thiebaut
    Pages 246-260

  20. Approximating Bin Packing with Conflict Graphs via Maximization Techniques

    • Ilan Doron-Arad, Hadas Shachnai
    Pages 261-275
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

About this book

This volume constitutes the thoroughly refereed proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023.
The 33 full papers presented in this volume were carefully reviewed and selected from a total of 116 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.

Editors and Affiliations

  • Durham University, Durham, UK

    Daniël Paulusma

  • University of Fribourg, Fribourg, Switzerland

    Bernard Ries

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation