Go to the corresponding OASIcs Volume Portal 
Kotrbcík, Michal ; Skoviera, Martin
pdfformat: 

@InProceedings{kotrbck_et_al:OASIcs:2018:10040, author = {Michal Kotrbc{\'i}k and Martin Skoviera}, title = {{Simple Greedy 2Approximation Algorithm for the Maximum Genus of a Graph}}, booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)}, pages = {14:114:9}, series = {OpenAccess Series in Informatics (OASIcs)}, ISBN = {9783959770996}, ISSN = {21906807}, year = {2018}, volume = {69}, editor = {Jeremy T. Fineman and Michael Mitzenmacher}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/10040}, URN = {urn:nbn:de:0030drops100409}, doi = {10.4230/OASIcs.SOSA.2019.14}, annote = {Keywords: maximum genus, embedding, graph, greedy algorithm} }
Keywords:  maximum genus, embedding, graph, greedy algorithm  
Seminar:  2nd Symposium on Simplicity in Algorithms (SOSA 2019)  
Issue Date:  2018  
Date of publication:  18.12.2018 