@InProceedings{bhangale:LIPIcs.ICALP.2018.15,
  author =	{Bhangale, Amey},
  title =	{{NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors}},
  booktitle =	{45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
  pages =	{15:1--15:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.15},
  URN =		{urn:nbn:de:0030-drops-90190},
  doi =		{10.4230/LIPIcs.ICALP.2018.15},
  annote =	{Keywords: Hypergraph coloring, Inapproximability, Schrijver graph}
}