Maximum k-chains in planar point sets
Stefan Felsner, Lorenz Wernisch · 1993
Article Free Access Share on Maximum k-chains in planar point sets: combinatorial structure and algorithms Authors: Stefan Felsner View Profile , Lorenz Wernisch View Profile Authors Info & Claims STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of ComputingJune 1993 Pages 146–153https://doi.org/10.1145/167088.167136Online:01 June 1993Publication History 1citation210DownloadsMetricsTotal Citations1Total Downloads210Last 12 Months9Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF