About these proceedings
This book constitutes the refereed proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002.
The 48 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 108 submissions. All relevant aspects of theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, algorithms, and complexity to programming theory, formal methods, and mathematical logic.
algorithms combinatorial optimization complexity computer computer science formal method logic mathematical logic optimization programming
Springer-Verlag Berlin Heidelberg 2002
Springer, Berlin, Heidelberg
Springer Book Archive
Series Print ISSN
Buy this book on publisher's site