This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 2007. The 61 revised full papers presented together with the full papers or abstracts of five invited talks address all current aspects in theoretical computer science and its mathematical foundations.
The 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002) took place in Cesky Krumlov, Czech Republic, from June 13–15, 2002, organized by the Department of Applied Mathematics at Charles University in Prague. Since its inception in 1975, WG has been hosted in Germany 20 times, with additional events in Austria, the Netherlands, Italy, Slovakia, and Switzerland. The workshop aimed to bridge theory and practice by showcasing the application of graph-theoretic concepts in various areas of Computer Science and identifying new problems arising from these applications. It focused on both theoretical and practical aspects of graph concepts, with presentations highlighting how recent algorithmic graph theory research can inform computer science and the graph-theoretic questions that emerge from technological advancements. A total of 61 research papers were submitted and rigorously reviewed by the program committee, which encompassed a broad scientific spectrum. After a careful review process, 36 papers were selected for presentation. The feedback from referees and the engaging discussions during the workshop contributed to the development of the conference proceedings.
Kniha si klade za cíl poskytnout čtenáři základní teoretické poznatky týkající se možností a omezení pro volbu správného typu algoritmů při řešení konkrétních úloh na počítačích. Je určena programátorům řešícím složité úlohy numerického typu.