On the Complexity of Rainbow Coloring Problems

Abstract

Full Citation:

Eduard Eiben, Robert Ganian, Juho Lauri. On the Complexity of Rainbow Coloring Problems. Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták and William F. Smyth), pages 209-220, 2015.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.