Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings - Softcover

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.