@InProceedings{kowalik_et_al:LIPIcs.SWAT.2018.28,
author = {Kowalik, Lukasz and Socala, Arkadiusz},
title = {{Tight Lower Bounds for List Edge Coloring}},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)},
pages = {28:1--28:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-068-2},
ISSN = {1868-8969},
year = {2018},
volume = {101},
editor = {Eppstein, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.28},
URN = {urn:nbn:de:0030-drops-88540},
doi = {10.4230/LIPIcs.SWAT.2018.28},
annote = {Keywords: list edge coloring, complexity, ETH lower bound}
}