The following pages link to Brian C. Dean (Q326456):
Displaying 23 items.
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- (Q1421749) (redirect page) (← links)
- Compact embedded minimal surfaces of positive genus without area bounds (Q1421750) (← links)
- An efficient algorithm for batch stability testing (Q1959725) (← links)
- Faster algorithms for stable allocation problems (Q1959735) (← links)
- Building Cartesian trees from free trees with \(k\) leaves (Q2450934) (← links)
- A generalization of Rado's theorem for almost graphical boundaries (Q2575660) (← links)
- A simple expected running time analysis for randomized ``divide and conquer'' algorithms (Q2581554) (← links)
- (Q2865860) (← links)
- Lightweight Approximate Selection (Q2921416) (← links)
- (Q2921694) (← links)
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity (Q3169009) (← links)
- Rank-Sensitive Priority Queues (Q3183452) (← links)
- Embedded minimal disks with prescribed curvature blowup (Q3372098) (← links)
- The Generalized Stable Allocation Problem (Q3605501) (← links)
- (Q4449247) (← links)
- Algorithms for minimum-cost paths in time-dependent networks with waiting policies (Q4812400) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- (Q5443191) (← links)
- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data (Q5449534) (← links)
- Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
