| Counting the Number of Perfect Matchings in K 5-Free Graphs | 0 | 0.34 | 2016 |
| Reachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace. | 0 | 0.34 | 2015 |
| Reachability in K{3, 3}-free and K5-free Graphs is in Unambiguous Logspace. | 0 | 0.34 | 2014 |
| Graph Isomorphism is not AC^0 reducible to Group Isomorphism. | 0 | 0.34 | 2010 |
| Graph Isomorphism is Not AC0-Reducible to Group Isomorphism | 3 | 0.43 | 2010 |
| The Complexity of Planar Graph Isomorphism. | 2 | 0.38 | 2009 |
| A Log-space Algorithm for Canonization of Planar Graphs | 3 | 0.43 | 2008 |
