An optimal algorithm for the maximum two-chain problem

Authors:
R. D. Lou;M. Sarrafzadeh;D. T. Lee
Affiliations:
Center for Integrated Microelectronic Systems (CIMS), The Technological Institute, Northwestern University, Evanston, IL and Department of Electrical Engineering and Computer Science;Center for Integrated Microelectronic Systems (CIMS), The Technological Institute, Northwestern University, Evanston, IL and Department of Electrical Engineering and Computer Science;Center for Integrated Microelectronic Systems (CIMS), The Technological Institute, Northwestern University, Evanston, IL and Department of Electrical Engineering and Computer Science
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Computational geometry: an introduction

Computational geometry: an introduction
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Topological Via Minimization Revisited

IEEE Transactions on Computers
Maximum k-chains in planar point sets: combinatorial structure and algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Hi-index	0.00