Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
On the complexity of circulations
Journal of Algorithms
Partitioning point sets in arbitrary dimension
Theoretical Computer Science
On the detection of a common intersection of k convex polyhedra
Proceedings on International Workshop on Computational Geometry on Computational Geometry and its Applications
L-infinity interdistance selection by parametric search
Information Processing Letters
An optimal-time algorithm for slope selection
SIAM Journal on Computing
Journal of the ACM (JACM)
A Shifting Algorithm for Min-Max Tree Partitioning
Journal of the ACM (JACM)
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finding a minimum weight K-link path in graphs with Monge property and applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Folding a stack of equal width components
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Optimal folding of standard and custom cells
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Distributed and Parallel Databases - Special issue: Parallel and distributed data mining
Efficient Partitioning of Sequences
IEEE Transactions on Computers
Optimal height reduction problems for tree-structured hierarchies
Nordic Journal of Computing
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Continuous bottleneck tree partitioning problems
Discrete Applied Mathematics
Fast optimal load balancing algorithms for 1D partitioning
Journal of Parallel and Distributed Computing
Efficient Construction of Pipelined Multibit-Trie Router-Tables
IEEE Transactions on Computers
Fitting a Step Function to a Point Set
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Center location problems on tree graphs with subtree-shaped customers
Discrete Applied Mathematics
Approximating Points by a Piecewise Linear Function: I
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Trie Partitioning in distributed PC based routers
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Discrete Applied Mathematics
A tight bound on the min-ratio edge-partitioning problem of a tree
Discrete Applied Mathematics
A randomized algorithm for weighted approximation of points by a step function
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
New algorithms for 1-D facility location and path equipartition problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Minimum Lk path partitioning-An illustration of the Monge property
Operations Research Letters
On some geometric selection and optimization problems via sorted matrices
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |