Petr Kolman – författare

This volume contains papers selected for presentation at the 26th International Symposium on Mathematical Foundations of Computer Science - MFCS 2001, held in Mari'ansk'eL'azn?e, Czech Republic, August 27 - 31, 2001. MFCS 2001 was organized by the Mathematical Institute (Academy of S- ences of the Czech Republic), the Institute for Theoretical Computer Science (Charles University, Faculty of Mathematics and Physics), the Institute of C- puter Science (Academy of Sciences of the Czech Republic), and Action M Agency. It was supported by the European Research Consortium for Informatics and Mathematics, the Czech Research Consortium for Informatics and Ma- ematics, and the European Association for Theoretical Computer Science. We gratefully acknowledge the support of all these institutions. The series of MFCS symposia, organized on a rotating basis in Poland, S- vakia, and the Czech Republic, has a well-established tradition. The aim is to encourage high-quality research in all branches of theoretical computer science and bring together specialists who do not usually meet at specialized confer- ? ences.Previous meetings tookplace in Jablonna, 1972; Strbsk'e Pleso, 1973; J- wisin, 1974; Marian ' sk'eL'azn?e, 1975; Gdan 'sk, 1976; Tatransk'a Lomnica, 1977; Za- ? kopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk'e Pleso, 1981; Prague, 1984; Bratislava, 1986; Karlovy Vary, 1988; Porabk , a-Kozubnik, 1989; Bansk'aBystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdan 'sk, 1993; Ko?sice, 1994; Prague, 1995; Krak'ow, 1996; Bratislava, 1997; Brno, 1998; Szklarska Por,eba, 1999; and Bratislava, 2000.

The 7th Annual Conference on Theory and Applications of Models of Compu- tion was held during June 7-11, 2010 in Prague. After six successful conferences held in 2004-2009 in China (Beijing, Kunming, Beijing, Shanghai, Xi'an, and ChangSha) TAMC left Asia for the ?rst time, aiming at the "heart of Europe. " Changingthegeographicallocationdidnotbringanychangestothescopeofthe conference. Its three main themes continued to be Computability, Complexity, and Algorithms. The conference aims to bring together researchersfrom all over the world with interests in theoretical computer science, algorithmic mathem- ics,andapplicationsto thephysicalsciences. Thisyearwesawmoreparticipants from Europe and the Americas, but we were very happy that we could also w- come to Prague traditional participants from Asia (China, Japan, and India) to continue enhancing the collaboration among the theoretical computer science communities of these continents. After hard work the Program Committee decided to accept 35 papers out of 76 submitted to TAMC 2010. Each submission was reviewed by at least three, Program Committee members. All actions of the Program Committee were - ordinated via ?awlessly and e?ciently running EasyChair.We congratulate the authors of accepted contributions and thank all authors who submitted their papers. They all contributed to a successful event. We extend our thanks to the distinguished plenary speakers who accepted our invitation to deliver plenary talks - John Hopcroft from Cornell University and Shang-Hua Teng from University of Southern California. Their talks "New Research Directions in the Information Age" and "The Laplacian Paradigm: Emerging Algorithms for Massive Graph" were highlights of the conference.

This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011.The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications.