Hamilton cycles in random lifts of graphs. - K. Burgin; Prasad Chebolu; Colin Cooper; Alan M. Frieze (Eur. J. Comb., 2006)

Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. - Prasad Chebolu; Alan M. Frieze; Páll Melsted (ICALP (1), 2008)

PageRank and the random surfer model. - Prasad Chebolu; Páll Melsted (SODA, 2008)

Hamilton Cycles in Random Lifts of Directed Graphs. - Prasad Chebolu; Alan M. Frieze (SIAM J. Discret. Math., 2008)

Average-Case Analyses of Vickrey Costs. - Prasad Chebolu; Alan M. Frieze; Páll Melsted; Gregory B. Sorkin (APPROX-RANDOM, 2009)

Finding a maximum matching in a sparse random graph in O(n) expected time. - Prasad Chebolu; Alan M. Frieze; Páll Melsted (J. ACM, 2010)

The complexity of approximately counting stable roommate assignments. - Prasad Chebolu; Leslie Ann Goldberg; Russell Martin (J. Comput. Syst. Sci., 2012)

Exact counting of Euler tours for generalized series-parallel graphs. - Prasad Chebolu; Mary Cryan; Russell Martin (J. Discrete Algorithms, 2012)

The complexity of approximately counting stable matchings. - Prasad Chebolu; Leslie Ann Goldberg; Russell Martin (Theor. Comput. Sci., 2012)

Exact counting of Euler Tours for Graphs of Bounded Treewidth. - Prasad Chebolu; Mary Cryan; Russell Martin (CoRR, 2013)