Online Maintenance of k-Medians and k-Covers on a Line. - Rudolf Fleischer; Mordecai J. Golin; Yan Zhang 021 (Algorithmica, 2006)

A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. - Khaled M. Elbassioni; René Sitters; Yan Zhang 021 (ESA, 2007)

The two-median problem on Manhattan meshes. - Mordecai J. Golin; Yan Zhang 021 (Networks, 2007)

A Dynamic Programming Approach To Length-Limited Huffman Coding - Mordecai J. Golin; Yan Zhang 021 (CoRR, 2008)

Online Dynamic Programming Speedups. - Amotz Bar-Noy; Mordecai J. Golin; Yan Zhang 021 (Theory Comput. Syst., 2009)

The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. - Wolfgang W. Bein; Mordecai J. Golin; Lawrence L. Larmore; Yan Zhang 021 (ACM Trans. Algorithms, 2009)

A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. - Mordecai J. Golin; Yan Zhang 021 (IEEE Trans. Inf. Theory, 2010)