Skip to main content
  • Conference proceedings
  • © 2014

Graph-Theoretic Concepts in Computer Science

40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers

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

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

Conference proceedings info: WG 2014.

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-12340-0
  • 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 (34 papers)

  1. Front Matter

    Pages I-XI
  2. Distributedly Testing Cycle-Freeness

    • Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
    Pages 15-28
  3. DMVP: Foremost Waypoint Coverage of Time-Varying Graphs

    • Eric Aaron, Danny Krizanc, Elliot Meyerson
    Pages 29-41
  4. Linear Rank-Width of Distance-Hereditary Graphs

    • Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
    Pages 42-55
  5. Vertex Contact Graphs of Paths on a Grid

    • Nieke Aerts, Stefan Felsner
    Pages 56-68
  6. Deciding the Bell Number for Hereditary Graph Properties

    • Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
    Pages 69-80
  7. Boxicity and Separation Dimension

    • Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
    Pages 81-92
  8. Maximal Induced Matchings in Triangle-Free Graphs

    • Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, Reza Saei, Yngve Villanger
    Pages 93-104
  9. Structural Parameterizations for Boxicity

    • Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
    Pages 117-128
  10. A New Characterization of \(P_k\) -free Graphs

    • Eglantine Camby, Oliver Schaudt
    Pages 129-138
  11. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

    • Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickael Montassier, Juraj Stacho
    Pages 139-151
  12. The Maximum Labeled Path Problem

    • Basile Couëtoux, Elie Nakache, Yann Vaxès
    Pages 152-163
  13. Minimum Spanning Tree Verification Under Uncertainty

    • Thomas Erlebach, Michael Hoffmann
    Pages 164-175
  14. On Set Expansion Problems and the Small Set Expansion Conjecture

    • Rajiv Gandhi, Guy Kortsarz
    Pages 189-200
  15. Hadwiger Number of Graphs with Small Chordality

    • Petr A. Golovach, Pinar Heggernes, Pim van ’t Hof, Christophe Paul
    Pages 201-213
  16. Recognizing Threshold Tolerance Graphs in \(O(n^2)\) Time

    • Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
    Pages 214-224
  17. Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

    • Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
    Pages 225-237

Other Volumes

  1. Graph-Theoretic Concepts in Computer Science

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014.

The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.

Keywords

  • Approximation Algorithms
  • Distributed Algorithms
  • Graph Algorithms
  • Graph Classes
  • Graph Drawings
  • Graph Theory
  • Optimization Algorithms
  • Parameterized complexity and exact algorithms
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • LITA, Université de Lorraine, Metz Cedex 01, France

    Dieter Kratsch

  • Université d'Orléans, Orléans, France

    Ioan Todinca

Bibliographic Information

  • Book Title: Graph-Theoretic Concepts in Computer Science

  • Book Subtitle: 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers

  • Editors: Dieter Kratsch, Ioan Todinca

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/978-3-319-12340-0

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer International Publishing Switzerland 2014

  • Softcover ISBN: 978-3-319-12339-4Published: 31 October 2014

  • eBook ISBN: 978-3-319-12340-0Published: 20 October 2014

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XI, 422

  • Number of Illustrations: 81 b/w illustrations

  • Topics: Discrete Mathematics in Computer Science, Algorithms, Data Science, Geometry

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-12340-0
  • 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)