Go to the corresponding LIPIcs Volume Portal 
Lindermayr, Alexander ; Siebertz, Sebastian ; Vigny, Alexandre
pdfformat: 

@InProceedings{lindermayr_et_al:LIPIcs:2020:12755, author = {Alexander Lindermayr and Sebastian Siebertz and Alexandre Vigny}, title = {{Elimination Distance to Bounded Degree on Planar Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {65:165:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771597}, ISSN = {18688969}, year = {2020}, volume = {170}, editor = {Javier Esparza and Daniel Kr{\'a}ľ}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12755}, URN = {urn:nbn:de:0030drops127557}, doi = {10.4230/LIPIcs.MFCS.2020.65}, annote = {Keywords: Elimination distance, parameterized complexity, structural graph theory} }
Keywords:  Elimination distance, parameterized complexity, structural graph theory  
Collection:  45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)  
Issue Date:  2020  
Date of publication:  18.08.2020 