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
The Envelope of a Digital Curve Based on Dominant Points
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Information Processing Letters
Sequence Alignment Algorithms for Run-Length-Encoded Strings
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
ACM Transactions on Algorithms (TALG)
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
IEEE/ACM Transactions on Networking (TON)
Geometric algorithms for the constrained 1-D K-means clustering problems and IMRT applications
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Algorithmics in intensity-modulated radiation therapy
Algorithms and theory of computation handbook
A fully compressed algorithm for computing the edit distance of run-length encoded strings
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast sequence similarity computing with LCS on LARPBS
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Fast scalable algorithm on LARPBS for sequence alignment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
On the complexity of sparse exon assembly
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Fast parallel algorithms for the longest common subsequence problem using an optical bus
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
A high-throughput approach for associating microRNAs with their activity conditions
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
A study of accessible motifs and RNA folding complexity
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
A new field splitting algorithm for intensity-modulated radiation therapy
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms
| Hi-index | 0.00 |
A two-dimensional array A=(a/sub i,j/) is called monotone if the maximum entry in its ith row lies below or to the right of the maximum entry in its (i- 1)-st row. An array A is called totally monotone if every 2*2 subarray (i.e., every 2*2 minor) is monotone. The notion of two-dimensional totally monotone arrays is generalized to multidimensional arrays, and a wide variety of problems are exhibited involving computational geometry, dynamic programming, VLSI river routing, and finding certain kinds of shortest paths that can be solved efficiently by finding maxima in totally monotone arrays.