 | 2009 |
|---|
| 8 |       | Thomas Thierauf,
Fabian Wagner:
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space.
FCT 2009: 323-334 |
| 2008 |
|---|
| 7 |  | Fabian Wagner:
Hardness results for isomorphism and automorphism of bounded valence graphs.
SOFSEM (2) 2008: 131-140 |
| 6 | | Thomas Thierauf,
Fabian Wagner:
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.
STACS 2008: 633-644 |
| 5 | | 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 | | Thomas Thierauf,
Fabian Wagner:
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
CoRR abs/0802.2825: (2008) |
| 3 | | 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 | | Fabian Wagner:
Hardness Results for Tournament Isomorphism and Automorphism.
MFCS 2007: 572-583 |
| 1 | | 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) |
