External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Some Provably Hard Crossing Number Problems

Daniel Bienstock. Some Provably Hard Crossing Number Problems. In Ravi Kannan, William R. Pulleyblank, editors, Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, Waterloo, Ontorio, Canada, May 28-30 1990. pages 61-83, University of Waterloo Press, 1990.

Abstract

Abstract is missing.

runs on