This volume contains the papers presented at the 30th Symposium on Mat- matical Foundations of Computer Science (MFCS 2005)held in Gdansk, Poland fromAugust29thto September 2nd, 2005. TakingplacealternatelyintheCzech Republic, Slovakia and Poland, this year the conference was organized by the Institute of Mathematics of Gdansk University. From the ? rst meeting in 1972 to this year s 30th event, the MFCS series has provided a basis for theoretical computer scientists to present their latest research results. The scope of the conference, consequently, covers all branches of theoretical computer science ranging from automata, algorithms, data str- tures, models of computation to complexity theory, also including arti? cial - telligence, computational biology, computational geometry and cryptography. The 137 submissions from 22 countries revealed a continued strong interest in the conference as well as the high-quality research results the MFCS series stands for. The Program Committee carefully selected 62 papers for presention at the conference complemented by 7 invited talks. The meeting took place at a conference hotel located on Sobieszewo Island, 15 km from Gdansk, o? ering both a beautiful landscapewith sandy beaches and forests and the possibility to explore the old Hanseatic city of Gdansk with its interesting history of over 1000 years.
Inhaltsverzeichnis
Invited Lectures. - Page Migration in Dynamic Networks. - Knot Theory, Jones Polynomial and Quantum Computing. - Interactive Algorithms 2005. - Some Computational Issues in Membrane Computing. - The Generalization of Dirac s Theorem for Hypergraphs. - On the Communication Complexity of Co-linearity Problems. - An Invitation to Play. - Papers. - The Complexity of Satisfiability Problems: Refining Schaefer s Theorem. - On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. - Pure Nash Equilibria in Games with a Large Number of Actions. - On the Complexity of Depth-2 Circuits with Threshold Gates. - Isomorphic Implication. - Abstract Numeration Systems and Tilings. - Adversarial Queueing Model for Continuous Network Dynamics. - Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. - Regular Sets of Higher-Order Pushdown Stacks. - Linearly Bounded Infinite Graphs. - Basic Properties for Sand Automata. - A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. - Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. - New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. - Approximating Polygonal Objects by Deformable Smooth Surfaces. - Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications. - Asynchronous Deterministic Rendezvous in Graphs. - Zeta-Dimension. - Online Interval Coloring with Packing Constraints. - Separating the Notions of Self- and Autoreducibility. - Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. - Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. - Matrix and Graph Orders Derived from Locally ConstrainedGraph Homomorphisms. - Packing Weighted Rectangles into a Square. - Nondeterministic Graph Searching: From Pathwidth to Treewidth. - Goals in the Propositional Horn? ? ? Language Are Monotone Boolean Circuits. - Autoreducibility, Mitoticity, and Immunity. - Canonical Disjoint NP-Pairs of Propositional Proof Systems. - Complexity of DNF and Isomorphism of Monotone Formulas. - The Expressive Power of Two-Variable Least Fixed-Point Logics. - Languages Representable by Vertex-Labeled Graphs. - On the Complexity of Mixed Discriminants and Related Problems. - Two Logical Hierarchies of Optimization Problems over the Real Numbers. - Algebras as Knowledge Structures. - Combining Self-reducibility and Partial Information Algorithms. - Complexity Bounds for Regular Games. - Basic Mereology with Equivalence Relations. - Online and Dynamic Recognition of Squarefree Strings. - Shrinking Restarting Automata. - Removing Bidirectionality from Nondeterministic Finite Automata. - Generating All Minimal Integral Solutions to Monotone ? , ? -Systems of Linear, Transversal and Polymatroid Inequalities. - On the Parameterized Complexity of Exact Satisfiability Problems. - Approximating Reversal Distance for Strings with Bounded Number of Duplicates. - Random Databases and Threshold for Monotone Non-recursive Datalog. - An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. - Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. - Tight Approximability Results for the Maximum Solution Equation Problem over Z p . - The Complexity of Model Checking Higher Order Fixpoint Logic. - An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. - Inverse Monoids: Decidability and Complexity of Algebraic Questions. - Dimension IsCompression. - Concurrent Automata vs. Asynchronous Systems. - Completeness and Degeneracy in Information Dynamics of Cellular Automata. - Strict Language Inequalities and Their Decision Problems. - Event Structures for the Collective Tokens Philosophy of Inhibitor Nets. - An Exact 2. 9416 n Algorithm for the Three Domatic Number Problem. - D-Width: A More Natural Measure for Directed Tree Width. - On Beta-Shifts Having Arithmetical Languages. - A BDD-Representation for the Logic of Equality and Uninterpreted Functions. - On Small Hard Leaf Languages. - Explicit Inapproximability Bounds for the Shortest Superstring Problem. - Stratified Boolean Grammars.
