Secure Multiparty Computations Using a Dial Lock Extended Abstract 499

A Time Hierarchy Theorem for Nondeterministic Cellular Automata 511

Decidability of Propositional Projection Temporal Logic with Infinite Models 521

Separation of Data Via Concurrently Determined Discriminant Functions 533

The Undecidability of the Generalized Collatz Problem 542

Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and NearlyEuclidean Spaces 554

Maximum EdgeDisjoint Paths Problem in Planar Graphs 566

An Efficient Algorithm for Generating Colored Outerplanar Graphs 573

Orthogonal Drawings for Plane Graphs with Specified Face Areas 584

Absolutely Noneffective Predicates and Functions in Computable Analysis 595

LinearSize LogDepth NegationLimited Inverter for kTonic Binary Sequences 605

The Existence of Unsatisfiable Formulas in kLCNF for k 3 616

Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model 624

Phase Transition of Multivariate PolynomialSystems 632

Approximation Algorithms for Maximum Edge Coloring Problem 646

Two Improved RangeEfficient Algorithms for F_0 Estimation 659

Approximation to the Minimum Rooted Star Cover Problem 670

Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems 680

Parameterized Algorithms for Weighted Matching and Packing Problems 692

Kernelizations for Parameterized Counting Problems 703

Revisiting the Impossibility for Boosting Service Resilience 715

An Approximation Algorithm to the kSteiner Forest Problem 728

A Distributed Algorithm of Fault Recovery for Stateful Failover 738

Path Embedding on Folded Hypercubes 750

An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs 760