Parallel construction of trees with optimal weighted path length
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Comparison-sorting and selecting in totally monotone matrices
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Sparse dynamic programming I: linear cost functions
Journal of the ACM (JACM)
Sparse dynamic programming II: convex and concave cost functions
Journal of the ACM (JACM)
Parallel construction of optimal alphabetic trees
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Computing a minimum-weight k-link path in graphs with the concave Monge property
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Shortest path in complete bipartite digraph problem and its applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Superlinear bounds on matrix searching
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Selection and sorting in totally monotone arrays
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On-line dynamic programming with applications to the prediction of RNA secondary structure
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A faster off-line algorithm for the TCP acknowledgement problem
Information Processing Letters
Optimal height reduction problems for tree-structured hierarchies
Nordic Journal of Computing
Fast Algorithms with Algebraic Monge Properties
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The algebraic Monge property and path problems
Discrete Applied Mathematics
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
ACM Transactions on Algorithms (TALG)
IEEE Transactions on Information Theory
Monge properties of sequence alignment
Theoretical Computer Science
Online dynamic programming speedups
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
High-quality pagination for publishing
Software—Practice & Experience
Minimum Lk path partitioning-An illustration of the Monge property
Operations Research Letters
Improved complexity bounds for location problems on the real line
Operations Research Letters
Structured p-facility location problems on the line solvable in polynomial time
Operations Research Letters
Monge strikes again: optimal placement of web proxies in the internet
Operations Research Letters
Efficient computational design of tiling arrays using a shortest path approach
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
| Hi-index | 0.06 |