Showed that the problem of counting Eulerian Tours in undirected bounded-treewidth graphs is

tractable even in parallel by proving a #SAC^1 upper bound. This is in stark contrast to the #P-completeness of the same problem in general graphs.

The areas primarily dealt with were Combinatorics and Complexity Theory in Theoretical

Computer Science.

arXiv link to the paper: https://arxiv.org/abs/1510.04035