Superlinear lower bounds for multipass graph processingVenkatesan GuruswamiKrzysztof Onak2013CCC 2013
Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex coverSushant SachdevaRishi Saket2013CCC 2013