Advertisement

Graph-Theoretic Concepts in Computer Science

33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers

  • Editors
  • Andreas Brandstädt
  • Dieter Kratsch
  • Haiko Müller

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

Table of contents

  1. Front Matter
  2. Arthur H. Busch, Garth Isaak
    Pages 12-20
  3. David Richerby, Dimitrios M. Thilikos
    Pages 21-32
  4. Frédéric Mazoit, Nicolas Nisse
    Pages 33-44
  5. Vadim Lozin, Martin Milanič
    Pages 45-54
  6. Philippe Gambette, Stéphane Vialette
    Pages 55-65
  7. Bruno Courcelle, Mamadou Moustapha Kanté
    Pages 66-75
  8. Frank Gurski, Egon Wanke
    Pages 76-85
  9. Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
    Pages 86-98
  10. Maw-Shang Chang, Ming-Tat Ko
    Pages 109-120
  11. Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski et al.
    Pages 121-132
  12. Luis Cereceda, Jan van den Heuvel, Matthew Johnson
    Pages 166-177
  13. Stefan Felsner, Florian Zickfeld
    Pages 190-201
  14. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
    Pages 202-213
  15. Peter Damaschke
    Pages 214-225
  16. Van Bang Le, H. N. de Ridder
    Pages 226-237
  17. Min Chih Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter
    Pages 248-257
  18. Karol Suchan, Ioan Todinca
    Pages 258-269
  19. Daniel Meister, Jan Arne Telle, Martin Vatshelle
    Pages 270-279
  20. Dániel Marx, Ildikó Schlotter
    Pages 292-303
  21. Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
    Pages 304-315
  22. Refael Hassin, Jérôme Monnot, Danny Segev
    Pages 328-340
  23. Back Matter

About these proceedings

Introduction

The 33rd International Conference “Workshop on Graph-Theoretic Concepts in Computer Science” (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21–23,2007.Theapproximately80 participants came from various countries all over the world, among them Brazil, Canada, the Czech Republic, France, UK, Greece, Hungary, Italy, Japan, The Netherlands, Norway, Sweden, Taiwan, and the USA. WG 2007 continued the series of 32 previous WG conferences. Since 1975, the WG conference has taken place 20 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France and in Norway. The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research. Thecontinuinginterestinthe WGconferenceswasre?ectedin thehighn- ber of submissions; 99 papers were submitted and in an evaluation process with four reports per submission, 30 papers were accepted by the Program Comm- tee for the conference. Due to the high number of submissions and the limited schedule of 3 days, various good papers could not be accepted. There were invited talks by Ming-Yang Kao (Evanston, Illinois) on algori- mic DNA assembly, and by Klaus Jansen (Kiel, Germany) on approximation algorithms for geometric intersection graphs.

Keywords

Algorithms Graph Graph theory Layout algorithm complexity computer computer science modeling

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-74839-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-74838-0
  • Online ISBN 978-3-540-74839-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Automotive
Electronics
IT & Software
Telecommunications
Aerospace
Engineering