Skip to main content
Book cover
  • Conference proceedings
  • © 2017

Graph-Theoretic Concepts in Computer Science

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

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: Theoretical Computer Science and General Issues (LNTCS, volume 10520)

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

Conference proceedings info: WG 2017.

Sections

eBook USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-68705-6
  • 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 84.99
Price excludes VAT (USA)
Learn about institutional subscriptions

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

Table of contents (32 papers)

  1. Front Matter

    Pages I-XIII
    PDF

  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

  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

Back to top

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.

 

Back to top

Keywords

  • graphs and networks
  • graph algorithms
  • structural graph theory
  • graph grammars and graph rewriting
  • graph drawing
  • random graphs
  • parametrized complexity
  • approximation algorithms
  • algorithms
  • fixed parameter tractability
  • graph algorithms analyisis
  • algorithm analysis and problem complexity
  • data structures
Back to top

Editors and Affiliations

  • Utrecht University, Utrecht, The Netherlands

    Hans L. Bodlaender

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

    Gerhard J. Woeginger

Back to top

Bibliographic Information

Back to top
Access via your institution
eBook USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-68705-6
  • 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 84.99
Price excludes VAT (USA)
Learn about institutional subscriptions