Prasad Chebolu

14 papers A* 1Journal 10Unranked 3
YearRankTypeTitle / Venue / Authors
2013 J jnl
Exact counting of Euler Tours for Graphs of Bounded Treewidth.
CoRR
Prasad Chebolu, Mary Cryan, Russell Martin
2012 J jnl
Exact counting of Euler tours for generalized series-parallel graphs.
J. Discrete Algorithms
Prasad Chebolu, Mary Cryan, Russell Martin
2012 J jnl
The complexity of approximately counting stable matchings.
Theor. Comput. Sci.
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
2012 J jnl
The complexity of approximately counting stable roommate assignments.
J. Comput. Syst. Sci.
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
2010 J jnl
Exact counting of Euler Tours for generalized series-parallel graphs
CoRR
Prasad Chebolu, Mary Cryan, Russell A. Martin
2010 J jnl
Finding a maximum matching in a sparse random graph in
J. ACM
Prasad Chebolu, Alan M. Frieze, Páll Melsted
2010 J jnl
The Complexity of Approximately Counting Stable Matchings
CoRR
Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin
2010 — conf
The Complexity of Approximately Counting Stable Matchings.
APPROX-RANDOM
Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin
2010 J jnl
The Complexity of Approximately Counting Stable Roommate Assignments
CoRR
Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin
2009 — conf
Average-Case Analyses of Vickrey Costs.
APPROX-RANDOM
Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin
2008 — conf
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time.
ICALP (1)
Prasad Chebolu, Alan M. Frieze, Páll Melsted
2008 J jnl
Hamilton Cycles in Random Lifts of Directed Graphs.
SIAM J. Discret. Math.
Prasad Chebolu, Alan M. Frieze
2008 A* conf
PageRank and the random surfer model.
SODA
Prasad Chebolu, Páll Melsted
2006 J jnl
Hamilton cycles in random lifts of graphs.
Eur. J. Comb.
K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze