No. |
Title |
Author |
Year |
---|

1 |
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces |
Gurjar, Rohit et al. |
2018 |

2 |
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) |
Kabanets, Valentine et al. |
2017 |

3 |
Algebra in Computational Complexity (Dagstuhl Seminar 14391) |
Agrawal, Manindra et al. |
2015 |

4 |
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs |
Gurjar, Rohit et al. |
2015 |

5 |
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) |
Agrawal, Manindra et al. |
2013 |

6 |
09421 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2010 |

7 |
09421 Executive Summary -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2010 |

8 |
Planar Graph Isomorphism is in Log-Space |
Datta, Samir et al. |
2010 |

9 |
Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space |
Datta, Samir et al. |
2009 |

10 |
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2008 |

11 |
07411 Executive Summary -- Algebraic Methods in Computational Complexity |
Agrawal, Manindra et al. |
2008 |

12 |
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace |
Thierauf, Thomas et al. |
2008 |

13 |
04421 Abstracts Collection -- Algebraic Methods in Computational Complexity |
Buhrman, Harry et al. |
2005 |