 | 2009 |
|---|
| 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 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 |
