Sparse dynamic programming II: convex and concave cost functions
Journal of the ACM (JACM)
Software process validation: quantitatively measuring the correspondence of a process to a model
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
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 sub-quadratic sequence alignment algorithm for unrestricted cost matrices
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A faster off-line algorithm for the TCP acknowledgement problem
Information Processing Letters
Sparse LCS common substring alignment
Information Processing Letters
Speech recognition in parallel
HLT '89 Proceedings of the workshop on Speech and Natural Language
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A lagrangian relaxation approach for the multiple sequence alignment problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
High-quality pagination for publishing
Software—Practice & Experience
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Minimum Lk path partitioning-An illustration of the Monge property
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.00 |