Andreas Göbel

Andreas Göbel

Doctoral Student

Student, St John's College

Leaving date: 3rd November 2016

Themes:

• Algorithms and Complexity Theory

Completed Projects:

• MCC

Interests

Computational Counting, Computational Complexity, Randomized Algorithms

Selected Publications

View AllManage publications

• The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2

  Andreas Göbel‚ Leslie Ann Goldberg and David Richerby

  In CoRR. Vol. abs/1307.0556. 2013.

  Details about The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2 | BibTeX data for The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2

• Counting list matrix partitions of graphs

  Andreas Göbel‚ Leslie Ann Goldberg‚ Colin McQuillan‚ David Richerby and Tomoyuki Yamakami

  In CoRR. Vol. abs/1306.5176. 2013.

  Details about Counting list matrix partitions of graphs | BibTeX data for Counting list matrix partitions of graphs

• On the Connection between Interval Size Functions and Path Counting

  Evangelos Bampas‚ Andreas−Nikolas Göbel‚ Aris Pagourtzis and Aris Tentes

  In TAMC. Pages 108−117. 2009.

  Details about On the Connection between Interval Size Functions and Path Counting | BibTeX data for On the Connection between Interval Size Functions and Path Counting

Supervisor