Table of Contents

• Page Migration in Dynamic NetworksMarcin Bienkowski, Friedhelm Meyer auf der Heide. 1-14 [doi]
• Knot Theory, Jones Polynomial and Quantum ComputingRusins Freivalds. 15-25 [doi]
• Interactive Algorithms 2005Yuri Gurevich. 26-38 [doi]
• Some Computational Issues in Membrane ComputingOscar H. Ibarra. 39-51 [doi]
• The Generalization of Dirac s Theorem for HypergraphsEndre Szemerédi, Andrzej Rucinski, Vojtech Rödl. 52-56 [doi]
• On the Communication Complexity of Co-linearity ProblemsAndrew Chi-Chih Yao. 57 [doi]
• An Invitation to PlayWieslaw Zielonka. 58-70 [doi]
• The Complexity of Satisfiability Problems: Refining Schaefer s TheoremEric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer. 71-82 [doi]
• On the Number of Random Digits Required in MonteCarlo Integration of Definable FunctionsCésar Luis Alonso, José Luis Montaña, Luis Miguel Pardo. 83-94 [doi]
• Pure Nash Equilibria in Games with a Large Number of ActionsCarme Àlvarez, Joaquim Gabarró, Maria J. Serna. 95-106 [doi]
• On the Complexity of Depth-2 Circuits with Threshold GatesKazuyuki Amano, Akira Maruoka. 107-118 [doi]
• Isomorphic ImplicationMichael Bauland, Edith Hemaspaandra. 119-130 [doi]
• Abstract Numeration Systems and TilingsValérie Berthé, Michel Rigo. 131-143 [doi]
• Adversarial Queueing Model for Continuous Network DynamicsMaria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna. 144-155 [doi]
• Coloring Sparse Random ::::k::::-Colorable Graphs in Polynomial Expected TimeJulia Böttcher. 156-167 [doi]
• Regular Sets of Higher-Order Pushdown StacksArnaud Carayol. 168-179 [doi]
• Linearly Bounded Infinite GraphsArnaud Carayol, Antoine Meyer. 180-191 [doi]
• Basic Properties for Sand AutomataJulien Cervelle, Enrico Formenti, Benoît Masson. 192-211 [doi]
• A Bridge Between the Asynchronous Message Passing Model and Local Computations in GraphsJérémie Chalopin, Yves Métivier. 212-223 [doi]
• Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance MatrixHo-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu. 224-235 [doi]
• New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor SchedulingWun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong. 236-247 [doi]
• Approximating Polygonal Objects by Deformable Smooth SurfacesHo-Lun Cheng, Tony Tan. 248-259 [doi]
• Basis of Solutions for a System of Linear Inequalities in Integers: Computation and ApplicationsDimitri Chubarov, Andrei Voronkov. 260-270 [doi]
• Asynchronous Deterministic Rendezvous in GraphsGianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro. 271-282 [doi]
• Zeta-DimensionDavid Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser. 283-294 [doi]
• Online Interval Coloring with Packing ConstraintsLeah Epstein, Meital Levy. 295-307 [doi]
• Separating the Notions of Self- and AutoreducibilityPiotr Faliszewski, Mitsunori Ogihara. 308-315 [doi]
• Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular AutomataNazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry. 316-327 [doi]
• Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction GraphsGuillaume Fertin, Romeo Rizzi, Stéphane Vialette. 328-339 [doi]
• Matrix and Graph Orders Derived from Locally Constrained Graph HomomorphismsJirí Fiala, Daniël Paulusma, Jan Arne Telle. 340-351 [doi]
• Packing Weighted Rectangles into a SquareAleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba. 352-363 [doi]
• Nondeterministic Graph Searching: From Pathwidth to TreewidthFedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse. 364-375 [doi]
• Goals in the Propositional Horn Language Are Monotone Boolean CircuitsJoxe Gaintzarain, Montserrat Hermo, Marisa Navarro. 376-386 [doi]
• Autoreducibility, Mitoticity, and ImmunityChristian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang. 387-398 [doi]
• Canonical Disjoint NP-Pairs of Propositional Proof SystemsChristian Glaßer, Alan L. Selman, Liyu Zhang. 399-409 [doi]
• Complexity of DNF and Isomorphism of Monotone FormulasJudy Goldsmith, Matthias Hagen, Martin Mundhenk. 410-421 [doi]
• The Expressive Power of Two-Variable Least Fixed-Point LogicsMartin Grohe, Stephan Kreutzer, Nicole Schweikardt. 422-434 [doi]
• Languages Representable by Vertex-Labeled GraphsIgor Grunsky, Oleksiy Kurganskyy, Igor Potapov. 435-446 [doi]
• On the Complexity of Mixed Discriminants and Related ProblemsLeonid Gurvits. 447-458 [doi]
• Two Logical Hierarchies of Optimization Problems over the Real NumbersUffe Flarup Hansen, Klaus Meer. 459-470 [doi]
• Algebras as Knowledge StructuresBernhard Heinemann. 471-482 [doi]
• Combining Self-reducibility and Partial Information AlgorithmsAndré Hernich, Arfst Nickelsen. 483-494 [doi]
• Complexity Bounds for Regular GamesPaul Hunter, Anuj Dawar. 495-506 [doi]
• Basic Mereology with Equivalence RelationsRyszard Janicki. 507-519 [doi]
• Online and Dynamic Recognition of Squarefree StringsJesper Jansson, Zeshan Peng. 520-531 [doi]
• Shrinking Restarting AutomataTomasz Jurdzinski, Friedrich Otto. 532-543 [doi]
• Removing Bidirectionality from Nondeterministic Finite AutomataChristos A. Kapoutsis. 544-555 [doi]
• Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid InequalitiesLeonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich. 556-567 [doi]
• On the Parameterized Complexity of Exact Satisfiability ProblemsJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith. 568-579 [doi]
• Approximating Reversal Distance for Strings with Bounded Number of DuplicatesPetr Kolman. 580-590 [doi]
• Random Databases and Threshold for Monotone Non-recursive DatalogKonstantin Korovin, Andrei Voronkov. 591-602 [doi]
• An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction ProblemsDaniel Král, Ondrej Pangrác. 603-614 [doi]
• Greedy Approximation via Duality for Packing, Combinatorial Auctions and RoutingPiotr Krysta. 615-627 [doi]
• Tight Approximability Results for the Maximum Solution Equation Problem over Z::p::Fredrik Kuivinen. 628-639 [doi]
• The Complexity of Model Checking Higher Order Fixpoint LogicMartin Lange, Rafal Somla. 640-651 [doi]
• An Efficient Algorithm for Computing Optimal Discrete Voltage SchedulesMinming Li, Frances F. Yao. 652-663 [doi]
• Inverse Monoids: Decidability and Complexity of Algebraic QuestionsMarkus Lohrey, Nicole Ondrusch. 664-675 [doi]
• Dimension Is CompressionMaría López-Valdés, Elvira Mayordomo. 676-685 [doi]
• Concurrent Automata vs. Asynchronous SystemsRémi Morin. 686-698 [doi]
• Completeness and Degeneracy in Information Dynamics of Cellular AutomataHidenosuke Nishio. 699-707 [doi]
• Strict Language Inequalities and Their Decision ProblemsAlexander Okhotin. 708-719 [doi]
• Event Structures for the Collective Tokens Philosophy of Inhibitor NetsG. Michele Pinna. 720-732 [doi]
• An Exact 2.9416:::n::: Algorithm for the Three Domatic Number ProblemTobias Riege, Jörg Rothe. 733-744 [doi]
• D-Width: A More Natural Measure for Directed Tree WidthMohammad Ali Safari. 745-756 [doi]
• On Beta-Shifts Having Arithmetical LanguagesJakob Grue Simonsen. 757-768 [doi]
• A BDD-Representation for the Logic of Equality and Uninterpreted FunctionsJaco van de Pol, Olga Tveretina. 769-780 [doi]
• On Small Hard Leaf LanguagesFalk Unger. 781-792 [doi]
• Explicit Inapproximability Bounds for the Shortest Superstring ProblemVirginia Vassilevska. 793-800 [doi]
• Stratified Boolean GrammarsMichal Wrona. 801-812 [doi]