Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Ernst W. Mayr

    1. TU München Institut für Informatik, Garching, 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 9224)

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

Included in the following conference series:

Conference proceedings info: WG 2015.

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

  1. Computational Geometry

    1. Front Matter

      Pages 235-235
      Download chapter PDF

    2. Weak Unit Disk and Interval Representation of Graphs

      • M. J. Alam, S. G. Kobourov, S. Pupyrev, J. Toeniskoetter
      Pages 237-251

    3. Simultaneous Visibility Representations of Plane st-graphs Using L-shapes

      • William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
      Pages 252-265

    4. An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes

      • Balázs Keszegh, Dömötör Pálvölgyi
      Pages 266-280

    5. Unsplittable Coverings in the Plane

      • János Pach, Dömötör Pálvölgyi
      Pages 281-296

  2. Structural Graph Theory

    1. Front Matter

      Pages 297-297
      Download chapter PDF

    2. Induced Minor Free Graphs: Isomorphism and Clique-width

      • Rémy Belmonte, Yota Otachi, Pascal Schweitzer
      Pages 299-311

    3. On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs

      • Fernanda Couto, Luerbio Faria, Sylvain Gravier, Sulamita Klein, Vinicius F. dos Santos
      Pages 312-324

    4. Colouring and Covering Nowhere Dense Graphs

      • Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos Stavropoulos
      Pages 325-338

    5. Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs

      • Felix Joos
      Pages 339-350

    6. Well-quasi-ordering Does Not Imply Bounded Clique-width

      • Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
      Pages 351-359

    7. A Slice Theoretic Approach for Embedding Problems on Digraphs

      • Mateus de Oliveira Oliveira
      Pages 360-372

    8. Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs

      • Kenjiro Takazawa
      Pages 373-387

  3. Graph Drawing

    1. Front Matter

      Pages 389-389
      Download chapter PDF

    2. Saturated Simple and 2-simple Topological Graphs with Few Edges

      • Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
      Pages 391-405

    3. Testing Full Outer-2-planarity in Linear Time

      • Seok-Hee Hong, Hiroshi Nagamochi
      Pages 406-421

  4. Fixed Parameter Tractability

    1. Front Matter

      Pages 423-423
      Download chapter PDF

    2. Triangulating Planar Graphs While Keeping the Pathwidth Small

      • Therese Biedl
      Pages 425-439

    3. Polynomial Kernelization for Removing Induced Claws and Diamonds

      • Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna
      Pages 440-455

    4. Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs

      • Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
      Pages 456-471
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

About this book

This book constitutes revised selected papers from the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015, held in Garching, Germany, in June 2015.
The 32 papers presented in this volume were carefully reviewed and selected from 79 submissions. They were organized in topical sections named: invited talks; computational complexity; design and analysis; computational geometry; structural graph theory; graph drawing; and fixed parameter tractability. 

Editors and Affiliations

  • TU München Institut für Informatik, Garching, Germany

    Ernst W. Mayr

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation