Brian C. Dean

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Improved algorithmic results for unsplittable stable allocation problems Journal of Combinatorial Optimization	2016-10-12	Paper
Determining Parameters Leading to Chaotic Dynamics in Systems	2016-04-23	Paper
Adaptivity and approximation for stochastic packing problems	2014-10-13	Paper
Lightweight approximate selection Algorithms - ESA 2014	2014-10-08	Paper
Building Cartesian trees from free trees with \(k\) leaves Information Processing Letters	2014-05-26	Paper
Speeding up stochastic dynamic programming with zero-delay convolution Algorithmic Operations Research	2013-12-11	Paper
Approximating the stochastic Knapsack problem: the benefit of adaptivity Mathematics of Operations Research	2011-04-27	Paper
Approximation algorithms for \(k\)-hurdle problems Algorithmica	2011-03-02	Paper
Matchability and \(k\)-maximal matchings Discrete Applied Mathematics	2011-01-14	Paper
Faster algorithms for stable allocation problems Algorithmica	2010-10-07	Paper
An efficient algorithm for batch stability testing Algorithmica	2010-10-07	Paper
Rank-Sensitive Priority Queues Lecture Notes in Computer Science	2009-10-20	Paper
A linear‐time algorithm for broadcast domination in a tree Networks	2009-07-28	Paper
The Generalized Stable Allocation Problem WALCOM: Algorithms and Computation	2009-02-24	Paper
Approximation Algorithms for k-Hurdle Problems Lecture Notes in Computer Science	2008-04-15	Paper
Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data Lecture Notes in Computer Science	2008-03-11	Paper
scientific article; zbMATH DE number 5237261 (Why is no real title available?)	2008-02-20	Paper
Embedded minimal disks with prescribed curvature blowup Proceedings of the American Mathematical Society	2006-02-17	Paper
A simple expected running time analysis for randomized ``divide and conquer algorithms Discrete Applied Mathematics	2006-01-10	Paper
A generalization of Rado's theorem for almost graphical boundaries Mathematische Zeitschrift	2005-12-06	Paper
Algorithms for minimum-cost paths in time-dependent networks with waiting policies Networks	2004-08-20	Paper
scientific article; zbMATH DE number 2038780 (Why is no real title available?)	2004-02-08	Paper
Compact embedded minimal surfaces of positive genus without area bounds Geometriae Dedicata	2004-02-03	Paper

Research outcomes over time

This page was built for person: Brian C. Dean