rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Mathematical Foundations of Computer Science 2012
    sub title: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings
  name:
    name part: Rovan, Branislav.
    role:
      role term: editor.
  name:
    name part: Sassone, Vladimiro.
    role:
      role term: editor.
  name:
    name part: Widmayer, Peter.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2012
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XV, 825 p. 102 illus. online resource.
  abstract: 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.
  table of contents: On the Complexity of Ontological Reasoning under Disjunctive -- Existential Rules -- New Races in Parameterized Algorithmics -- Scott Is Always Simple -- Simple Models for Recursive Schemes -- Unordered Constraint Satisfaction Games -- A Polynomial-Time Algorithm for Computing the Maximum Common -- Subgraph of Outerplanar Graphs of Bounded Degree -- Reductions to the Set of Random Strings: The Resource-Bounded Case -- Approximate Graph Isomorphism -- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups -- Generating Functions of Timed Languages -- The Robust Set Problem: Parameterized Complexity and Approximation -- Mortality for 2 × 2 Matrices Is NP-Hard -- Solving Counter Parity Games -- Drawing Planar Graphs on Points Inside a Polygon -- Smoothed Complexity Theory -- Abelian Pattern Avoidance in Partial Words -- The Complexity of Rerouting Shortest Paths -- Computing with Large Populations Using Interactions -- Pancake Flipping Is Hard -- In-place Heap Construction with Optimized Comparisons, Moves, and Cache -- A Dichotomy Theorem for Homomorphism -- On the Impact of Fair Best Response Dynamics -- When Trees Grow Low: Shrubs and Fast MSO1 -- Obtaining Planarity by Contracting Few Kernels for Edge Dominating Set -- Quasi-recognizable vs MSO Definable Languages of One-Dimensional -- Reversal Hierarchies for Small -- The Lower Reaches of Circuit Weakly-Synchronized Ground Tree Rewriting -- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs -- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games -- Maximum Cliques in Graphs with Small Intersection Number and Random Intersection -- Regularity Problems for Weak Pushdown ω-Automata and Games -- Computational Aspects of Cellular Automata on Countable Sofic Shifts -- On Two Stronger Versions of Dejean’s Conjecture -- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments.
  note: edited by Branislav Rovan, Vladimiro Sassone, Peter Widmayer.
  subject:
    topic: Computer science
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Mathematical logic
  subject:
    topic: Numerical analysis
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Numeric Computing
  subject:
    topic: Data Structures
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Math Applications in Computer Science
  classification: QA76.9.A43
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 7464
  identifier: 9783642325892
  identifier: http://dx.doi.org/10.1007/978-3-642-32589-2
  record info:
    record creation date: 120801
    record change date: 20151204143425.0
    record identifier: 978-3-642-32589-2