Cs-Cc
Quantum Copy-Protection and Quantum Money
Complexity of Ising Polynomials
The Complexity of Rooted Phylogeny Problems
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets
Parameterized Complexity of Satisfying Almost All Linear Equations over $mathbb{F}_2$
Clique cover and graph separation: New incompressibility results
Memoryless computation: new results, constructions, and extensions
Improved Lower Bounds for the Shortest Superstring and Related Problems
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
