@inproceedings{ICALP-v1-2013-LauriaPRT,
	author        = "Massimo Lauria and Pavel Pudlák and Vojtech Rödl and Neil Thapen",
	booktitle     = "{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part I}",
	doi           = "10.1007/978-3-642-39206-1_58",
	isbn          = "978-3-642-39205-4",
	pages         = "684--695",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{The Complexity of Proving That a Graph Is Ramsey}",
	volume        = 7965,
	year          = 2013,
}