|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley |
Approximation Algorithms for k-hurdle Problems.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae |
Matchability and k-maximal matchings. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | John Dabney, Brian C. Dean |
An Efficient Algorithm for Batch Stability Testing. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Siddharth Munshi |
Faster Algorithms for Stable Allocation Problems. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean |
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution. |
Algorithmic Operations Research |
2010 |
DBLP BibTeX RDF |
|
| 1 | John Dabney, Brian C. Dean |
Adaptive stable marriage algorithms. |
ACM Southeast Regional Conference |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | John Dabney, Brian C. Dean, Stephen T. Hedetniemi |
A linear-time algorithm for broadcast domination in a tree. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, William B. Pressly, Brian A. Malloy, Adam A. Whitley |
A Linear Programming Approach for Automated Localization of Multiple Faults. |
ASE |
2009 |
DBLP DOI BibTeX RDF |
spectrum-based fault localization, fault localization |
| 1 | Brian C. Dean, Namrata Swar |
The Generalized Stable Allocation Problem. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Zachary H. Jones |
Rank-Sensitive Priority Queues. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Michel X. Goemans, Jan Vondrák |
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. |
Math. Oper. Res. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Adam Griffis, Adam A. Whitley |
Approximation Algorithms for k-Hurdle Problems. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Zachary H. Jones |
Exploring the duality between skip lists and binary search trees. |
ACM Southeast Regional Conference |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean |
A simple expected running time analysis for randomized "divide and conquer" algorithms. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Michel X. Goemans, Nicole Immorlica |
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Michel X. Goemans, Nicole Immorlica |
The Unsplittable Stable Marriage Problem. |
IFIP TCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Michel X. Goemans, Jan Vondrák |
Adaptivity and approximation for stochastic packing problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean |
Algorithms for minimum-cost paths in time-dependent networks with waiting policies. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Michel X. Goemans, Jan Vondrák |
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Brian C. Dean, Michel X. Goemans |
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")