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.
@inproceedings{ShahrokhiSSV97,
title = {On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem},
author = {Farhad Shahrokhi and Ondrej Sýkora and László A. Székely and Imrich Vrto},
year = {1997},
researchr = {https://researchr.org/publication/ShahrokhiSSV97},
cites = {0},
citedby = {0},
pages = {55-68},
booktitle = {Algorithms and Data Structures, 5th International Workshop, WADS 97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
editor = {Frank K. H. A. Dehne and Andrew Rau-Chaplin and Jörg-Rüdiger Sack and Roberto Tamassia},
volume = {1272},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63307-3},
}