%0 Conference Paper %1 conf/isaac/Hsu95a %A Hsu, Wen-Lian %B ISAAC %D 1995 %E Staples, John %E Eades, Peter %E Katoh, Naoki %E Moffat, Alistair %I Springer %K dblp %P 352-361 %T A Linear Time Algorithm For Finding Maximal Planar Subgraphs. %U http://dblp.uni-trier.de/db/conf/isaac/isaac95.html#Hsu95a %V 1004 %@ 3-540-60573-8

@inproceedings{conf/isaac/Hsu95a, added-at = {2017-05-19T00:00:00.000+0200}, author = {Hsu, Wen-Lian}, biburl = {https://www.bibsonomy.org/bibtex/2387c8e32e16674f88d66605a7b3d8588/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/1995}, editor = {Staples, John and Eades, Peter and Katoh, Naoki and Moffat, Alistair}, ee = {https://doi.org/10.1007/BFb0015441}, interhash = {d3c01af8a4d7f914d0e619c2535d4b0c}, intrahash = {387c8e32e16674f88d66605a7b3d8588}, isbn = {3-540-60573-8}, keywords = {dblp}, pages = {352-361}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T12:58:02.000+0200}, title = {A Linear Time Algorithm For Finding Maximal Planar Subgraphs.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac95.html#Hsu95a}, volume = 1004, year = 1995 }