| Invited Lectures | |
| A Case Study of Genome Evolution: From Continuous to Discrete Time Model | p. 1 |
| Multicoloring: Problems and Techniques | p. 25 |
| Some Recent Progress in Algorithmic Randomness | p. 42 |
| Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms | p. 84 |
| PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness | p. 104 |
| Theory and Applied Computing: Observations and Anecdotes | p. 106 |
| Boxed Ambients with Communication Interfaces | p. 119 |
| Algebraic Recognizability of Languages | p. 149 |
| Geometric Optimization and Unique Sink Orientations of Cubes | p. 176 |
| Congestion Games and Coordination Mechanisms | p. 177 |
| Graph Algorithms | |
| Equitable Colorings of Bounded Treewidth Graphs | p. 180 |
| The Bidimensional Theory of Bounded-Genus Graphs | p. 191 |
| Parallel Knock-Out Schemes in Networks | p. 204 |
| Online Algorithms for Disk Graphs | p. 215 |
| Approximations | |
| Protein Folding in the HP Model on Grid Lattices with Diagonals | p. 227 |
| Optimization, Games, and Quantified Constraint Satisfaction | p. 239 |
| Approximating Boolean Functions by OBDDs | p. 251 |
| On Approximation Hardness of the Minimum 2SAT-DELETION Problem | p. 263 |
| Graphs and Complexity | |
| Group Coloring and List Group Coloring Are IIP2-Complete | p. 274 |
| Complexity Results in Graph Reconstruction | p. 287 |
| Generating Paths and Cuts in Multi-pole (Di)graphs | p. 298 |
| Packing Directed Cycles Efficiently | p. 310 |
| Circuits | |
| The Complexity of Membership Problems for Circuits over Sets of Integers | p. 322 |
| Some Meet-in-the-Middle Circuit Lower Bounds | p. 334 |
| The Enumerability of P Collapses P to NC | p. 346 |
| On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge | p. 356 |
| General Complexity | |
| All Superlinear Inverse Schemes Are coNP-Hard | p. 368 |
| The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups | p. 380 |
| Generation Problems | p. 392 |
| One Query Reducibilities Between Partial Information Classes | p. 404 |
| Automata | |
| A New Dimension Sensitive Property for Cellular Automata | p. 416 |
| Captive Cellular Automata | p. 427 |
| Simulating 3D Cellular Automata with 2D Cellular Automata | p. 439 |
| Graph Exploration by a Finite Automaton | p. 451 |
| Parametrized and Kolmogorov Complexity | |
| On Polynomially Time Bounded Symmetry of Information | p. 463 |
| Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets | p. 476 |
| A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs | p. 488 |
| Polynomial Time Approximation Schemes and Parameterized Complexity | p. 500 |
| Semantics | |
| Epistemic Foundation of the Well-Founded Semantics over Bilattices | p. 513 |
| Structural Model Checking for Communicating Hierarchical Machines | p. 525 |
| Compositional Verification: Decidability Issues Using Graph Substitutions | p. 537 |
| Event Structures for Resolvable Conflict | p. 550 |
| Scheduling | |
| Optimal Preemptive Scheduling for General Target Functions | p. 562 |
| The Price of Anarchy for Polynomial Social Cost | p. 574 |
| Agent-Based Information Handling in Large Networks | p. 586 |
| Approximating Earliest Arrival Flows with Flow-Dependent Transit Times | p. 599 |
| Algebraic Theory of Languages | |
| A Hierarchy of Irreducible Sofic Shifts | p. 611 |
| Membership and Reachability Problems for Row-Monomial Transformations | p. 623 |
| On Pseudovarieties of Semiring Homomorphisms | p. 635 |
| An Algebraic Generalization of -Regular Languages | p. 648 |
| A Protocol for Serializing Unique Strategies | p. 660 |
| A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games | p. 673 |
| When Can You Play Positionally? | p. 686 |
| Languages | |
| The Dual of Concatenation | p. 698 |
| Computational Aspects of Disjunctive Sequences | p. 711 |
| Decidability of Trajectory-Based Equations | p. 723 |
| Geometry | |
| Efficient View Point Selection for Silhouettes of Convex Polyhedra | p. 735 |
| Angles and Lengths in Reconfigurations of Polygons and Polyhedra | p. 748 |
| Improved Bounds and Schemes for the Declustering Problem | p. 760 |
| Crossing Number Is Hard for Cubic Graphs | p. 772 |
| Languages and Complexity | |
| A Reducibility for the Dot-Depth Hierarchy | p. 783 |
| Sublogarithmic Ambiguity | p. 794 |
| An Elementary Proof for the Non-parametrizability of the Equation xyz = zvx | p. 807 |
| A Generalization of Repetition Threshold | p. 818 |
| Quantum Computing | |
| An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation | p. 827 |
| Universal Test for Quantum One-Way Permutations | p. 839 |
| A Common Algebraic Description for Probabilistic and Quantum Computations | p. 851 |
| XML | |
| Extraction and Implication of Path Constraints | p. 863 |
| Schema Evolution for XML: A Consistency-Preserving Approach | p. 876 |
| Complexity of Decision Problems for Simple Regular Expressions | p. 889 |
| Author Index | p. 901 |
| Table of Contents provided by Publisher. All Rights Reserved. |