Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 2012

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Branislav Rovan

    1. Department of Computer Science, Comenius University, Bratislava, Slovakia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Vladimiro Sassone

    1. Department of Electronics and Computer Science, University of Southampton, Southampton, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Peter Widmayer

    1. Institute of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: MFCS 2012.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (71 papers)

  1. Front Matter

    Download chapter PDF

  2. On the Complexity of Ontological Reasoning under Disjunctive Existential Rules

    • Georg Gottlob, Marco Manna, Michael Morak, Andreas Pieris
    Pages 1-18

  3. New Races in Parameterized Algorithmics

    • Christian Komusiewicz, Rolf Niedermeier
    Pages 19-30

  4. Scott Is Always Simple

    • Antonino Salibra
    Pages 31-45

  5. A Toolkit for Proving Limitations of the Expressive Power of Logics

    • Nicole Schweikardt
    Pages 46-47

  6. How to Reconstruct a Genome

    • Esko Ukkonen
    Pages 48-48

  7. Simple Models for Recursive Schemes

    • Igor Walukiewicz
    Pages 49-60

  8. Transportation under Nasty Side Constraints

    • Gerhard J. Woeginger
    Pages 61-62

  9. Computation of Least Fixed Points

    • Mihalis Yannakakis
    Pages 63-63

  10. Unordered Constraint Satisfaction Games

    • Lauri Ahlroth, Pekka Orponen
    Pages 64-75

  11. A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree

    • Tatsuya Akutsu, Takeyuki Tamura
    Pages 76-87

  12. Reductions to the Set of Random Strings: The Resource-Bounded Case

    • Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
    Pages 88-99

  13. Approximate Graph Isomorphism

    • Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev
    Pages 100-111

  14. Near-Optimal Expanding Generator Sets for Solvable Permutation Groups

    • Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
    Pages 112-123

  15. Generating Functions of Timed Languages

    • Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin
    Pages 124-135

  16. The Robust Set Problem: Parameterized Complexity and Approximation

    • Cristina Bazgan, Morgan Chopin
    Pages 136-147

  17. Mortality for 2 ×2 Matrices Is NP-Hard

    • Paul C. Bell, Mika Hirvensalo, Igor Potapov
    Pages 148-159

  18. Solving Counter Parity Games

    • Dietmar Berwanger, Łukasz Kaiser, Simon Leßenich
    Pages 160-171

  19. Drawing Planar Graphs on Points Inside a Polygon

    • Therese Biedl, Peter Floderus
    Pages 172-183

  20. New Advances in Reoptimizing the Minimum Steiner Tree Problem

    • Davide Bilò, Anna Zych
    Pages 184-197
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 2012

Keywords

About this book

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.

Editors and Affiliations

  • Department of Computer Science, Comenius University, Bratislava, Slovakia

    Branislav Rovan

  • Department of Electronics and Computer Science, University of Southampton, Southampton, UK

    Vladimiro Sassone

  • Institute of Theoretical Computer Science, ETH Zürich, Zürich, Switzerland

    Peter Widmayer

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation