Cs-Cc
A Generalization of Nemhauser and Trotters Local Optimization Theorem
Optimal Aggregation of Blocks into Subproblems in Linear-Programs with Block-Diagonal-Structure
One-Way Reversible and Quantum Finite Automata with Advice
A sufficient condition for first order non-definability of arrowing problems
The Power of Choice for Random Satisfiability
Augmenting a Geometric Matching is $NP$-complete
Inapproximability of Dominating Set in Power Law Graphs
Online Vector Scheduling and Generalized Load Balancing
Computational Asymmetry in Strategic Bayesian Networks
Drawing from hats by noise-based logic
Implicit complexity for coinductive data: a characterization of corecurrence
Local Rules for Computable Planar Tilings
Turing Machines and Understanding Computational Complexity
A PSPACE-Complete First Order Fragment of Computability Logic
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations
The Dissecting Power of Regular Languages
On bilinear algorithms for multiplication in quaternion algebras
Finite and infinite basis in P and NP
Computational Complexity of Interactive Behaviors
A New Upper Bound for the Traveling Salesman Problem in Cubic Graphs
Entry times in automata with simple defect dynamics
