Linear programming in O(n × 3d2) time
Information Processing Letters
On a multidimensional search technique and its application to the Euclidean one centre problem
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A linear-time algorithm for finding a minimum spanning pseudoforest
Information Processing Letters
Multi-constrained matroidal knapsack problems
Mathematical Programming: Series A and B
An optimal-time algorithm for slope selection
SIAM Journal on Computing
On matroids and hierarchical graphs
Information Processing Letters
Using separation algorithms in fixed dimension
Journal of Algorithms
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Separator based sparsification I.: planarity testing and minimum spanning trees
Journal of Computer and System Sciences
Weighted Multidimensional Search and itsApplication to Convex Optimization
SIAM Journal on Computing
Optimal parametric search on graphs of bounded tree-width
Journal of Algorithms
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Multi-parameter Minimum Spanning Trees
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Parametric and Kinetic Minimum Spanning Trees
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An Efficient Multi-Dimensional Searching Technique and itsApplications
An Efficient Multi-Dimensional Searching Technique and itsApplications
| Hi-index | 0.00 |
A framework for solving certain multi-dimensional parametric matroid optimization problems in randomized linear time by prune-and-search is presented. The common feature of these problems, which include the multi-parameter minimum spanning tree problem on planar and dense graphs, is that their fixed-parameter versions are solvable by tournament-like algorithms whose structure is represented by a balanced decomposition tree.