Accepted PapersParameterized Complexity of the Anchored k-Core Problem for Directed Graphs On the Parameterised Complexity of String Morphism Problems Clustering with center constraints On the Pseudoperiodic Extension of $u^\ell = v^mw^n$ (Extended Abstract) Ranking with Diverse Intents and Correlated Contents The Combinatorics of Non-determinism Computation of summaries using net unfoldings Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages Geometric Avatar Problems Evaluation is MSOL-compatible A Theory of Partitioned Global Address Spaces Simulation Over One-counter Nets is PSPACE-Complete Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets Energy Efficient Scheduling and Routing via Randomized Rounding Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound Composition problems for braids Primal infon logic: derivability in polynomial time Decidability Results on the Existence of Lookahead Delegators for NFA Parameterized verification of many identical probabilistic timed processes Optimal Constructions for Active Diagnosis Inapproximability of Rainbow Colouring Partial Kernels for Set Cover and Test Cover Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers Saturation of Concurrent Collapsible Pushdown Systems Model Checking and Functional Program Transformations Fair Matchings and Related Problems Replica Placement via Capacitated Vertex Cover Jumping Automata for Uniform Strategies A strong direct product theorem for the tribes function via the smooth-rectangle bound Knapsack Cover subject to a Matroid Constraint Böhm Trees as Higher-Order Recursive Schemes Implementing Realistic Asynchronous Automata PTAS for Ordered Instances of Resource Allocation Problems DLOGTIME proof systems On improved degree lower bounds for polynomial approximation Renting a Cloud On the Structure and Complexity of Rational Sets of Regular Languages On Infinite Words Determined by Stack Automata Emptiness Of Alternating Tree Automata Using Games With Imperfect Information Solvency Markov Decision Processes with Interest
|