Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for robustness in matroid optimization
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Parametric analysis of overall min-cuts and applications in undirected networks
Information Processing Letters
Parametric min-cuts analysis in a network
Discrete Applied Mathematics
Sensitivity Analysis for Scheduling Problems
Journal of Scheduling
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of time-dependent shortest paths
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A random fuzzy minimum spanning tree problem through a possibility-based value at risk model
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |