Prasad Chebolu

	2012
11		Prasad Chebolu, Mary Cryan, Russell Martin: Exact counting of Euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10: 110-122 (2012)
	2010
10		Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Matchings. APPROX-RANDOM 2010: 81-94
9		Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Matchings CoRR abs/1004.1836: (2010)
8		Prasad Chebolu, Mary Cryan, Russell A. Martin: Exact counting of Euler Tours for generalized series-parallel graphs CoRR abs/1005.3477: (2010)
7		Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin: The Complexity of Approximately Counting Stable Roommate Assignments CoRR abs/1012.1237: (2010)
6		Prasad Chebolu, Alan M. Frieze, Páll Melsted: Finding a maximum matching in a sparse random graph in O(n) expected time. J. ACM 57(4): (2010)
	2009
5		Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin: Average-Case Analyses of Vickrey Costs. APPROX-RANDOM 2009: 434-447
	2008
4		Prasad Chebolu, Alan M. Frieze, Páll Melsted: Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. ICALP (1) 2008: 161-172
3		Prasad Chebolu, Páll Melsted: PageRank and the random surfer model. SODA 2008: 1010-1018
2		Prasad Chebolu, Alan M. Frieze: Hamilton Cycles in Random Lifts of Directed Graphs. SIAM J. Discrete Math. 22(2): 520-540 (2008)
	2006
1		K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. Frieze: Hamilton cycles in random lifts of graphs. Eur. J. Comb. 27(8): 1282-1293 (2006)

Coauthor Index

1	K. Burgin	[1]
2	Colin Cooper	[1]
3	Mary Cryan	[8] [11]
4	Alan M. Frieze	[1] [2] [4] [5] [6]
5	Leslie Ann Goldberg	[7] [9] [10]
6	Russell Martin (Russell A. Martin)	[7] [8] [9] [10] [11]
7	Páll Melsted	[3] [4] [5] [6]
8	Gregory B. Sorkin	[5]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page