pdf-format: |
|
@InProceedings{chen_et_al:LIPIcs:2020:13402, author = {Hubie Chen and Bart M. P. Jansen and Karolina Okrasa and Astrid Pieterse and Pawe{\l} Rzążewski}, title = {{Sparsification Lower Bounds for List H-Coloring}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {58:1--58:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Yixin Cao and Siu-Wing Cheng and Minming Li}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13402}, URN = {urn:nbn:de:0030-drops-134027}, doi = {10.4230/LIPIcs.ISAAC.2020.58}, annote = {Keywords: List H-Coloring, Sparsification, Constraint Satisfaction Problem} }
Keywords: | List H-Coloring, Sparsification, Constraint Satisfaction Problem | |
Seminar: | 31st International Symposium on Algorithms and Computation (ISAAC 2020) | |
Issue date: | 2020 | |
Date of publication: | 04.12.2020 |