Bojan Mohar, Yifan Jing. Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs. In Mikkel Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018. pages 719-730, IEEE Computer Society, 2018. [doi]
@inproceedings{MoharJ18,
title = {Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs},
author = {Bojan Mohar and Yifan Jing},
year = {2018},
doi = {10.1109/FOCS.2018.00074},
url = {https://doi.org/10.1109/FOCS.2018.00074},
researchr = {https://researchr.org/publication/MoharJ18},
cites = {0},
citedby = {0},
pages = {719-730},
booktitle = {59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018},
editor = {Mikkel Thorup},
publisher = {IEEE Computer Society},
isbn = {978-1-5386-4230-6},
}