Daniel Cranston
Assistant Professor
dcranston@vcu.edu
http://www.people.vcu.edu/~dcranston
Harris Hall 4109
(804) 828-3384

Research Interests:
Graph theory, combinatorics, algorithm design;
in particular, structural and extremal graph theory and graph coloring.

Dr. Daniel Cranston earned his PhD in theoretical computer science in
2007 from the University of Illinois, Urbana-Champaign. His
dissertation focused on algorithms for coloring sparse graphs. He
spent 2 years as a postdoctoral fellow at the Center for Discrete
Mathematics and Theoretical Computer Science (DIMACS) and Bell Labs.
In 2009 he joined the faculty at VCU. His 13 peer-reviewed journal
articles focus largely on coloring graphs, but also touch on topics
including sorting algorithms, transportation of consumable resources,
and fault diagnosis in multi-processor systems.

Recent Publications:
Daniel W. Cranston and Gexin Yu. A Lower Bound on the Density of
Vertex Identifying Codes for the Infinite Hexagonal Grid. Electronic Journal of Combinatorics. Vol. 16(1), #R113.

Michael O. Albertson, Daniel W. Cranston, and Jacob Fox. Crossings,
Colorings, and Cliques. Elec tronic Journal of Combinatorics. Vol. 16(1), #R45.

Daniel W. Cranston and Douglas B. West. Classes of 3-regular graphs
that are (7,2)-edge-choosable. SIAM Journal of Discrete Math. Vol. 23(2), April 2009, pp. 872–881.

Daniel W. Cranston. Multigraphs with ∆ ≥ 3 are Totally-(2∆ − 1)-Choosable. Graphs and Combinatorics. Vol. 25(1), May 2009, pp. 35–40.