Brian C. Dean

	2011
20		Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley: Approximation Algorithms for k-hurdle Problems. Algorithmica 59(1): 81-93 (2011)
19		Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae: Matchability and k-maximal matchings. Discrete Applied Mathematics 159(1): 15-22 (2011)
	2010
18		John Dabney, Brian C. Dean: Adaptive stable marriage algorithms. ACM Southeast Regional Conference 2010: 35
17		Brian C. Dean: Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution. Algorithmic Operations Research 5(2): 96-104 (2010)
16		John Dabney, Brian C. Dean: An Efficient Algorithm for Batch Stability Testing. Algorithmica 58(1): 52-58 (2010)
15		Brian C. Dean, Siddharth Munshi: Faster Algorithms for Stable Allocation Problems. Algorithmica 58(1): 59-81 (2010)
	2009
14		Brian C. Dean, William B. Pressly, Brian A. Malloy, Adam A. Whitley: A Linear Programming Approach for Automated Localization of Multiple Faults. ASE 2009: 640-644
13		Brian C. Dean, Zachary H. Jones: Rank-Sensitive Priority Queues. WADS 2009: 181-192
12		Brian C. Dean, Namrata Swar: The Generalized Stable Allocation Problem. WALCOM 2009: 238-249
11		John Dabney, Brian C. Dean, Stephen T. Hedetniemi: A linear-time algorithm for broadcast domination in a tree. Networks 53(2): 160-169 (2009)
	2008
10		Brian C. Dean, Adam Griffis, Adam A. Whitley: Approximation Algorithms for k-Hurdle Problems. LATIN 2008: 449-460
9		Brian C. Dean, Michel X. Goemans, Jan Vondrák: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Math. Oper. Res. 33(4): 945-964 (2008)
	2007
8		Brian C. Dean, Zachary H. Jones: Exploring the duality between skip lists and binary search trees. ACM Southeast Regional Conference 2007: 395-399
	2006
7		Brian C. Dean, Michel X. Goemans, Nicole Immorlica: Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. ESA 2006: 268-279
6		Brian C. Dean, Michel X. Goemans, Nicole Immorlica: The Unsplittable Stable Marriage Problem. IFIP TCS 2006: 65-75
5		Brian C. Dean: A simple expected running time analysis for randomized "divide and conquer" algorithms. Discrete Applied Mathematics 154(1): 1-5 (2006)
	2005
4		Brian C. Dean, Michel X. Goemans, Jan Vondrák: Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404
	2004
3		Brian C. Dean, Michel X. Goemans, Jan Vondrák: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217
2		Brian C. Dean: Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44(1): 41-46 (2004)
	2003
1		Brian C. Dean, Michel X. Goemans: Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. ICALP 2003: 1138-1152

Coauthor Index

1	John Dabney	[11] [16] [18]
2	Michel X. Goemans	[1] [3] [4] [6] [7] [9]
3	Adam Griffis	[10] [20]
4	Sandra Mitchell Hedetniemi (Sandra L. Mitchell)	[19]
5	Stephen T. Hedetniemi	[11] [19]
6	Nicole Immorlica	[6] [7]
7	Zachary H. Jones	[8] [13]
8	Jason Lewis	[19]
9	Brian A. Malloy	[14]
10	Alice A. McRae	[19]
11	Siddharth Munshi	[15]
12	Ojas Parekh	[20]
13	William B. Pressly	[14]
14	Namrata Swar	[12]
15	Jan Vondrák	[3] [4] [9]
16	Adam A. Whitley	[10] [14] [20]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page