A Quest for Subexponential Time Parameterized Algorithms for Planar-k-Path: From Undirected to Directed Alternate Parameterizations Dynamic Parameterized Problems - Algorithms and Complexity Space-efficient Approximation Scheme for Maximum Matching in Sparse Graphs Hardness of multiple choice problems The Chasm at Depth Four, and Tensor Rank : Old results, new insights Isolation Lemma for Directed Reachability and NL vs. L Unbounded Error Communication Complexity of XOR Functions Color Coding-Related Techniques Solving connectivity problems via basic Linear Algebra Topology Matters in Communication Space-efficient Approximation Scheme for Maximum Matching in Sparse Graphs Efficiently decoding Reed-Muller codes from random errors Complexity Classes and the Graph Isomorphism Problem 
