conference paper Artur Czumaj author Christian Scheideler author 20792 79 department 63 department https://ris.uni-paderborn.de/download/2147/2295/SODA-00.pdf application/pdfno 2000 eng 21476 30--39 Czumaj, A., &#38; Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In <i>SODA</i> (pp. 30--39). @inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} } A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39. Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>SODA</i>, 2000, pp. 30--39. Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: <i>SODA</i>. ; 2000:30--39. Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In <i>SODA</i>, 30--39, 2000. A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in <i>SODA</i>, 2000, pp. 30--39. 21472018-04-03T06:16:48Z2022-01-06T06:55:00Z