Prasad Chebolu

According to our database, Prasad Chebolu authored at least 10 papers between 2006 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Exact counting of Euler Tours for Graphs of Bounded Treewidth.

Prasad Chebolu, Mary Cryan, Russell Martin

CoRR, 2013

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 generalized series-parallel graphs.

Prasad Chebolu, Mary Cryan, Russell Martin

J. Discrete Algorithms, 2012

The complexity of approximately counting stable roommate assignments.

Prasad Chebolu, Leslie Ann Goldberg, Russell Martin

J. Comput. Syst. Sci., 2012

2010

Finding a maximum matching in a sparse random graph in <i>O</i>(<i>n</i>) expected time.

Prasad Chebolu, Alan M. Frieze, Páll Melsted

J. ACM, 2010

2009

Average-Case Analyses of Vickrey Costs.

Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin

Proceedings of the Approximation, 2009

2008

Hamilton Cycles in Random Lifts of Directed Graphs.

Prasad Chebolu, Alan M. Frieze

SIAM J. Discret. Math., 2008

PageRank and the random surfer model.

Prasad Chebolu, Páll Melsted

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.

Prasad Chebolu, Alan M. Frieze, Páll Melsted

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2006

Hamilton cycles in random lifts of graphs.

K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze

Eur. J. Comb., 2006