Amin Coja-Oghlan, Anusch Taraz. Colouring Random Graphs in Expected Polynomial Time. In Helmut Alt, Michel Habib, editors, STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Volume 2607 of Lecture Notes in Computer Science, pages 487-498, Springer, 2003. [doi]
@inproceedings{Coja-OghlanT03, title = {Colouring Random Graphs in Expected Polynomial Time}, author = {Amin Coja-Oghlan and Anusch Taraz}, year = {2003}, url = {http://link.springer.de/link/service/series/0558/bibs/2607/26070487.htm}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Coja-OghlanT03}, cites = {0}, citedby = {0}, pages = {487-498}, booktitle = {STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings}, editor = {Helmut Alt and Michel Habib}, volume = {2607}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-00623-0}, }