Skip to main content
SpringerLink
Log in

Graph-Theoretic Concepts in Computer Science

29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Hans L. Bodlaender

    1. Department of Information and Computing Sciences, Utrecht University, The Netherlands

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

Included in the following conference series:

Conference proceedings info: WG 2003.

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

  1. Front Matter

    Download chapter PDF

  2. Invited Lecture

    1. Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT

      • Michael R. Fellows
      Pages 1-12

    2. Matching, Edge-Colouring, and Dimers

      • Alexander Schrijver
      Pages 13-22

  3. Regular Papers

    1. Minimum Flow Time Graph Ordering

      • Claudio Arbib, Michele Flammini, Fabrizio Marinelli
      Pages 23-33

    2. Searching Is Not Jumping

      • Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos
      Pages 34-45

    3. Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars

      • Simon M. Becker, Bernhard Westfechtel
      Pages 46-57

    4. The Minimum Degree Heuristic and the Minimal Triangulation Process

      • Anne Berry, Pinar Heggernes, Geneviève Simonet
      Pages 58-70

    5. Generalized Parametric Multi-terminal Flows Problem

      • Pascal Berthomé, Madiagne Diallo, Afonso Ferreira
      Pages 71-80

    6. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation

      • Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
      Pages 81-92

    7. The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes

      • Paul Bonsma
      Pages 93-105

    8. Tree Spanners for Bipartite Graphs and Probe Interval Graphs

      • Andreas Brandstädt, Feodor F. Dragan, Hoang-Oanh Le, Van Bang Le, Ryuhei Uehara
      Pages 106-118

    9. A Simple Linear Time LexBFS Cograph Recognition Algorithm

      • Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul
      Pages 119-130

    10. Backbone Colorings for Networks

      • Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
      Pages 131-142

    11. Greedy Edge-Disjoint Paths in Complete Graphs

      • Paz Carmi, Thomas Erlebach, Yoshio Okamoto
      Pages 143-155

    12. Graph-Based Approaches to Software Watermarking

      • Christian Collberg, Stephen Kobourov, Edward Carter, Clark Thomborson
      Pages 156-167

    13. Completely Connected Clustered Graphs

      • Sabine Cornelsen, Dorothea Wagner
      Pages 168-179

    14. An FPT Algorithm for Set Splitting

      • Frank Dehne, Michael R. Fellows, Frances A. Rosamond
      Pages 180-191

    15. Drawing Planar Graphs on a Curve

      • E. Di Giacomo, W. Didimo, G. Liotta, S. K. Wismath
      Pages 192-204

    16. Tree-Partitions of k-Trees with Applications in Graph Layout

      • Vida Dujmović, David R. Wood
      Pages 205-217

    17. Resource Allocation Problems in Multifiber WDM Tree Networks

      • Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
      Pages 218-229
Back to top

Other volumes

  1. Graph-Theoretic Concepts in Computer Science

Keywords

About this book

The 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The Netherlands.TheworkshopwasorganizedbytheCenterforAlgorithmicSystems of the Institute of Information and Computing Sciences of Utrecht University. The workshop took place June 19–21, 2003. The 72 participants of WG 2003 came from universities and research institutes from 18 di?erent countries and ?ve di?erent continents. The workshop looks back at a long tradition. It was ?rst held in 1975, and has been held 20 times in Germany, twice in Austria, and once in Italy, Slo- kia, Switzerland, and the Czech Republic, and has now been held for the third time in The Netherlands. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computerscience,orbyextractingnewproblemsfromapplications.Itisdevoted to the theoretical and practical aspects of graph concepts in computer science. The goal is to present recent research results and to identify and explore - rections of future research. The talks given at the workshop showed how recent research results from algorithmic graph theory can be used in computer science and which graph-theoretic questions arise from new developments in computer science.

Editors and Affiliations

  • Department of Information and Computing Sciences, Utrecht University, The Netherlands

    Hans L. Bodlaender

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation