Mathematical Foundations of Computer Science 2012

37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings

  • Branislav Rovan
  • Vladimiro Sassone
  • Peter Widmayer

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7464)

Table of contents

  1. Front Matter
  2. Georg Gottlob, Marco Manna, Michael Morak, Andreas Pieris
    Pages 1-18
  3. Christian Komusiewicz, Rolf Niedermeier
    Pages 19-30
  4. Antonino Salibra
    Pages 31-45
  5. Esko Ukkonen
    Pages 48-48
  6. Igor Walukiewicz
    Pages 49-60
  7. Gerhard J. Woeginger
    Pages 61-62
  8. Mihalis Yannakakis
    Pages 63-63
  9. Lauri Ahlroth, Pekka Orponen
    Pages 64-75
  10. Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
    Pages 88-99
  11. Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev
    Pages 100-111
  12. Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
    Pages 112-123
  13. Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin
    Pages 124-135
  14. Cristina Bazgan, Morgan Chopin
    Pages 136-147
  15. Paul C. Bell, Mika Hirvensalo, Igor Potapov
    Pages 148-159
  16. Dietmar Berwanger, Łukasz Kaiser, Simon Leßenich
    Pages 160-171
  17. Therese Biedl, Peter Floderus
    Pages 172-183

About these proceedings

Introduction

This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Keywords

constraint satisfaction games model checking planar graphs polinomial representations

Editors and affiliations

  • Branislav Rovan
    • 1
  • Vladimiro Sassone
    • 2
  • Peter Widmayer
    • 3
  1. 1.Department of Computer ScienceComenius UniversityBratislavaSlovakia
  2. 2.Department of Electronics and Computer ScienceUniversity of SouthamptonSouthamptonUK
  3. 3.Institute of Theoretical Computer ScienceETH ZürichZürichSwitzerland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-32589-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-32588-5
  • Online ISBN 978-3-642-32589-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book