Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Fabian Wagner
2010 – today
- 2013
[j4]Binh Thanh Nguyen, Lena Höglund-Isaksson, Fabian Wagner, Wolfgang Schoepp: Mitigation Efforts Calculator (MEC). Information Systems Frontiers 15(2): 223-233 (2013)- 2012
- [j3]Bireswar Das, Jacobo Torán, Fabian Wagner: Restricted space algorithms for isomorphism on bounded treewidth graphs. Inf. Comput. 217: 71-83 (2012)
- [c15]Binh Thanh Nguyen, Fabian Wagner, Wolfgang Schoepp: Cloud business intelligent services to explore the synergies and interactions among climate change, air quality objectives. Cloud-I 2012: 6
- [c14]Binh Thanh Nguyen, Fabian Wagner, Wolfgang Schoepp: EC4MACS - An Integrated Assessment Toolbox of Well-Established Modeling Tools to Explore the Synergies and Interactions between Climate Change, Air Quality and Other Policy Objectives. ICT-GLOW 2012: 94-108
- 2011
- [c13]Binh Thanh Nguyen, Fabian Wagner, Wolfgang Schoepp: Cloud Intelligent Services for Calculating Emissions and Costs of Air Pollutants and Greenhouse Gases. ACIIDS (1) 2011: 159-168
- [c12]Fabian Wagner: Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$\mbox{{\sf AC}. CSR 2011: 209-222
- [c11]Binh Thanh Nguyen, Fabian Wagner, Wolfgang Schoepp: GAINS - An Interactive Tool for Assessing International GHG Mitigation Regimes. ICT-GLOW 2011: 124-135
- [i11]Fabian Wagner: Graphs of Bounded Treewidth can be Canonized in AC1. Electronic Colloquium on Computational Complexity (ECCC) 18: 32 (2011)
- [i10]Fabian Wagner: On the Complexity of Group Isomorphism. Electronic Colloquium on Computational Complexity (ECCC) 18: 52 (2011)
- 2010
- [j2]Thomas Thierauf, Fabian Wagner: The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace. Theory Comput. Syst. 47(3): 655-673 (2010)
- [c10]Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner: Graph Isomorphism is not AC^0 reducible to Group Isomorphism. FSTTCS 2010: 317-326
- [c9]Binh Thanh Nguyen, Lena Höglund-Isaksson, Fabian Wagner: Mitigation Efforts Calculator (MEC): an online calculator for interactive comparison of mitigation efforts between UNFCCC annex 1 countries. iiWAS 2010: 517-523
- [c8]Bireswar Das, Jacobo Torán, Fabian Wagner: Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. STACS 2010: 227-238
- [i9]Bireswar Das, Jacobo Torán, Fabian Wagner: Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. CoRR abs/1001.0383 (2010)
- [i8]Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: Graph Isomorphism for K{3, 3}-free and K5-free graphs is in Log-space. Electronic Colloquium on Computational Complexity (ECCC) 17: 50 (2010)
- [i7]Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner: Graph Isomorphism is not AC^0 reducible to Group Isomorphism. Electronic Colloquium on Computational Complexity (ECCC) 17: 117 (2010)
2000 – 2009
- 2009
- [j1]Jacobo Torán, Fabian Wagner: The Complexity of Planar Graph Isomorphism. Bulletin of the EATCS 97: 60-82 (2009)
- [c7]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: Planar Graph Isomorphism is in Log-Space. IEEE Conference on Computational Complexity 2009: 203-214
- [c6]Thomas Thierauf, Fabian Wagner: Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space. FCT 2009: 323-334
- [c5]Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. FSTTCS 2009: 145-156
- [i6]Fabian Wagner, Thomas Thierauf: Reachability in K_{3, 3}-free Graphs and K_5-free Graphs is in Unambiguous Log-Space. Electronic Colloquium on Computational Complexity (ECCC) 16: 29 (2009)
- [i5]Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf: Planar Graph Isomorphism is in Log-space. Electronic Colloquium on Computational Complexity (ECCC) 16: 52 (2009)
- [i4]Bireswar Das, Jacobo Torán, Fabian Wagner: Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs. Electronic Colloquium on Computational Complexity (ECCC) 16: 94 (2009)
- 2008
- [c4]Binh Thanh 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
- [c3]Fabian Wagner: Hardness results for isomorphism and automorphism of bounded valence graphs. SOFSEM (2) 2008: 131-140
- [c2]Thomas Thierauf, Fabian Wagner: The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. STACS 2008: 633-644
- [i3]Thomas Thierauf, Fabian Wagner: The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. CoRR abs/0802.2825 (2008)
- [i2]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
- [c1]
- [i1]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)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-20 20:23 CEST by the dblp team