Nantilus
Mathematical Foundations of Computer Science 2012 : 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings
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...
Enregistré dans:
| Auteurs principaux : | , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Mathematical Foundations of Computer Science 2012 : 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings / edited by Branislav Rovan, Vladimiro Sassone, Peter Widmayer. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, 2012 Cham |
| Collection : | Theoretical computer science and general issues (Online) ; 7464 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Sujets : | |
| Documents associés : | Autre format:
Mathematical Foundations of Computer Science 2012 Autre format: Mathematical Foundations of Computer Science 2012 |
- 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.