@InProceedings{saberi_et_al:LIPIcs.ICALP.2021.109,
  author =	{Saberi, Amin and Wajc, David},
  title =	{{The Greedy Algorithm Is not Optimal for On-Line Edge Coloring}},
  booktitle =	{48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
  pages =	{109:1--109:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-195-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{198},
  editor =	{Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.109},
  URN =		{urn:nbn:de:0030-drops-141786},
  doi =		{10.4230/LIPIcs.ICALP.2021.109},
  annote =	{Keywords: Online algorithms, edge coloring, greedy, online matching}
}