Theory and Applications of Models of Computation

Feedback Arc Set Problem in Bipartite Tournaments.- Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network.- Enhancing Simulation for Checking Language Containment.- QBF-Based Symbolic Model Checking for Knowledge and Time.- A Characterization of the Language Classes Learnable with Correction Queries.- Learnable Algorithm on the Continuum.- Online Deadline Scheduling with Bounded Energy Efficiency.- Efficient Algorithms for Airline Problem.- Efficient Exact Arithmetic over Constructive Reals.- Bounding Run-Times of Local Adiabatic Algorithms.- A Note on Universal Composable Zero Knowledge in Common Reference String Model.- A Note on the Feasibility of Generalized Universal Composability.- t-Private and Secure Auctions.- Secure Multiparty Computations Using a Dial Lock.- A Time Hierarchy Theorem for Nondeterministic Cellular Automata.- Decidability of Propositional Projection Temporal Logic with Infinite Models.- Separation of Data Via Concurrently Determined Discriminant Functions.- The Undecidability of the Generalized Collatz Problem.- Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces.- Maximum Edge-Disjoint Paths Problem in Planar Graphs.- An Efficient Algorithm for Generating Colored Outerplanar Graphs.- Orthogonal Drawings for Plane Graphs with Specified Face Areas.- Absolutely Non-effective Predicates and Functions in Computable Analysis.- Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences.- The Existence of Unsatisfiable Formulas in k-LCNF for k???3.- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model.- Phase Transition of Multivariate Polynomial Systems.- Approximation Algorithms for Maximum Edge Coloring Problem.- Two Improved Range-Efficient Algorithms for F 0 Estimation.- Approximation to the Minimum Rooted Star Cover Problem.- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems.- Parameterized Algorithms for Weighted Matching and Packing Problems.- Kernelizations for Parameterized Counting Problems.- Revisiting the Impossibility for Boosting Service Resilience.- An Approximation Algorithm to the k-Steiner Forest Problem.- A Distributed Algorithm of Fault Recovery for Stateful Failover.- Path Embedding on Folded Hypercubes.- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs.