Cs-Cc
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix
On a Certain NP-Complete Problem
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
Timeline-based planning: Expressiveness and Complexity
The Two Bicliques Problem is in NP intersection coNP
Arithmetic complexity via effective names for random sequences
Dense locally testable codes cannot have constant rate and distance
Does Treewidth Help in Modal Satisfiability?
Infinite Time Cellular Automata: A Real Computation Model
Multiply-Recursive Upper Bounds with Higmans Lemma
The Complexity of Approximately Counting Stable Roommate Assignments
Hypergraph matching for MU-MIMO user grouping in wireless LANs
Logical complexity of graphs: a survey
Multicolored Dynamos on Toroidal Meshes
The Complexity of Surjective Homomorphism Problems -- a Survey
Some 0/1 polytopes need exponential size extended formulations
Elements of Scheduling
Complexity Results for Modal Dependence Logic
Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs
Quantum property testing for bounded-degree graphs
Approximating Matrix p-norms
QCSP on partially reflexive forests
