By Petr Golovach, Jan Kratochvíl (auth.), Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.)
The thirty third overseas convention “Workshop on Graph-Theoretic strategies in computing device technology” (WG 2007) came about within the convention heart in outdated castleinDornburgnearJena,Germany,June21–23,2007.Theapproximately80 contributors got here from numerous international locations around the globe, between them Brazil, Canada, the Czech Republic, France, united kingdom, Greece, Hungary, Italy, Japan, The Netherlands, Norway, Sweden, Taiwan, and the us. WG 2007 endured the sequence of 32 earlier WG meetings. considering that 1975, the WG convention has taken position 20 occasions in Germany, 4 occasions within the Netherlands, two times in Austria in addition to as soon as in Italy, Slovakia, Switzerland, the Czech Republic, France and in Norway. The WG convention usually goals at uniting conception and perform via demonstrating how graph-theoretic ideas should be utilized to varied parts in desktop technology, or by way of extracting new difficulties from purposes. The objective is to give fresh researchresults and to spot and exploredirections of destiny learn. Thecontinuinginterestinthe WGconferenceswasre?ectedin thehighn- ber of submissions; ninety nine papers have been submitted and in an assessment strategy with 4 reviews in keeping with submission, 30 papers have been accredited through this system Comm- tee for the convention. as a result of the excessive variety of submissions and the constrained agenda of three days, numerous sturdy papers couldn't be accredited. there have been invited talks via Ming-Yang Kao (Evanston, Illinois) on algori- mic DNA meeting, and through Klaus Jansen (Kiel, Germany) on approximation algorithms for geometric intersection graphs.