This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.
This volume features papers from the 29th Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague from August 22–27, 2004. Organized by the Institute for Theoretical Computer Science and the Department of Theoretical Computer Science and Mathematical Logic at Charles University, the event received support from the European Association for Theoretical Computer Science and the European Research Consortium for Informatics and Mathematics. The MFCS symposia traditionally promote high-quality research across all areas of theoretical computer science. Topics covered include automata, formal languages, data structures, algorithms, computational geometry, complexity theory, models of computation, and applications in computational biology, cryptography, security, and artificial intelligence. This conference provided a unique platform for researchers from various fields to present their findings to a broader audience. The scientific program took place in the recently renovated Faculty of Mathematics and Physics building, located in the historic center of Prague, with views of notable landmarks like Prague Castle. The competition for audience attention was fierce, yet the quality of presentations ensured significant interest. The conference program included 60 contributed papers selected from 167 submissions by the Program Committee.
