Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2013

Graph-Theoretic Concepts in Computer Science

39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers

Editors:

  1. Andreas Brandstädt

    1. Institute of Computer Science, University of Rostock, Rostock, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Klaus Jansen

    1. Department of Computer Science, University of Kiel, Kiel, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Rüdiger Reischuk

    1. Institute of Theoretical Computer Science, University of Lübeck, Lübeck, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Up-to-date results
  • Unique visibility

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8165)

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

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

Conference proceedings info: WG 2013.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as 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

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (36 papers)

  1. Front Matter

    PDF

  4. Linear Rank-Width and Linear Clique-Width of Trees

    • Isolde Adler, Mamadou Moustapha Kanté
    Pages 12-25

  5. Threshold-Coloring and Unit-Cube Contact Representation of Graphs

    • Md. Jawaherul Alam, Steven Chaplick, Gašper Fijavž, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev
    Pages 26-37

  6. Rolling Upward Planarity Testing of Strongly Connected Graphs

    • Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer
    Pages 38-49

  7. Towards a Provably Resilient Scheme for Graph-Based Watermarking

    • Lucila Maria Souza Bento, Davidson Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter
    Pages 50-63

  8. The Normal Graph Conjecture for Classes of Sparse Graphs

    • Anne Berry, Annegret Wagler
    Pages 64-75

  9. On the Parameterized Complexity of Computing Graph Bisections

    • René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý
    Pages 76-87

  10. Fixed-Parameter Tractability and Characterizations of Small Special Treewidth

    • Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen
    Pages 88-99

  11. The θ 5-Graph is a Spanner

    • Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
    Pages 100-114

  12. Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations

    • Arman Boyacı, Tınaz Ekim, Mordechai Shalom, Shmuel Zaks
    Pages 115-126

  13. Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

    • Hajo Broersma, Jiří Fiala, Petr A. Golovach, Tomáš Kaiser, Daniël Paulusma, Andrzej Proskurowski
    Pages 127-138

  14. Equilateral L-Contact Graphs

    • Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt
    Pages 139-151

  16. Linear Separation of Total Dominating Sets in Graphs

    • Nina Chiarelli, Martin Milanič
    Pages 165-176

  17. Sparse Square Roots

    • Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
    Pages 177-188

  18. Completing Colored Graphs to Meet a Target Property

    • Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
    Pages 189-200

  19. Colouring of Graphs with Ramsey-Type Forbidden Subgraphs

    • Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
    Pages 201-212

  20. Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs

    • Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze
    Pages 213-224
Back to top

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

Back to top

About this book

This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
Back to top

Keywords

Back to top

Editors and Affiliations

  • Institute of Computer Science, University of Rostock, Rostock, Germany

    Andreas Brandstädt

  • Department of Computer Science, University of Kiel, Kiel, Germany

    Klaus Jansen

  • Institute of Theoretical Computer Science, University of Lübeck, Lübeck, Germany

    Rüdiger Reischuk

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as 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

Search

Navigation