Jackson Toeniskoetter
M.S. Student
Department of Computer Science
University of Arizona
Email: jacktoe@email.arizona.edu
Office: Gould-Simpson 710-C
Teaching Assistant
Fall 2013 - CS 473, Automata, Grammars and LanguagesOffice Hours: MWF 3:30-4:30pm
Research
Threshold Coloring of GraphsGiven a planar G = (V,E) and a labeling of each edge as Near or Far, a threshold coloring of G is an assignment of integer to the vertices such that the colors of the vertices on a Near edge differ by at most some non-negative integer threshold T, and the colors of the endpoints of a Far edge differ by more than T.