@inproceedings{ec33aaf1daf045a0b93fef01a6bf7e1a,
title = "Exact algorithms for list-coloring of intersecting hypergraphs",
abstract = "We show that list-coloring for any intersecting hypergraph of m edges on n vertices, and lists drawn from a set of size at most k, can be checked in quasi-polynomial time (mn)o(k2 log(mn)).",
keywords = "Exact algorithms, Hypergraph coloring, List coloring, Monotone Boolean duality, Quasi-polynomial time",
author = "Khaled Elbassioni",
note = "Publisher Copyright: {\textcopyright} 2016 Khaled Elbassioni.; 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 ; Conference date: 24-08-2016 Through 26-08-2016",
year = "2017",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.IPEC.2016.12",
language = "British English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Jiong Guo and Danny Hermelin",
booktitle = "11th International Symposium on Parameterized and Exact Computation, IPEC 2016",
}