On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. In Frank K. H. A. Dehne, Andrew Rau-Chaplin, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 5th International Workshop, WADS 97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings. Volume 1272 of Lecture Notes in Computer Science, pages 55-68, Springer, 1997.

This author has not been identified. Look up 'Farhad Shahrokhi' in GoogleThis author has not been identified. Look up 'Ondrej Sýkora' in GoogleThis author has not been identified. Look up 'László A. Székely' in GoogleThis author has not been identified. Look up 'Imrich Vrto' in Google

runs on WebDSL