1. Y. Hu, S. G. Kobourov, and S. Veeramoni, "On Maximum Differential Graph Coloring," 18th Symposium on Graph Drawing (GD), p. 274-286, 2010. Slides

2. Y. Hu, S. G. Kobourov, and S. Veeramoni, "Embedding, Clustering and Coloring for Dynamic Maps." 5th IEEE Pacific Visualization Symposium (PacificVis), p. 33-40, 2012. Slides

3. A. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni, and A. Wolff. Approximating the Generalized Minimum Manhattan Network Problem 24th International Symposium on Algorithms and Computation (ISAAC), 2013. Slides

4. J Chen, R Compton, A Das, Y Huang, S Kobourov, P Shen, S Veeramoni and Y Xu. AngryAnts: A Citizen Science Approach to Computing Accurate Average Trajectories. ArXiv e-prints, Dec. 2012.

5. M. Bekos, A Das, M Geyer, M Kaufmann, S Kobourov, and S Veeramoni. Maximum Differential Coloring of Caterpillars and Spiders. ArXiv e-prints, Mar. 2013

1. Dissertation: How to color a map
   

2. Aparna Das, Stephen Kobourov, Sankar Veeramoni and Yunhao Xu."Image Quest: From Multiple Inaccurate Trajectories to One Accurate Trajectory." Poster presented at Histochemistry 2012.

3. Aparna Das, Krzysztof Fleszar, Stephen Kobourov, Joachim Spoerhase, Sankar Veeramoni and Alexander Wolff. Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. European Workshop on Computational Geometry (EuroCG), 2013.

Erdős Number 4

Paul Erdős -- Boris Aronov -- Alon Efrat -- Stephen Kobourov -- Sankar Veeramoni

Paul Erdős -- János Pach -- Fabrizio Frati -- Stephen Kobourov -- Sankar Veeramoni