( en | de | ru )

 

Disambiguation of "Chebolu, Prasad"

Author of the publication

copydeleteadd this publication to your clipboard
Exact counting of Euler tours for generalized series-parallel graphs.

, , and . J. Discrete Algorithms, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sharad Prasad

Athul Prasad

Kumkum Prasad

Prasad Samarakoon

Manika Prasad

 

Other publications of authors with the same name

The complexity of approximately counting stable matchings., , and . Theor. Comput. Sci., (2012)PageRank and the random surfer model, and . Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, page 1010--1018. Society for Industrial and Applied Mathematics, (2008)Exact counting of Euler Tours for generalized series-parallel graphs, , and . CoRR, (2010)The Complexity of Approximately Counting Stable Roommate Assignments, , and . CoRR, (2010)Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 161-172. Springer, (2008)Hamilton Cycles in Random Lifts of Directed Graphs., and . SIAM J. Discret. Math., 22 (2): 520-540 (2008)Exact counting of Euler tours for generalized series-parallel graphs., , and . J. Discrete Algorithms, (2012)Average-Case Analyses of Vickrey Costs., , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 434-447. Springer, (2009)The Complexity of Approximately Counting Stable Matchings., , and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 81-94. Springer, (2010)Exact counting of Euler Tours for Graphs of Bounded Treewidth., , and . CoRR, (2013)