On Maximum Differential Graph Coloring. - Yifan Hu 001; Stephen G. Kobourov; Sankar Veeramoni (GD, 2010)

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (CoRR, 2012)

AngryAnts: A Citizen Science Approach to Computing Accurate Average Trajectories - Joy Chen; Ryan Compton 002; Aparna Das; Yi Huang; Stephen G. Kobourov; Paul S. Shen; Sankar Veeramoni; Yunhao Xu (CoRR, 2012)

Maximum Differential Coloring of Caterpillars and Spiders - Aparna Das; Markus Geyer; Michael Kaufmann 001; Stephen G. Kobourov; Sankar Veeramoni (CoRR, 2013)

3D proportional contact representations of graphs. - Md. Jawaherul Alam; Stephen G. Kobourov; Giuseppe Liotta; Sergey Pupyrev; Sankar Veeramoni (IISA, 2014)

Computing Consensus Curves. - Livio De La Cruz; Stephen G. Kobourov; Sergey Pupyrev; Paul S. Shen; Sankar Veeramoni (SEA, 2014)

A note on maximum differential coloring of planar graphs. - Michael A. Bekos; Michael Kaufmann 001; Stephen G. Kobourov; Sankar Veeramoni (J. Discrete Algorithms, 2014)

Embedding, Clustering and Coloring for Dynamic Maps. - Yifan Hu 001; Stephen G. Kobourov; Sankar Veeramoni (J. Graph Algorithms Appl., 2014)

The Maximum k-Differential Coloring Problem. - Michael A. Bekos; Michael Kaufmann 001; Stephen G. Kobourov; Sankar Veeramoni (SOFSEM, 2015)

Quantitative Measures for Cartogram Generation Techniques. - Md. Jawaherul Alam; Stephen G. Kobourov; Sankar Veeramoni (Comput. Graph. Forum, 2015)

The maximum k-differential coloring problem. - Michael A. Bekos; Michael Kaufmann 001; Stephen G. Kobourov; Konstantinos S. Stavropoulos; Sankar Veeramoni (J. Discrete Algorithms, 2017)

Approximating the Generalized Minimum Manhattan Network Problem. - Aparna Das; Krzysztof Fleszar 001; Stephen G. Kobourov; Joachim Spoerhase; Sankar Veeramoni; Alexander Wolff 001 (Algorithmica, 2018)