SIAM Journal on Computing
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Finding least-weight subsequences with fewer processors
SIGAL '90 Proceedings of the international symposium on Algorithms
Parallel construction of trees with optimal weighted path length
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Optimal quantization by matrix searching
Journal of Algorithms
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Dynamic Programming on Intervals
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming
A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming
Efficient approximation algorithms for floorplan area minimization
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Finding subsets maximizing minimum structures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient list-approximation techniques for floorplan area minimization
ACM Transactions on Design Automation of Electronic Systems (TODAES)
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
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Clustering based on principal curve
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Shape rectangularization problems in intensity-modulated radiation therapy
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Monge matrices make maximization manageable
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 |