Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{fulek_et_al:LIPIcs:2018:8752, author = {Radoslav Fulek and Jan Kyncl}, title = {{HananiTutte for Approximating Maps of Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {39:139:15}, 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/8752}, URN = {urn:nbn:de:0030drops87527}, doi = {10.4230/LIPIcs.SoCG.2018.39}, annote = {Keywords: HananiTutte theorem, graph embedding, map approximation, weak embedding, clustered planarity} }
Keywords:  HananiTutte theorem, graph embedding, map approximation, weak embedding, clustered planarity  
Seminar:  34th International Symposium on Computational Geometry (SoCG 2018)  
Issue Date:  2018  
Date of publication:  24.05.2018 