Skip to main content
  • Conference proceedings
  • © 2016

Graph-Theoretic Concepts in Computer Science

42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers

Editors:

Conference proceedings info: WG 2016.

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-662-53536-3
  • 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 79.99
Price excludes VAT (USA)

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

Table of contents (26 papers)

  1. Front Matter

    Pages I-X
  2. Sequences of Radius k for Complete Bipartite Graphs

    • Michał Dębski, Zbigniew Lonc, Paweł Rzążewski
    Pages 1-12
  3. Approximate Association via Dissociation

    • Jie You, Jianxin Wang, Yixin Cao
    Pages 13-24
  4. Geodetic Convexity Parameters for Graphs with Few Short Induced Paths

    • Mitre C. Dourado, Lucia D. Penso, Dieter Rautenbach
    Pages 25-37
  5. Finding Two Edge-Disjoint Paths with Length Constraints

    • Leizhen Cai, Junjie Ye
    Pages 62-73
  6. Packing and Covering Immersion Models of Planar Subcubic Graphs

    • Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
    Pages 74-84
  7. The Maximum Weight Stable Set Problem in ( \(P_6\) , bull)-Free Graphs

    • Frédéric Maffray, Lucas Pastor
    Pages 85-96
  8. Parameterized Power Vertex Cover

    • Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
    Pages 97-108
  9. Exhaustive Generation of k-Critical \({\mathcal H}\) -Free Graphs

    • Jan Goedgebeur, Oliver Schaudt
    Pages 109-120
  10. Induced Separation Dimension

    • Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart
    Pages 121-132
  11. Tight Bounds for Gomory-Hu-like Cut Counting

    • Rajesh Chitnis, Lior Kamma, Robert Krauthgamer
    Pages 133-144
  12. Eccentricity Approximating Trees

    • Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
    Pages 145-157
  13. Vertex Cover Structural Parameterization Revisited

    • Fedor V. Fomin, Torstein J. F. Strømme
    Pages 171-182
  14. Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability

    • Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
    Pages 195-206
  15. On Edge Intersection Graphs of Paths with 2 Bends

    • Martin Pergel, Paweł Rzążewski
    Pages 207-219

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

About this book

This book constitutes revised selected papers from the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2016, held in Istanbul, Turkey, in June 2016.
The 25 papers presented in this volume were carefully reviewed and selected from 74 submissions.The WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new graph problems from applications. Their goal is to present new research results and to identify and explore directions of future research. 

Keywords

  • algorithm analysis
  • algorithm engineering
  • complexity theory
  • graph theory
  • theoretical computer science
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • University of Bergen, Bergen, Norway

    Pinar Heggernes

Bibliographic Information

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-662-53536-3
  • 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 79.99
Price excludes VAT (USA)