Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces

Luke Postle. Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. pages 929-941, IEEE Computer Society, 2019. [doi]

@inproceedings{Postle19,
  title = {Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces},
  author = {Luke Postle},
  year = {2019},
  doi = {10.1109/FOCS.2019.00060},
  url = {https://doi.org/10.1109/FOCS.2019.00060},
  researchr = {https://researchr.org/publication/Postle19},
  cites = {0},
  citedby = {0},
  pages = {929-941},
  booktitle = {60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019},
  editor = {David Zuckerman},
  publisher = {IEEE Computer Society},
  isbn = {978-1-7281-4952-3},
}