Skip to main content
SpringerLink
Log in
Book cover

Graph-Theoretic Concepts in Computer Science

43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Hans L. Bodlaender

    1. Utrecht University, Utrecht, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gerhard J. Woeginger

    1. Rheinisch-Westfälische Technische Hochschule Aachen, Aachen, 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 10520)

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

Included in the following conference series:

Conference proceedings info: WG 2017.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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. Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions

    • Remco van der Hofstad
    Pages 1-17

  3. On Bubble Generators in Directed Graphs

    • Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto et al.
    Pages 18-31

  4. Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard

    • Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad
    Pages 32-44

  5. Hierarchical Partial Planarity

    • Patrizio Angelini, Michael A. Bekos
    Pages 45-58

  6. On the Relationship Between k-Planar and k-Quasi-Planar Graphs

    • Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo et al.
    Pages 59-74

  7. Extension Complexity of Stable Set Polytopes of Bipartite Graphs

    • Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
    Pages 75-87

  8. On the Number of Labeled Graphs of Bounded Treewidth

    • Julien Baste, Marc Noy, Ignasi Sau
    Pages 88-99

  9. Uniquely Restricted Matchings and Edge Colorings

    • Julien Baste, Dieter Rautenbach, Ignasi Sau
    Pages 100-112

  10. Defective Coloring on Classes of Perfect Graphs

    • Rémy Belmonte, Michael Lampis, Valia Mitsou
    Pages 113-126

  11. Token Sliding on Chordal Graphs

    • Marthe Bonamy, Nicolas Bousquet
    Pages 127-139

  12. Computing Maximum Cliques in \(B_2\)-EPG Graphs

    • Nicolas Bousquet, Marc Heinrich
    Pages 140-152

  13. Intersection Graphs of Rays and Grounded Segments

    • Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber
    Pages 153-166

  14. On H-Topological Intersection Graphs

    • Steven Chaplick, Martin Töpfer, Jan Voborník, Peter Zeman
    Pages 167-179

  15. The Hardness of Embedding Grids and Walls

    • Yijia Chen, Martin Grohe, Bingkai Lin
    Pages 180-192

  16. Approximately Coloring Graphs Without Long Induced Paths

    • Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
    Pages 193-205

  17. New and Simple Algorithms for Stable Flow Problems

    • Ágnes Cseh, Jannik Matuschke
    Pages 206-219

  18. Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes

    • Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
    Pages 220-233

  19. Finding Cut-Vertices in the Square Roots of a Graph

    • Guillaume Ducoffe
    Pages 234-248

  20. The Minimum Shared Edges Problem on Grid-Like Graphs

    • Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
    Pages 249-262
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

About this book

This book constitutes the revised selected papers of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2017, held in Eindhoven, The Netherlands, in June 2017.

The 31 full papers presented in this volume were carefully reviewed and selected
from 71 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.

 

Editors and Affiliations

  • Utrecht University, Utrecht, The Netherlands

    Hans L. Bodlaender

  • Rheinisch-Westfälische Technische Hochschule Aachen, Aachen, Germany

    Gerhard J. Woeginger

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation