pdf-format: |
|
@InProceedings{chatzidimitriou_et_al:LIPIcs:2016:6441, author = {Dimitris Chatzidimitriou and Archontia C. Giannopoulou and Spyridon Maniatis and Cl{\'e}ment Requil{\'e} and Dimitrios M. Thilikos and Dimitris Zoros}, title = {{FPT Algorithms for Plane Completion Problems}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6441}, URN = {urn:nbn:de:0030-drops-64418}, doi = {10.4230/LIPIcs.MFCS.2016.26}, annote = {Keywords: completion problems, FPT, plane graphs, topological isomorphism} }
Keywords: | completion problems, FPT, plane graphs, topological isomorphism | |
Seminar: | 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) | |
Issue date: | 2016 | |
Date of publication: | 19.08.2016 |