Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities von Arumugam, Guru Prakash, Augustine, John, Golin, Mordecai J., Srikanthan, Prashanth

Volltext

Multiple Sink Location Problems in Dynamic Path Networks von Higashikawa, Yuya, Golin, Mordecai J., Katoh, Naoki

Volltext

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks von Bhattacharya, Binay, Golin, Mordecai J., Higashikawa, Yuya, Kameda, Tsunehiko, Katoh, Naoki

Volltext

Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme von Golin, Mordecai J., Mathieu, Claire, Young, Neal E.

Volltext

The asymptotic number of spanning trees in circulant graphs von Golin, Mordecai J., Yong, Xuerong, Zhang, Yuanping

Volltext

The transfer matrices and the capacity of the 2-dimensional (1,∞)-runlength limited constraint von Chen, Zhibing, Golin, Mordecai J., Yong, Xuerong

Volltext

The number of spanning trees in a class of double fixed-step loop networks von Yong, Xuerong, Zhang, Yuanping, Golin, Mordecai J.

Volltext

The two-median problem on Manhattan meshes von Golin, Mordecai J., Zhang, Yan

Volltext

A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs von Golin, M.J., Rote, G.

Volltext

Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters von Golin, Mordecai J., Leung, Yiu Cho

Volltext

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity von Higashikawa, Yuya, Golin, Mordecai J., Katoh, Naoki

Volltext

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes von Golin, Mordecai J., Na, Hyeon-Suk

Volltext

A combinatorial approach to Golomb forests von Golin, Mordecai J.

Volltext

Online Maintenance of k-Medians and k-Covers on a Line von Fleischer, Rudolf, Golin, Mordecai J., Zhang, Yan

Volltext

Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas von Devillers, Olivier, Golin, Mordecai J.

Volltext

A (Weakly) Polynomial Algorithm for AIVF Coding von Dolatabadi, Reza Hosseini, Golin, Mordecai J, Zamani, Arian

Volltext bestellen

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity von Higashikawa, Yuya, Golin, Mordecai J., Katoh, Naoki

Volltext

On the optimal placement of web proxies in the Internet von Bo Li, Golin, M.J., Italiano, G.F., Xin Deng, Sohraby, K.

Volltext

Queue-mergesort von Golin, Mordecai J., Sedgewick, Robert

Volltext

Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows von Chen, Di, Golin, Mordecai J

Volltext bestellen