Connecting the maximum number of nodes in the grid to the boundary with nonintersecting line segments

Authors:
Leonidas Palios
Affiliations:
-
Venue:
Journal of Algorithms
Year:
1997

Citing 0
Cited 2

A Faster Algorithm for Finding Disjoint Paths in Grids

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Geometric algorithms for static leaf sequencing problems in radiation therapy

Proceedings of the nineteenth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract