| No. |
Title |
Author |
Year |
| 1 |
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) |
Agrawal, Manindra et al. |
2013 |
| 2 |
09421 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2010 |
| 3 |
09421 Executive Summary -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2010 |
| 4 |
Planar Graph Isomorphism is in Log-Space |
Datta, Samir et al. |
2010 |
| 5 |
Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space |
Datta, Samir et al. |
2009 |
| 6 |
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2008 |
| 7 |
07411 Executive Summary -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2008 |
| 8 |
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace |
Thierauf, Thomas et al. |
2008 |
| 9 |
04421 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Buhrman, Harry et al. |
2005 |
