Graph theoretic concepts in computer science

Más información sobre el libro

The 33rd International Conference “Workshop on Graph-Theoretic Concepts in Computer Science” (WG 2007) was held at the Conference Center in the historic castle of Dornburg near Jena, Germany, from June 21–23, 2007. Approximately 80 participants from diverse countries, including Brazil, Canada, the Czech Republic, France, the UK, Greece, Hungary, Italy, Japan, the Netherlands, Norway, Sweden, Taiwan, and the USA, attended. This event continued the tradition of 32 previous WG conferences, which have been hosted 20 times in Germany, and multiple times in other countries since 1975. The conference aims to bridge theory and practice by showcasing the application of graph-theoretic concepts in computer science and identifying new problems arising from these applications. The event highlighted recent research findings and explored future research directions. The strong interest in WG conferences was evident from the 99 paper submissions, with 30 accepted after a rigorous evaluation process involving four reports per submission. Due to the limited schedule of three days, several quality papers could not be included. Notable invited talks featured Ming-Yang Kao discussing algorithmic DNA assembly and Klaus Jansen on approximation algorithms for geometric intersection graphs.