Cs-Cc
Hardness and Parameterized Algorithms on Rainbow Connectivity problem
On the Complexity of Newmans Community Finding Approach for Biological and Social Networks
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
The Clique Problem in Ray Intersection Graphs
Making the long code shorter, with applications to the Unique Games Conjecture
An additive combinatorics approach to the log-rank conjecture in communication complexity
On Approximating Four Covering and Packing Problems
Axiomatizing Resource Bounds for Measure
Automated Complexity Analysis Based on the Dependency Pair Method
Many-one reductions and the category of multivalued functions
Pseudo-random graphs and bit probe schemes with one-sided error
Approximating Fixation Probabilities in the Generalized Moran Process
Applications of Monotone Rank to Complexity Theory
Fast Balanced Partitioning is Hard, Even on Grids and Trees
The tile assembly model is intrinsically universal
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
Neuropsychological constraints to human data production on a global scale
Tight bounds on the threshold for permuted k-colorability
Maximum Bounded Rooted-Tree Packing Problem
Reflexivity and the diagonal argument in proofs of limitative theorems
Pancake Flipping is Hard
The complexity of conservative valued CSPs
