![]() | ![]() |
2008 | ||
---|---|---|
7 | Fabian Wagner: Hardness results for isomorphism and automorphism of bounded valence graphs. SOFSEM (2) 2008: 131-140 | |
6 | EE | Thomas Thierauf, Fabian Wagner: The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. STACS 2008: 633-644 |
5 | EE | Thanh Binh Nguyen, Wolfgang Schoepp, Fabian Wagner: GAINS-BI: business intelligent approach for greenhouse gas and air pollution interactions and synergies information system. iiWAS 2008: 332-338 |
4 | EE | Thomas Thierauf, Fabian Wagner: The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace CoRR abs/0802.2825: (2008) |
3 | EE | Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: A Log-space Algorithm for Canonization of Planar Graphs CoRR abs/0809.2319: (2008) |
2007 | ||
2 | EE | Fabian Wagner: Hardness Results for Tournament Isomorphism and Automorphism. MFCS 2007: 572-583 |
1 | EE | Thomas Thierauf, Fabian Wagner: The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. Electronic Colloquium on Computational Complexity (ECCC) 14(068): (2007) |
1 | Samir Datta | [3] |
2 | Nutan Limaye | [3] |
3 | Thanh Binh Nguyen | [5] |
4 | Prajakta Nimbhorkar | [3] |
5 | Wolfgang Schoepp | [5] |
6 | Thomas Thierauf | [1] [3] [4] [6] |