Graph theoretic concepts in computer science

Více o knize

The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) was held in Montpellier, France, from June 24–26, 2009, attracting around 80 computer scientists from countries including Australia, Canada, China, Germany, Israel, Japan, and the USA. Since its inception in 1975, the workshop has been hosted in various locations, including Germany, the Netherlands, and Austria. The conference aims to bridge theory and practice by showcasing the application of graph-theoretic concepts in computer science and identifying new research problems. It features a balanced representation of established researchers and emerging scientists. Out of 69 submissions, 28 papers were accepted after rigorous reviews by an average of four Program Committee members per submission, highlighting the competitive nature of the event. The program also included notable invited talks: one by Daniel Kràl on "Algorithms for Classes of Graphs with Bounded Expansion" and another by David Eppstein on "Graph-Theoretic Solutions to Computational Geometry Problems." The proceedings feature two survey papers on these topics, contributing to the ongoing discourse in the field.