Table of contents

  1. Front Matter
  2. Wen-Lian Hsu
    Pages 11-16
  3. Stefan Felsner
    Pages 17-26
  4. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
    Pages 37-49
  5. Klaus Jansen, Petra Scheffler
    Pages 50-59
  6. Dinesh Bhatia, Tom Leighton, Fillia Makedon, Carolyn H. Norton
    Pages 114-122
  7. Jianer Chen, Arkady Kanevsky
    Pages 158-169
  8. Beverly Jamison, Stephan Olariu
    Pages 170-183
  9. Sajal K. Das, Aisheng Mao
    Pages 184-204
  10. Mikkel Thorup
    Pages 205-211

About these proceedings


The 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '92) was held in Wiesbaden-Naurod, Germany, June 18-20, 1992. Itwas organized by the Department of Computer Science, Johann Wolfgang Goethe University, Frankfurt am Main. Contributions with original results inthe study and application of graph-theoretic concepts in various fields of computer science were solicited, and 72 papers were submitted and reviewed, from which 29 were selected for presentation at the workshop. The workshop was attended by 61 scientists from 16 countries. All 29 papers in the volume have undergone careful revision after the meeting, based on the discussions and comments from the audience and the referees. The volume is divided into parts on restricted graph classes, scheduling and related problems, parallel anbd distributed algorithms, combinatorial graph problems, graph decomposition, graph grammars and geometry, and modelling by graphs.


Combinatorial Algorithms Distributed Algorithms Graph Graph-Theeory Kombinatorische Algorithmen Programmier-Semantik Scheduling Semantics of Programming algorithm algorithms modeling

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-56402-7
  • Online ISBN 978-3-540-47554-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors