APA (7th ed.) Citation

Elbassioni, K. (2022). Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs. Theoretical computer science, 902, 64-75. https://doi.org/10.1016/j.tcs.2021.12.009

Chicago Style (17th ed.) Citation

Elbassioni, Khaled. "Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs." Theoretical Computer Science 902 (2022): 64-75. https://doi.org/10.1016/j.tcs.2021.12.009.

MLA (9th ed.) Citation

Elbassioni, Khaled. "Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs." Theoretical Computer Science, vol. 902, 2022, pp. 64-75, https://doi.org/10.1016/j.tcs.2021.12.009.