- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j11 |      | Brian C. Dean, Raghuveer Mohan: Building Cartesian trees from free trees with k leaves. Inf. Process. Lett. 113(9): 345-349 (2013) |
| j10 | | Scott T. Wood, Brian C. Dean, Delphine Dean: A linear programming approach to reconstructing subcellular structures from confocal images for automated generation of representative 3D cellular models. Medical Image Analysis 17(3): 337-347 (2013) |
| c13 | | Matthew H. Dabney, Brian C. Dean, Tom Rogers: No sensor left behind: enriching computing education with mobile devices. SIGCSE 2013: 627-632 |
| c12 | | Sam Bryfczynski, Brian C. Dean, Roy P. Pargas, Melanie Cooper, Michael Klymkowsky: Teaching data structures with BeSocratic (abstract only). SIGCSE 2013: 736 |
| 2011 | ||
| j9 | | Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley: Approximation Algorithms for k-hurdle Problems. Algorithmica 59(1): 81-93 (2011) |
| j8 | | 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 | ||
| j7 | | John Dabney, Brian C. Dean: An Efficient Algorithm for Batch Stability Testing. Algorithmica 58(1): 52-58 (2010) |
| j6 | | Brian C. Dean, Siddharth Munshi: Faster Algorithms for Stable Allocation Problems. Algorithmica 58(1): 59-81 (2010) |
| j5 | | Brian C. Dean: Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution. Algorithmic Operations Research 5(2): 96-104 (2010) |
| c11 | | John Dabney, Brian C. Dean: Adaptive stable marriage algorithms. ACM Southeast Regional Conference 2010: 35 |
| 2009 | ||
| j4 | | John Dabney, Brian C. Dean, Stephen T. Hedetniemi: A linear-time algorithm for broadcast domination in a tree. Networks 53(2): 160-169 (2009) |
| c10 | | 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 |
| c9 | | |
| c8 | | |
| 2008 | ||
| j3 | | 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) |
| c7 | | Brian C. Dean, Adam Griffis, Adam A. Whitley: Approximation Algorithms for k-Hurdle Problems. LATIN 2008: 449-460 |
| 2007 | ||
| c6 | | Brian C. Dean, Zachary H. Jones: Exploring the duality between skip lists and binary search trees. ACM Southeast Regional Conference 2007: 395-399 |
| 2006 | ||
| j2 | | Brian C. Dean: A simple expected running time analysis for randomized "divide and conquer" algorithms. Discrete Applied Mathematics 154(1): 1-5 (2006) |
| c5 | | 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 |
| c4 | | Brian C. Dean, Michel X. Goemans, Nicole Immorlica: The Unsplittable Stable Marriage Problem. IFIP TCS 2006: 65-75 |
| 2005 | ||
| c3 | | Brian C. Dean, Michel X. Goemans, Jan Vondrák: Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404 |
| 2004 | ||
| j1 | | Brian C. Dean: Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44(1): 41-46 (2004) |
| c2 | | Brian C. Dean, Michel X. Goemans, Jan Vondrák: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217 |
| 2003 | ||
| c1 | | Brian C. Dean, Michel X. Goemans: Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. ICALP 2003: 1138-1152 |
Colors in the list of coauthors
Last update Fri May 24 13:50:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page