Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Graph-Theoretic Concepts in Computer Science

25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Peter Widmayer

    1. Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gabriele Neyer

    1. Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Stephan Eidenbenz

    1. Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, Zürich, Switzerland

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

Included in the following conference series:

Conference proceedings info: WG 1999.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy 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

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (37 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Silver Graphs: Achievements and New Challenges

    • Hartmut Noltemeier
    Pages 1-9

  3. Online Algorithms: A Study of Graph-Theoretic Concepts

    • Susanne Albers
    Pages 10-26

  4. Discrete Optimization Methods for Packing Problems in Two and Three Dimensions — With Applications in the Textile and Car Manufacturing Industries

    • Thomas Lengauer
    Pages 27-28

  5. Informatica, Scuola, Communità: Uno Sguardo dall’ Occhio del Ciclone

    • N. Santoro
    Pages 29-29

  6. Proximity-Preserving Labeling Schemes and Their Applications

    • David Peleg
    Pages 30-41

  7. Euler Is Standing in Line

    • D. Hauptmeier, S. O. Krumke, J. Rambau, H.-C. Wirth
    Pages 42-54

  8. Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2

    • Sascha Ott
    Pages 55-64

  9. Complexity Classification of Some Edge Modification Problems

    • Assaf Natanzon, Ron Shamir, Roded Sharan
    Pages 65-77

  10. On Minimum Diameter Spanning Trees under Reload Costs

    • Hans-Christoph Wirth, Jan Steffan
    Pages 78-89

  11. Induced Matchings in Regular Graphs and Trees

    • Michele Zito
    Pages 89-101

  12. Mod-2 Independence and Domination in Graphs

    • Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
    Pages 101-109

  13. NLC2-Decomposition in Polynomial Time

    • Öjvind Johansson
    Pages 110-121

  14. On the Nature of Structure and Its Identification

    • Benno Stein, Oliver Niggemann
    Pages 122-134

  15. On the Clique—Width of Perfect Graph Classes

    • Martin Charles Golumbic, Udi Rotics
    Pages 135-147

  16. An Improved Algorithm for Finding Tree Decompositions of Small Width

    • Ljubomir Perković, Bruce Reed
    Pages 148-154

  17. Efficient Analy sis of Graphs with Small Minimal Separators

    • K. Skodinis
    Pages 155-166

  18. Generating All the Minimal Separators of a Graph

    • Anne Berry, Jean-Paul Bordat, Olivier Cogis
    Pages 167-172

  19. Two Broadcasting Problems in FaultyHypercubes

    • Stefan Dobrev, Imrich Vrťo
    Pages 173-178

  20. Routing Permutations in the Hypercube

    • Olivier Baudon, Guillaume Fertin, Ivan Havel
    Pages 179-190
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Editors and Affiliations

  • Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, Zürich, Switzerland

    Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation