| Depth-first search in directed planar graphs, revisited | 0 | 0.34 | 2022 |
| Dynamic Meta-Theorems for Distance and Matching | 0 | 0.34 | 2022 |
| Dynamic complexity of Reachability: How many changes can we handle? | 0 | 0.34 | 2020 |
| Randomized and Symmetric Catalytic Computation. | 0 | 0.34 | 2020 |
| Planarity, Exclusivity, and Unambiguity. | 0 | 0.34 | 2019 |
| Reachability and Distances under Multiple Changes. | 0 | 0.34 | 2018 |
| Shortest k-Disjoint Paths via Determinants. | 1 | 0.36 | 2018 |
| Planar Maximum Matching - Towards a Parallel Algorithm. | 0 | 0.34 | 2018 |
| A Strategy for Dynamic Programs: Start over and Muddle through. | 1 | 0.35 | 2017 |
| Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. | 3 | 0.39 | 2016 |
| Counting Euler Tours in Undirected Bounded Treewidth Graphs | 3 | 0.43 | 2015 |
| Graph properties in node-query setting: effect of breaking symmetry | 0 | 0.34 | 2015 |
| Space Complexity of Optimization Problems in Planar Graphs. | 1 | 0.35 | 2014 |
| Dynamic Complexity of Directed Reachability and Other Problems. | 1 | 0.35 | 2014 |
| Space complexity: what makes planar graphs special? | 0 | 0.34 | 2013 |
| Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. | 4 | 0.41 | 2013 |
| Improved Bounds for Bipartite Matching on Surfaces. | 5 | 0.42 | 2012 |
| Verifying Proofs In Constant Depth | 0 | 0.34 | 2012 |
| Computing bits of algebraic numbers | 1 | 0.36 | 2012 |
| Planarity Testing Revisited | 3 | 0.50 | 2011 |
| Verifying proofs in constant depth | 1 | 0.37 | 2011 |
| Some tractable win-lose games | 0 | 0.34 | 2011 |
| Counting classes and the fine structure between NC1and L | 3 | 0.43 | 2010 |
| Space complexity of perfect matching in bounded genus bipartite graphs | 9 | 0.49 | 2010 |
| Perfect Matching in Bipartite Planar Graphs is in UL | 3 | 0.40 | 2010 |
| Graph Isomorphism for K{3, 3}-free and K5-free graphs is in Log-space. | 0 | 0.34 | 2010 |
| Log-Space Algorithms for Paths and Matchings in k-Trees | 10 | 0.65 | 2010 |
| Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space | 9 | 0.51 | 2009 |
| Planar and Grid Graph Reachability Problems | 22 | 0.99 | 2009 |
| Planar Graph Isomorphism is in Log-space. | 0 | 0.34 | 2009 |
| A Log-space Algorithm for Canonization of Planar Graphs | 3 | 0.43 | 2008 |
| 3-connected Planar Graph Isomorphism is in Log-space | 2 | 0.40 | 2008 |
| Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs | 21 | 0.81 | 2008 |
| Planarity, Determinants, Permanents, and (Unique) Matchings | 8 | 0.53 | 2007 |
| One-Input-Face MPCVP Is Hard for L, But in LogDCFL | 9 | 0.58 | 2006 |
| The Directed Planar Reachability Problem | 22 | 1.23 | 2005 |
| Topology Inside NC1 | 4 | 0.45 | 2005 |
| Grid Graph Reachability Problems | 15 | 0.89 | 2005 |
| Characterizing Small Depth and Small Space Classes by Operators of Higher Types | 0 | 0.34 | 2000 |
| Bounded Depth Arithmetic Circuits: Counting and Closure | 15 | 0.89 | 1999 |
| On TC0, AC0, and arithmetic circuits | 21 | 1.13 | 1997 |
