Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/esa/DemaineGKLLSVP19
%A Demaine, Erik D.
%A Goodrich, Timothy D.
%A Kloster, Kyle
%A Lavallee, Brian
%A Liu, Quanquan C.
%A Sullivan, Blair D.
%A Vakilian, Ali
%A van der Poel, Andrew
%B ESA
%D 2019
%E Bender, Michael A.
%E Svensson, Ola
%E Herman, Grzegorz
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 37:1-37:15
%T Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.
%U http://dblp.uni-trier.de/db/conf/esa/esa2019.html#DemaineGKLLSVP19
%V 144
%@ 978-3-95977-124-5
@inproceedings{conf/esa/DemaineGKLLSVP19,
added-at = {2019-09-08T00:00:00.000+0200},
author = {Demaine, Erik D. and Goodrich, Timothy D. and Kloster, Kyle and Lavallee, Brian and Liu, Quanquan C. and Sullivan, Blair D. and Vakilian, Ali and van der Poel, Andrew},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/22c6a91fae21d4061f1b606304cae7f98/dblp},
booktitle = {ESA},
crossref = {conf/esa/2019},
editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},
ee = {https://doi.org/10.4230/LIPIcs.ESA.2019.37},
interhash = {3f21cb81ab95f60e8a86af6ebaba743d},
intrahash = {2c6a91fae21d4061f1b606304cae7f98},
isbn = {978-3-95977-124-5},
keywords = {dblp},
pages = {37:1-37:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2019-09-27T13:57:24.000+0200},
title = {Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.},
url = {http://dblp.uni-trier.de/db/conf/esa/esa2019.html#DemaineGKLLSVP19},
volume = 144,
year = 2019
}