Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

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

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Pinar Heggernes

    1. University of Bergen, Bergen, Norway

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

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

Included in the following conference series:

Conference proceedings info: WG 2016.

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 (26 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  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. Weighted Efficient Domination for \(P_6\)-Free and for \(P_5\)-Free Graphs

    • Andreas Brandstädt, Raffaele Mosca
    Pages 38-49

  6. Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results

    • Bruno Escoffier
    Pages 50-61

  7. Finding Two Edge-Disjoint Paths with Length Constraints

    • Leizhen Cai, Junjie Ye
    Pages 62-73

  8. Packing and Covering Immersion Models of Planar Subcubic Graphs

    • Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
    Pages 74-84

  9. The Maximum Weight Stable Set Problem in (\(P_6\), bull)-Free Graphs

    • Frédéric Maffray, Lucas Pastor
    Pages 85-96

  10. Parameterized Power Vertex Cover

    • Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
    Pages 97-108

  11. Exhaustive Generation of k-Critical \({\mathcal H}\)-Free Graphs

    • Jan Goedgebeur, Oliver Schaudt
    Pages 109-120

  12. Induced Separation Dimension

    • Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart
    Pages 121-132

  13. Tight Bounds for Gomory-Hu-like Cut Counting

    • Rajesh Chitnis, Lior Kamma, Robert Krauthgamer
    Pages 133-144

  14. Eccentricity Approximating Trees

    • Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
    Pages 145-157

  15. Drawing Planar Graphs with Prescribed Face Areas

    • Linda Kleist
    Pages 158-170

  16. Vertex Cover Structural Parameterization Revisited

    • Fedor V. Fomin, Torstein J. F. Strømme
    Pages 171-182

  17. On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators

    • Pedro Montealegre, Ioan Todinca
    Pages 183-194

  18. 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

  19. On Edge Intersection Graphs of Paths with 2 Bends

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

  20. Almost Induced Matching: Linear Kernels and Parameterized Algorithms

    • Mingyu Xiao, Shaowei Kou
    Pages 220-232
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

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. 

Editors and Affiliations

  • University of Bergen, Bergen, Norway

    Pinar Heggernes

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation