Graph-theoretic concepts in computer science : 35th international workshop, WG 2009, Montpellier, France, June 24-26, 2009 : revised papers /

Saved in:
Bibliographic Details
Meeting name:Conference on Graphtheoretic Concepts in Computer Science (35th : 2009 : Montpellier, France)
Imprint:Berlin ; New York : Springer, ©2010.
Description:1 online resource (xiii, 353 pages) : illustrations.
Language:English
Series:Lecture notes in computer science, 0302-9743 ; 5911. Advanced research in computing and software science
LNCS sublibrary: SL 1 - Theoretical computer science and general issues
Lecture notes in computer science ; 5911.
Lecture notes in computer science. Advanced research in computing and software science.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11073867
Hidden Bibliographic Details
Varying Form of Title:WG 2009
Other authors / contributors:Paul, Christophe.
Habib, M. (Michel)
ISBN:9783642114090
3642114091
9783642114083
3642114083
Notes:Includes bibliographical references and index.
Print version record.
Other form:Print version: Conference on Graphtheoretic Concepts in Computer Science (35th : 2009 : Monpellier, France). Graph-theoretic concepts in computer science. Berlin ; Heidelberg ; New York : Springer, ©2010 9783642114083
Description
Summary:The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24-26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The Netherlands, Norway, Spain, UK, USA) attended the conference. Since1975,ithastakenplace20timesinGermany,fourtimesinTheNeth- lands, twice in Austria, as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway, and the UK. The conference 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 appli- tions. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists. There were 69 submissions. Each submission was reviewed by at least three, and on average four, Program Committee members. The Committee decided to accept 28 papers. Due to the competition and the limited schedule, some good papers could not be accepted. Theprogramalsoincludedexcellentinvitedtalks:onegivenbyDanielKràlon "AlgorithmsforClassesofGraphswithBoundedExpansion," the otherbyDavid Eppsteinon"Graph-TheoreticSolutionstoComputationalGeometryProblems." The proceedings contains two survey papers on these topics.
Physical Description:1 online resource (xiii, 353 pages) : illustrations.
Bibliography:Includes bibliographical references and index.
ISBN:9783642114090
3642114091
9783642114083
3642114083
ISSN:0302-9743
;