pdfformat: 

@InProceedings{pach_et_al:LIPIcs:2018:8781, author = {J{\'a}nos Pach and Bruce Reed and Yelena Yuditsky}, title = {{Almost All String Graphs are Intersection Graphs of Plane Convex Sets}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {68:168:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770668}, ISSN = {18688969}, year = {2018}, volume = {99}, editor = {Bettina Speckmann and Csaba D. T{\'o}th}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8781}, URN = {urn:nbn:de:0030drops87818}, doi = {10.4230/LIPIcs.SoCG.2018.68}, annote = {Keywords: String graph, intersection graph, plane convex set} }
Keywords:  String graph, intersection graph, plane convex set  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue date:  2018  
Date of publication:  2018 