Cs-Cc
Rainbow connections for planar graphs and line graphs
On the behaviour of random K-SAT on trees
Monomials in arithmetic circuits: Complete problems in the counting hierarchy
Distributed Maximal Matching: Greedy is Optimal
Universal computably enumerable sets and initial segment prefix-free complexity
The complexity of small universal Turing machines: a survey
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs
Two-Way Automata Making Choices Only at the Endmarkers
Subspace Evasive Sets
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
On the Hidden Shifted Power Problem
Approximation for Maximum Surjective Constraint Satisfaction Problems
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
The traveling salesman problem on cubic and subcubic graphs
Alan Turing and the Origins of Complexity
The Complexity of Weighted Counting for Acyclic Conjunctive Queries
Spider Solitaire is NP-Complete
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
A Satisfiability Algorithm for AC$^0$
Further hardness results on the rainbow vertex-connection number of graphs
Construction of an NP Problem with an Exponential Lower Bound
An Approximation Algorithm for #k-SAT
