Theoretical Computer Science and General Issues

Graph-Theoretic Concepts in Computer Science

36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers

Editors: Thilikos, Dimitrios M. (Ed.)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-16926-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-642-16925-0
  • Free shipping for individuals worldwide
  • This title is currently reprinting. You can pre-order your copy now.
About this book

The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japan, The Netherlands, Norway, Poland, Switzerland, the UK, and the USA) attended the conference. WG has a long tradition. Since 1975, WG has taken place 21 times in Germany, four times in The Netherlands, twice in Austria, twice in France and once in the Czech Republic, Greece, Italy, Norway, Slovakia, Switzerland, and the UK. WG aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications. The goal is to presentemergingresearchresultsand to identify and exploredirections of future research.The conference is well-balanced with respect to established researchers and young scientists. There were 94 submissions, two of which where withdrawn before entering the review process. Each submission was carefully reviewed by at least 3, and on average 4.5, members of the Program Committee. The Committee accepted 28 papers, which makes an acceptance ratio of around 30%. I should stress that, due to the high competition and the limited schedule, there were papers that were not accepted while they deserved to be.

Table of contents (30 chapters)

  • Algorithmic Barriers from Phase Transitions in Graphs

    Achlioptas, Dimitris

    Pages 1-1

  • Algorithmic Graph Minors and Bidimensionality

    Demaine, Erik D.

    Pages 2-2

  • Complexity Results for the Spanning Tree Congestion Problem

    Otachi, Yota (et al.)

    Pages 3-14

  • max-cut and Containment Relations in Graphs

    Kamiński, Marcin

    Pages 15-26

  • The Longest Path Problem is Polynomial on Cocomparability Graphs

    Ioannidou, Kyriaki (et al.)

    Pages 27-38

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-642-16926-7
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-642-16925-0
  • Free shipping for individuals worldwide
  • This title is currently reprinting. You can pre-order your copy now.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Graph-Theoretic Concepts in Computer Science
Book Subtitle
36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers
Editors
  • Dimitrios M. Thilikos
Series Title
Theoretical Computer Science and General Issues
Series Volume
6410
Copyright
2010
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer Berlin Heidelberg
eBook ISBN
978-3-642-16926-7
DOI
10.1007/978-3-642-16926-7
Softcover ISBN
978-3-642-16925-0
Edition Number
1
Number of Pages
XIII, 338
Number of Illustrations and Tables
62 b/w illustrations
Topics