%0 Conference Paper %1 conf/compgeom/PachRY18 %A Pach, János %A Reed, Bruce A. %A Yuditsky, Yelena %B SoCG %D 2018 %E Speckmann, Bettina %E Tóth, Csaba D. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 68:1-68:14 %T Almost All String Graphs are Intersection Graphs of Plane Convex Sets. %U http://dblp.uni-trier.de/db/conf/compgeom/compgeom2018.html#PachRY18 %V 99 %@ 978-3-95977-066-8

@inproceedings{conf/compgeom/PachRY18, added-at = {2021-06-16T00:00:00.000+0200}, author = {Pach, János and Reed, Bruce A. and Yuditsky, Yelena}, biburl = {https://www.bibsonomy.org/bibtex/23d9da293928449295bf9e31f3aa6b13c/dblp}, booktitle = {SoCG}, crossref = {conf/compgeom/2018}, editor = {Speckmann, Bettina and Tóth, Csaba D.}, ee = {https://doi.org/10.4230/LIPIcs.SoCG.2018.68}, interhash = {f86f6b63dd94719e80e2244046731b82}, intrahash = {3d9da293928449295bf9e31f3aa6b13c}, isbn = {978-3-95977-066-8}, keywords = {dblp}, pages = {68:1-68:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T14:34:11.000+0200}, title = {Almost All String Graphs are Intersection Graphs of Plane Convex Sets.}, url = {http://dblp.uni-trier.de/db/conf/compgeom/compgeom2018.html#PachRY18}, volume = 99, year = 2018 }