Publications

Export 4 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is graph colouring  [Clear All Filters]
2010
Haeupler B, Saha B, Srinivasan A.  2010.  New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
2005
Demaine ED, Hajiaghayi MT, Kawarabayashi K.  2005.  Algorithmic graph minor theory: Decomposition, approximation, and coloring. Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on. :637-646.
1998
Radhakrishnan J, Srinivasan A.  1998.  Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. :684-693.
1992
Chandrasekharan N, Hannenhalli S.  1992.  Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs. , Fourth International Conference on Computing and Information, 1992. Proceedings. ICCI '92. :42-45.