Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Łukasz Kowalik

    1. University of Warsaw, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michał Pilipczuk

    1. University of Warsaw, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Paweł Rzążewski

    1. Warsaw University of Technology, Warsaw, Poland

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

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

Included in the following conference series:

Conference proceedings info: WG 2021.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 99.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 (32 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set

    • Huib Donkers, Bart M. P. Jansen
    Pages 1-14Open Access

  3. Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation

    • Hans L. Bodlaender
    Pages 15-27

  4. Block Elimination Distance

    • Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
    Pages 28-38

  5. On Fair Covering and Hitting Problems

    • Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
    Pages 39-51

  6. On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

    • Isja Mannens, Jesper Nederlof, Céline Swennenhuis, Krisztina Szilágyi
    Pages 52-79

  7. FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More

    • Bart M. P. Jansen, Jari J. H. de Kroon
    Pages 80-93Open Access

  8. Disjoint Stable Matchings in Linear Time

    • Aadityan Ganesh, H. V. Vishwa Prakash, Prajakta Nimbhorkar, Geevarghese Philip
    Pages 94-105

  9. Complementation in T-perfect Graphs

    • Yixin Cao, Shenghua Wang
    Pages 106-117

  10. On Subgraph Complementation to H-free Graphs

    • Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
    Pages 118-129

  11. Odd Cycle Transversal in Mixed Graphs

    • Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh
    Pages 130-142

  12. Preventing Small \(\mathbf {(s,t)}\)-Cuts by Protecting Edges

    • Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
    Pages 143-155

  13. Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel

    • Christophe Crespelle, Benjamin Gras, Anthony Perez
    Pages 156-168

  14. A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs

    • Sylwester Swat, Marta Kasprzak
    Pages 169-181

  15. The Perfect Matching Cut Problem Revisited

    • Van Bang Le, Jan Arne Telle
    Pages 182-194

  16. The Complexity of Gerrymandering over Graphs: Paths and Trees

    • Matthias Bentert, Tomohiro Koana, Rolf Niedermeier
    Pages 195-206

  17. Feedback Vertex Set on Hamiltonian Graphs

    • Dario Cavallaro, Till Fluschnik
    Pages 207-218

  18. Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

    • Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier
    Pages 219-231

  19. The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

    • Nils Vortmeier, Ioannis Kokkinis
    Pages 232-244

  20. Linearizable Special Cases of the Quadratic Shortest Path Problem

    • Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
    Pages 245-256
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

About this book

This book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 23–25, 2021. The conference was planned to take place in Warsaw, Poland, but changed to an online event due to the COVID-19 pandemic. 

The 30 full papers included in this volume were carefully reviewed and selected from 73 submissions. The conference 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.


Chapter “Bears with Hats and Independence Polynomials” is are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.



Chapters 1, 6, and 22 are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.



Editors and Affiliations

  • University of Warsaw, Warsaw, Poland

    Łukasz Kowalik, Michał Pilipczuk

  • Warsaw University of Technology, Warsaw, Poland

    Paweł Rzążewski

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation