Home Members Publications Projects Contacts

Books and Monographs

  1. M. T. Goodrich and S. G. Kobourov, editors, 10th International Symposium on Graph Drawing (GD), Lecture Notes in Computer Science, Vol. 2528, Springer-Verlag, 2002.

  2. H. Hauser, S. G. Kobourov, H. Qu, editors, Proceedings of the 5th IEEE Pacific Visualization Symposium (PacificVis), Songdo, Korea, February 28 - March 2 2012, IEEE Press, 2012.

  3. S. G. Kobourov, "Force-Directed Drawing Algorithms," In Roberto Tamassia (editor), Handbook of Graph Drawing and Visualization, p. 383-408, CRC Press, 2013.

  4. T. Blasius, S. G. Kobourov, and I ~Rutter, "Simultaneous Embedding of Planar Graphs," In Roberto Tamassia (editor), Handbook of Graph Drawing and Visualization, CRC Press, p. 349-381, 2012.

  5. E. Gansner, Y. Hu, S. G. Kobourov, "Viewing Abstract Data as Maps," In Tony Huang (editor), Human Centric Visualization: Theories, Methodologies and Case Studies, Springer. Accepted, to appear in 2013.

    Refereed Journal Publications

  6. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs," Journal of Graph Algorithms and Applications, v. 4, p. 19-46, 2000. (Invited to this special issue on best papers from GD'98. A preliminary version appeared in the 6th Symposium on Graph Drawing (GD), p.111-124, 1998.)

  7. C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Drawing Planar Graphs with Circular Arcs," Discrete & Computational Geometry, v. 25, p. 405-418, 2001. (A preliminary version appeared in the 7th Symposium on Graph Drawing (GD), p.117-126, 1999.)

  8. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Balanced Aspect Ratio Trees: Combining the Advantages of k -d Trees and Octrees," Journal of Algorithms, v. 38, p. 303-333, 2001. (Invited to this special issue on best papers from SODA'99. A preliminary version appeared in the 10th ACM-SIAM Symposium on Discrete Algorithms, (SODA), p.300-309, 1999.)

  9. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Planarity-Preserving Clustering and Embedding for Large Planar Graphs," Computational Geometry: Theory and Applications, v. 24, no. 3, p. 95-114, 2002. (Invited to this special issue on the best papers from GD'99. A preliminary version appeared in the 7th Symposium on Graph Drawing (GD), p.186-196, 1999.)

  10. P. Gajer and S. G. Kobourov, "GRIP: Graph Drawing with Intelligent Placement," Journal of Graph Algorithms and Applications, v. 6, no. 3, p. 203-224, 2002. (Invited to this special issue on the best papers from GD'2000. A preliminary version appeared in the 8th Symposium on Graph Drawing (GD), p. 222-228, 2000.)

  11. C. A. Duncan and S. G. Kobourov, "Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution," Journal of Graph Algorithms and Applications, v. 7, no. 4, p. 311-333, 2003. (Invited to this special issue on the best papers from GD'2001. A preliminary version appeared in the 9th Symposium on Graph Drawing (GD), p.407-421, 2001.)

  12. P. Gajer, M. T. Goodrich, and S. G. Kobourov, "A Multi-Dimensional Approach to Force-Directed Layouts of Large Graphs," Computational Geometry: Theory and Applications, v. 29 no. 1, p.3-18, 2004. (Invited to this special issue on the best papers from CGC'2001. A preliminary version appeared in the 8th Symposium on Graph Drawing (GD), p.211-221, 2000.)

  13. T. Biedl, E. Demaine, C. A. Duncan, R. Fleischer, and S. G. Kobourov, "Tight Bounds on Maximal and Maximum Matching," Journal of Discrete Mathematics, v. 285 no. 1, p. 7-15, 2004. (A preliminary version appeared in the 12th International Symposium on Algorithms and Computation (ISAAC), p.308-319, 2001.)

  14. C. Collberg and S. G. Kobourov, "Self-Plagiarism in Computer Science," Communications of the ACM, v. 48, no. 2, p. 88-94, 2005. (A preliminary version.)

  15. C. Erten and S. G. Kobourov, "Simultaneous Embedding of a Planar Graph and Its Dual on the Grid," Theory of Computing, v. 38, no. 3, p.313-327, 2005. (A preliminary version appeared in the 13th International Symposium on Algorithms and Computation (ISAAC), p.575-587, 2002.)

  16. C. Erten, S. G. Kobourov, V. Le, and A. Navabi, ``Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes,'' Journal of Graph Algorithms and Applications, v. 9, no. 1, p. 165-182, 2005. (A preliminary version appeared in the 11th Symposium on Graph Drawing (GD), p. 437-449, 2003.)

  17. S. G. Kobourov and K. Wampler, ``Non-Euclidean Spring Embedders,'' IEEE Transactions on Visualization and Computer Graphics, v. 11, no. 6, p. 757-767, 2005. (A preliminary version appeared in the 10th IEEE Symposium on Information Visualization (INFOVIS), p. 207--214, 2004.)

  18. C. Erten and S. G. Kobourov, ``Simultaneous Embedding of Planar Graphs with Few Bends,'' Journal of Graph Algorithms and Applications, v. 9, no. 3, p. 347-364, 2005. (A preliminary version appeared in the 12th Symposium on Graph Drawing (GD), p. 195-206, 2004.)

  19. A. Efrat, S. G. Kobourov, and A. Lubiw, ``Computing Homotopic Shortest Paths Efficiently,'' Computational Geometry: Theory and Applications. Accepted, to appear in 2006. (A preliminary version appeared in the 10th European Symp. on Algorithms (ESA), p.411-423, 2002.)

  20. P. Brass, E. Cenek, C. A. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. G. Kobourov, A. Lubiw, and J. S. B. Mitchell, ``On Simultaneous Planar Graph Embeddings,'' Computational Geometry: Theory and Applications. Accepted, to appear in 2006. (A preliminary version appeared in the Workshop on Algorithms and Data Structures (WADS), p. 243-255, 2003.)

  21. A. Efrat, C. Erten, and S. G. Kobourov, "Fixed-Location Circular-Arc Drawing of Planar Graphs", Journal of Graph Algorithms and Applications. Accepted, to appear in 2006. (A preliminary version appeared in the 11th Symposium on Graph Drawing (GD), p. 147-158, 2003.)

  22. C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk, "Drawing Graphs with Fat Edges," International Journal of Foundations of Computer Science, vol. 17, no. 5, p. 1143-1165, 2006. (A preliminary version appeared in the 9th Symp. on Graph Drawing (GD), p. 162-177, 2001.)

  23. C. A. Duncan, S. G. Kobourov, and V. S. A. Kumar, "Optimal Constrained Graph Exploration," ACM Transactions on Algorithms, vol. 2, no. 3, p. 380-402, 2007. (A preliminary version appeared in the 12th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), p. 807-814, 2001.)

  24. S. G. Kobourov and M. Landis, "Morphing Planar Graphs in Spherical Space," Journal of Graph Algorithms and Applications, vol. 12, no. 1, p.113-127, 2008. (Invited to this special issue on the best papers from GD'2006. (A preliminary version appeared in the 14th Symp. on Graph Drawing (GD), p. 306-317, 2006.)

  25. J. Cappos, A. Estrella-Balderrama, J. Fowler, and S. G. Kobourov, "Simultaneous Graph Embedding with Bends and Circular Arcs," Computational Geometry: Theory and Applications, vol. 42, no. 2, p. 173-182, 2008. (A preliminary version appeared in the 14th Symp. on Graph Drawing (GD), p. 95-107, 2006.)

  26. F. Frati, M. Kaufmann and S. G. Kobourov, "Contrained Simultaneous and Near-Simultaneous Embeddings," Journal of Graph Algorithms and Applications, vol. 13, no. 3, p. 447-465, 2009. (Invited to this special issue on the best papers from GD'2007. A preliminary version appeared in the 14th Symp. on Graph Drawing (GD), p. 268-279, 2006.)

  27. A. Estrella-Balderrama, J. Fowler, and S. G. Kobourov, "Characterization of Unlabeled Level Planar Trees," Computational Geometry: Theory and Applications, vol. 42, no. 6, p. 704-721, 2009. (A preliminary version appeared in the 14th Symposium on Graph Drawing (GD), p. 367-379, 2006.)

  28. C. Binucci, E. Di Giacomo, W. Didimo, A. Estrella-Balderrama, F. Frati, S. G. Kobourov, G. Liotta, "Upward Straight-line Embeddings of Directed Graphs into Point Sets," Computational Geometry: Theory and Applications, vol. 43, no. 2, p. 219-232, 2010. (A preliminary version appeared in the 21th Canadian Conference on Computational Geometry (CCCG), 2009.)

  29. A. Estrella-Balderrama, J. Fowler, and S. G. Kobourov, "GraphSET, a tool for simultaneous graph drawing," Software: Practice and Experience, vol. 40, no. 10, p. 849-863, 2010. (A preliminary version appeared in the 16th Symposium on Graph Drawing (GD), p.169-180, 2008.)

  30. C. Erten, A. Efrat, D. Forrester, A. Iyer, and S. G. Kobourov, "Force-Directed Approaches to Sensor Localization," IEEE Transaction on Sensor Networks, vol. 7, no. 3, p. 1-25, 2010. (A preliminary version appeared in the 8th Workshop on Algorithm Engineering and Experiments (ALENEX), p. 108-118, 2006.)

  31. E. Gansner, Y. Hu, and S. G. Kobourov, "Visualizing Graphs and Clusters as Maps," IEEE Computer Graphics and Applications, vol. 30, no. 6, p. 44-66, 2010. (Invited to this special issue on the best papers from PacificVis'2010. A preliminary version appeared in the 3rd IEEE Pacific Visualzation Symposium, p. 201-208, 2010.)

  32. U. Brandes, C. Erten, A. Estrella-Balderrama, J, Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S. G. Kobourov, G. Liotta, P. Mutzel, and A. Symvonis, "Colored Simultaneous Geometric Embeddings and Universal Pointsets," Algorithmica, vol. 60. no. 3, p. 569-592, 2011. (A preliminary version appeared in the 13th International Computing and Combinatorics Conference, (COCOON), p. 254-263, 2007.)

  33. C. Duncan, S. G. Kobourov, and M. Goodrich, "Planar Drawings of Higher-Genus Graphs," Journal of Graph Algorithms and Applications, vol. 15, no. 1, pp. 7-32, 2011. (Invited to this special issue on the best papers from GD'2009. A preliminary version appeared in the 17th Symposium on Graph Drawing (GD), p. 45-60, 2009.)

  34. J. Fowler, M. Juenger, S. G. Kobourov, and M. Schulz, "Characterizations of Restricted Pairs of Planar Graphs Allowing Simultanous Embedding with Fixed Edges," Computational Geometry: Theory and Applications, vol. 44, no. 8, p. 385-398, 2011. (A preliminary version appeared in the 34th Workshop on Graph-Theoretic Concepts in Computer Science (WG), p. 146-158, 2008.)

  35. C. Duncan, D. Eppstein, M. Goodrich, S. Kobourov, and M. Noellenburg, "Lombardi Drawings of Graphs," Journal of Graph Algorithms and Applications, vol. 16 no. 1, p. 85-108, 2012. (Invited to this special issue on the best papers from GD'2010. A preliminary version appeared in the 18th Symposium on Graph Drawing (GD), p. 195-207, 2010.)

  36. E. Gansner, Y. Hu, M. Kaufmann, and S. G. Kobourov, "Optimal Polygonal Representation of Planar Graphs," Algorithmica, vol. 63, no. 3, p. 672-691, 2012. (Invited to this special issue on the best papers from LATIN'2010. A preliminary version appeared in the 9th Latin American Theoretical Informatics Symposium (LATIN), p. 417-432, 2010.)

  37. J. Alam, T. Biedl, S. Felsner, M. Kaufmann, and S. G. Kobourov, "Proportional Contact Representations of Planar Graphs," Journal of Graph Algorithms and Applications. Accepted, to appear in 2012. (Invited to this special issue on the best papers from GD'2011. A preliminary version appeared in the 19th Symposium on Graph Drawing (GD), p. 26-38, 2011.)

  38. C. Duncan, D. Eppstein, M. Goodrich, S. Kobourov, and M. Noellenburg, "Drawing Trees with Perfect Angular Resolution and Polynomial Area," Discrete & Computational Geometry, Accepted, to appear in 2012. A "preliminary version appeared in the 18th Symposium on Graph Drawing (GD), p. 183-194, 2010.)

  39. Y. Hu, S. G. Kobourov, and D. Mashima, "Visualizing Dynamic Data with Maps," IEEE Transactions on Visualization and Computer Graphics, Accepted, to appear in 2012. (Invited to this special issue on the best papers from PacificVis'2011. A preliminary version appeared in the 4th IEEE Pacific Visualzation Symposium (PacificVis), p. 102-110, 2011.)

  40. M. Hingle, D. Yoon, J. Fowler, S. G. Kobourov, M. Schneider, D. Falk, and R. Burd, "Collection and visualization of dietary behavior and reasons for eating using a popular and free social media software application," Journal of Medical Internet Research (JMIR), Vol. 15, no. 6, p.125-145, 2013.

  41. J. Alam, T. Biedl, S. Felsner, A. Gerasch, M. Kaufmann and S. G. Kobourov, "Linear-Time Algorithms for Proportional Contact Graph Representations." Algorithmica, Vol. 67, p. 3-22, 2013. (Invited to this special issue as the best paper award winner from ISAAC'2011. A preliminary version appeared in the 22nd Symposium on Algorithms and Computation (ISAAC), p. 281-291, 2011.)

  42. M. Bekos, S. G. Kobourov, M. Kaufmann and A. Symvonis, "Smooth Orthogonal Layouts," Journal of Graph Algorithms and Applications, vol. 17, no. 5, p. 575-595, 2013. A preliminary version appeared in the 20th Symposium on Graph Drawing (GD), p. 150-161, 2012.

  43. J. Alam, T. Biedl, S. Felsner, M. Kaufmann, S. G. Kobourov and T. Ueckerdt, "Computing Cartograms with Optimal Complexity," Discrete & Computational Geometry, vol. 50, no. 3, p. 784-810, 2013. A preliminary version appeared in the 28th ACM Symposium on Computational Geometry (SoCG), p. 21-30, 2012.

  44. P. Angelini, W. Didimo, S. G. Kobourov, T. Mchedlidze, V. Roselli, A. Symvonis, and S. Wismath, "Monotone Drawings of Graphs with Fixed Embedding," Algorithmica. Accepted, to appear in 2013.

  45. A. Das, E. Gansner, M. Kaufmann, S. G. Kobourov, J. Spoerhase, and A. Wolff, "Approximating Minimum Manhattan Networks in Higher Dimensions," Algorithmica. Accepted, to appear in 2013.

    Refereed Conference Publications

  46. B. Awerbuch and S. G. Kobourov, "Polylogarithmic-Overhead Piecemeal Graph Exploration," Proceedings of the 11th Conference on Computational Learning Theory (COLT), p. 280-286, July 1998.

  47. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs," 6th Annual Symposium on Graph Drawing (GD), p. 111-124, 1998. (Prelim. version of 1.)

  48. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Planarity-Preserving Clustering and Embedding for Large Planar Graphs," 7th Symp. on Graph Drawing (GD), p. 186-196, 1999. (Prelim. version of 4.)

  49. C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Drawing Planar Graphs with Circular Arcs," 7th Annual Symposium on Graph Drawing (GD), p. 117-126, 1999. (Prelim. version of 2.)

  50. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov, "Balanced Aspect Ratio Trees: Combining the Advantages of k -d Trees and Octrees," 10th ACM-SIAM Annual Symposium on Discrete Algorithms, (SODA), p. 300-309, 1999. (Prelim. version of 3.)

  51. S. Bridgeman, M. T. Goodrich, S. G. Kobourov, and R. Tamassia, "PILOT: An Interactive Tool for Learning and Grading," 31st Annual Technical Symposium on Computer Science Education (SIGCSE), p. 139-143, March 2000.

  52. S. Bridgeman, M. T. Goodrich, S. G. Kobourov, and R. Tamassia, "SAIL: A System for Generating, Archiving, and Retrieving Specialized Assignments Using LATEX," 31st Annual Technical Symposium on Computer Science Education (SIGCSE), p. 300-304, March 2000.

  53. P. Gajer, M. T. Goodrich, and S. G. Kobourov, "A Fast Multi-Dimensional Algorithm for Drawing Large Graphs," 8th Symp. on Graph Drawing (GD), p. 211-221, 2000. (Prelim. version of 8.)

  54. P. Gajer and S. G. Kobourov, "GRIP: Graph Drawing with Intelligent Placement," 8th Symp. on Graph Drawing (GD), p. 222-228, 2000. (Prelim. version of 5.)

  55. C. A. Duncan, S. G. Kobourov, and V. S. A. Kumar, "Optimal Constrained Graph Exploration," 12th ACM-SIAM Annual Symp. on Discrete Algorithms (SODA), p. 807-814, 2001.

  56. C. A. Duncan and S. G. Kobourov, "Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution," 9th Symp. on Graph Drawing (GD), p. 407-421, 2001. (Prelim. version of 6.)

  57. T. Biedl, E. Demaine, C. A. Duncan, R. Fleischer, and S. G. Kobourov, "Tight Bounds on Maximal and Maximum Matching," 12th Intl. Symp. on Algorithms & Computation (ISAAC), p. 308-319, 2001. (Prelim. version of 9.)

  58. C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk, "Drawing Graphs with Fat Edges," 9th Symp. on Graph Drawing (GD), p. 162-177, 2001.

  59. A. Efrat, S. G. Kobourov, M. Stepp, and C. Wenk, "Growing Fat Graphs," 18th Annual Symposium on Computational Geometry (SCG), p. 277-278, 2002.

  60. C. Collberg, S. G. Kobourov, J. Miller, and S. Westbrook, "AlgoVista: A Tool to Enhance Algorithm Design and Understanding," 7th Ann. Symp. on Innovation and Technology in Comp. Sci. Education (ITiCSE), p. 228-228, 2002.

  61. A. Efrat, S. G. Kobourov, and A. Lubiw, "Computing Homotopic Shortest Paths Efficiently," 10th European Symp. on Algorithms (ESA), p.411-423, 2002. (Prelim. version of 11.)

  62. C. Erten and S. G. Kobourov, "Simultaneous Embedding of a Planar Graph and Its Dual on the Grid," 13th Intl. Symp. on Algorithms & Computation (ISAAC), p. 575-587, 2002. (Prelim. version of 10.)

  63. C. Collberg, S. G. Kobourov, J. Nagra, J. Pitts, and K. Wampler, "A System for Graph-Based Visualization of the Evolution of Software," ACM Symp. on Software Visualization (SoftVis), p. 77-86, 2003.

  64. P. Brass, E. Cenek, C. A. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. G. Kobourov, A. Lubiw, and J. S. B. Mitchell, "On Simultaneous Planar Graph Embeddings," Workshop on Algorithms and Data Structures (WADS), p. 243-255, 2003. (Prelim. version of 13.)

  65. C. Collberg, S. G. Kobourov, S. Kobes, B. Smith, S. Trush, and G. Yee, "TetraTetris: An Application of Multi-User Touch-Based Interaction using DiamondTouch", 9th International Conference on Human-Computer Interaction (INTERACT), p. 81-88, 2003.

  66. A. Efrat, H. H. Gonzales-Banos, S. G. Kobourov, and L. Palaniappan, "Optimal Motion Strategies to Track and Capture a Predictable Target," IEEE Conference of Robotics and Automation (ICRA), p. 411-423, 2003.

  67. C. Collberg, S. G. Kobourov, E. Carter, and C. Thomborson, "Error-Correcting Graphs for Software Watermarking", 29th Workshop on Graph Theoretic Concepts in Computer Science (WG), p. 156-167, 2003.

  68. C. Collberg, S. G. Kobourov, J. Louie, and T. Slattery, "SPLAT: A System for Self-Plagiarism Detection", IADIS Conference on WWW/Internet, p. 508-514, 2003.

  69. A. Efrat, C. Erten, and S. G. Kobourov, "Fixed-Location Circular-Arc Drawing of Planar Graphs", 11th Symposium on Graph Drawing (GD), p. 147-158, 2003.

  70. C. Erten, S. G. Kobourov, and C. Pitta, "Intersection-Free Morphing of Planar Graphs", 11th Symposium on Graph Drawing (GD), p. 320-331, 2003.

  71. F. Brandenburg, D. Eppstein, M. T. Goodrich, S. G. Kobourov, G. Liotta, P. Mutzel, "Selected Open Problems in Graph Drawing," 11th Symposium on Graph Drawing (GD), p. 515-539, 2003.

  72. C. Erten, S. G. Kobourov, V. Le, and A. Navabi, "Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes", 11th Symposium on Graph Drawing (GD), p. 437-449, 2003.

  73. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee, "GraphAEL: Graph Animations with Evolving Layouts", 11th Symposium on Graph Drawing (GD), p. 98-110, 2003.

  74. C. Collberg, S. G. Kobourov, and S. Westbrook, "AlgoVista: An Algorithmic Search Tool in an Educational Setting," 35st Technical Symposium on Computer Science Education (SIGCSE), p. 462-466, 2004.

  75. C. Erten, P. Harding, S. G. Kobourov, K. Wampler, and G. Yee, "Exploring the Computing Literature Using Temporal Graph Visualization," Conference on Visualization and Data Analysis (VDA), p. 45-56, 2004.

  76. C. Duncan, D. Eppstein, and S. G. Kobourov, "The Geometric Thickness of Low Degree Graphs," 20th Annual ACM-SIAM Symposium on Computational Geometry (SCG), p. 340-346, 2004.

  77. C. Erten, S. G. Kobourov, and C. Pitta, "Morphing Planar Graphs," 20th Annual ACM-SIAM Symposium on Computational Geometry (SCG), p.451-452, 2004.

  78. S. G. Kobourov and K. Wampler "Non-Euclidean Spring Embedders," 10th Annual IEEE Symposium on Information Visualization (InfoVis), p. 207--214, 2004.

  79. J. Abello, S. G. Kobourov, and R. Yusufov, ``Visualizing Large Graphs with Compound-Fisheye Views and Treemaps,'' 12th Symposium on Graph Drawing (GD), p. 431-442, 2004.

  80. S. G. Kobourov and C. Pitta, ``An Interactive Multi-User System for Simultaneous Graph Drawing,'' 12th Symposium on Graph Drawing (GD), p. 492-503, 2004.

  81. C. Erten and S. G. Kobourov, ``Simultaneous Embedding of Planar Graphs with Few Bends,'' 12th Symposium on Graph Drawing (GD), p. 195-206, 2004.

  82. D. Forrester, S. G. Kobourov, A. Navabi, K. Wampler, G. Yee, ``graphael: A System for Generalized Force-Directed Layouts,'' 12th Symposium on Graph Drawing (GD), p. 454-466, 2004.

  83. B. Dux, A. Iyer, S. Debray, D. Forrester, and S. G. Kobourov, ``Visualizing the Behavior of Dynamically Modifiable Code.'' 13th IEEE International Workshop on Program Comprehension (IWPC), p. 337-340, 2005.

  84. C. Collberg, S. Debray, S. G. Kobourov, and S. Westbrook, ``Increasing Undergraduate Involvement in Computer Science Research,'' 8th World Conference on Computers in Education (WCCE), p. 342-352, 2005.

  85. J. Cappos, S. G. Kobourov, M. Miles, M. Stepp, K. Pavlou, and A. Wixted, "Collaboration with DiamondTouch," 10th International Conference on Human-Computer Interaction (INTERACT), p. 986-990, 2005.

  86. C. Erten, A. Efrat, D. Forrester, A. Iyer, and S. G. Kobourov, ``Force-Directed Approaches to Sensor Localization,'' 8th Workshop on Algorithm Engineering and Experiments (ALENEX), p. 108-118, 2006.

  87. S. G. Kobourov and M. Landis, "Morphing Planar Graphs in Spherical Space," 14th Symposium on Graph Drawing (GD), p. 306-317, 2006.

  88. A. Estrella-Balderrama, J. Fowler, and S. G. Kobourov, "Characterization of Unlabeled Level Planar Trees," 14th Symposium on Graph Drawing (GD), p. 367-379, 2006.

  89. J. Cappos, A. Estrella-Balderrama, J. Fowler, and S. G. Kobourov, "Simultaneous Graph Embedding with Bends and Circular Arcs," 14th Symposium on Graph Drawing (GD), p. 95-107, 2006.

  90. U. Brandes, C. Erten, J. Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S. G. Kobourov, G. Liotta, P. Mutzel, A. Symvonis, "Colored Simultaneous Geometric Embeddings," 13th International Computing and Combinatorics Conference, (COCOON), p. 254-263, 2007.

  91. J. Fowler and S. G. Kobourov, ``Characterization of Unlabeled Level Planar Graphs,'' 15th Symposium on Graph Drawing (GD), p. 37-49, 2007.

  92. J. Fowler and S. G. Kobourov, ``Minimum Level Nonplanar Patterns for Trees,'' 15th Symposium on Graph Drawing (GD), p. 69-75, 2007.

  93. F. Frati, M. Kaufmann and S. G. Kobourov, ``Constrained Simultaneous and Near-Simultaneous Embeddings,'' 15th Symposium on Graph Drawing (GD), p. 268-279, 2007.

  94. J. Fowler, M. Junger, S. G. Kobourov, and M. Schulz, "On Simultaneous Embedding with Fixed Edges," Conference on Topological and Geometric Graph Theory, Electronic Notes in Discrete Mathematics, vol. 31, p. 41-44, 2008.

  95. A. Estrella-Balderrama, F. Frati, and S. G. Kobourov, "Upward Straight-line Embeddings of Directed Graphs into Point Sets,"34th Workshop on Graph-Theoretic Concepts in Computer Science (WG), p. 122-133, 2008.

  96. J. Fowler, M. Junger, S. G. Kobourov, and M. Schulz, "Characterizing Simultaneous Embedding with Fixed Edges," 34th Workshop on Graph-Theoretic Concepts in Computer Science (WG), p. 146-158, 2008.

  97. A. Estrella-Balderrama, J. Fowler and S. G. Kobourov, "GraphSET: Graph Simultaneous Embedding Tool," 16th Symposium on Graph Drawing (GD), p. 169-180, 2008.

  98. A. Estrella-Balderamma, J. Fowler, and S. G. Kobourov, "Colored Simultaneous Geometric Embeddings and Universal Pointsets," 21th Canadian Conference on Computational Geometry (CCCG), p. 25-30, 2009.

  99. C. Binucci, E. Di Giacomo, W. Didimo, A. Estrella-Balderamma, F. Frati, S. G. Kobourov, and G. Liotta, "Directed Graphs with an Upward Straight-line Embedding into Every Point Set," 21th Canadian Conference on Computational Geometry (CCCG), p. 75-80, 2009.

  100. A. Estrella-Balderrama, J. Fowler, and S. G. Kobourov, "On the Characterization of Level Planar Trees by Minimal Patterns," 17th Symposium on Graph Drawing (GD), p. 69-80, 2009.

  101. C. Duncan, S. G. Kobourov, and M. Goodrich, "Planar Drawings of Higher-Genus Graphs," 17th Symposium on Graph Drawing (GD), p. 45-60, 2009.

  102. E. Gansner, Y. Hu, S. G. Kobourov, and C. Volinsky, "Putting Recommendations on the Map - Visualizing Clusters and Relations," 3rd ACM Conference on Recommendation Systems, p. 345-354, 2009.

  103. E. Gansner, Y. Hu, and S. G. Kobourov, "GMap: Visualizing Graphs and Clusters as Maps", 3rd IEEE Pacific Visualzation Symposium, p. 201-208, 2010.

  104. E. Gansner, Y. Hu, M. Kaufmann, and S. G. Kobourov, "Optimal Polygonal Representation of Planar Graphs," 9th Latin American Theoretical Informatics Symposium (LATIN), p. 417-432, 2010.

  105. S. Isaacman, R. Becker, R. Caceres, S. Kobourov, J. Rowland, A. Varshavsky, "A Tale of Two Cities," 11th ACM Workshop on Mobile Computing Systems and Applications (HotMobile), p. 19-24, 2010.

  106. K. Coogan, B. Katz, V. Khare, S. Kobourov, "MSDR-D Network Localization Algorithm," 6th Workshop on Algorithms for Sensor Systems (ALGOSENSORS), p. 148-160, 2010.

  107. V. Dujmovic, W. Evans, S. G. Kobourov, G. Liotta, C. Weibel, and S. Wismath, "On Graphs Supported by Line Sets," 18th Symposium on Graph Drawing (GD), p. 77-82, 2010.

  108. C. Duncan, D. Eppstein, M. Goodrich, S. Kobourov, and M. Noellenburg, "Lombardi Drawings of Graphs," 18th Symposium on Graph Drawing (GD), p. 195-207, 2010.

  109. C. Duncan, D. Eppstein, M. Goodrich, S. Kobourov, and M. Noellenburg, "Drawing Trees with Perfect Angular Resolution and Polynomial Area," 18th Symposium on Graph Drawing (GD), p. 183-194, 2010.

  110. E. Gansner, Y. Hu, and S. G. Kobourov, "On Touching Triangle Graphs," 18th Symposium on Graph Drawing (GD), p. 250-261, 2010.

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

  112. S. Isaacman, R. Becker, R. Caceres, S. Kobourov, M. Martonosi, J. Rowland, A. Varshavsky, "Identifying Important Places in Peoples Lives from Cellular Network Data," 9th Conference on Pervasive Computing, p. 133-151, 2011.

  113. S. Isaacman, R. Becker, R. Caceres, S. Kobourov, M. Martonosi, J. Rowland, A. Varshavsky, "Ranges of Human Mobility in Los Angeles and New York," 8th IEEE International Workshop on Managing Ubiquitous Communications and Services, p. 88-93, 2011.

  114. J. Alam, T. Biedl, S. Felsner, M. Kaufmann, and S. G. Kobourov, "Proportional Contact Representations of Planar Graphs," 19th Symposium on Graph Drawing (GD), p. 26-38, 2011.

  115. P. Angelini, W. Didimo, S. G. Kobourov, T. Mchedlidze, V. Roselli, A. Symvonis, and S. Wismath, "Monotone Drawings of Graphs with Fixed Embedding," 19th Symposium on Graph Drawing (GD), p. 379-390, 2011.

  116. C. Duncan, D. Eppstein, M. Goodrich, S. G. Kobourov, and M. Loeffler, "Planar and Poly-Arc Lombardi Drawings," 19th Symposium on Graph Drawing (GD), p. 308-319, 2011.

  117. R. Chernobelskiy, K. Cunningham, M. Goodrich, S. G. Kobourov, and L. Trott, "Force-Directed Lombardi-Style Graph Drawing," 19th Symposium on Graph Drawing (GD), p. 320-331, 2011.

  118. Y. Hu, S. G. Kobourov, and D. Mashima, "Visualizing Dynamic Data with Maps," 4th IEEE Pacific Visualzation Symposium (PacificVis), p. 102-110, 2011.

  119. J. Alam, T. Biedl, S. Felsner, A. Gerasch, M. Kaufmann and S. G. Kobourov, "Linear-Time Algorithms for Proportional Contact Graph Representations," 22nd Symposium on Algorithms and Computation (ISAAC), p. 281-291, 2011. (Best paper award.)

  120. A. Das, E. Gansner, M. Kaufmann, S. G. Kobourov, J. Spoerhase, and A. Wolff, "Approximating Minimum Manhattan Networks in Higher Dimensions," 19th European Symposium on Algorithms (ESA), p. 49-60, 2011.

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

  122. J. Alam, T. Biedl, S. Felsner, M. Kaufmann, S. G. Kobourov, and T. Ueckerdt, "Computing Cartograms with Optimal Complexity," 28th ACM Symposium on Computational Geometry (SoCG), p. 21-30, 2012.

  123. M. Bekos, S. G. Kobourov, M. Kaufmann and A. Symvonis, "Smooth Orthogonal Layouts," 20th Symposium on Graph Drawing (GD), p. 150-161, 2012.

  124. S. G. Kobourov, D. Mondal and R. Nishat, "Touching Triangle Representations for 3-Connected Planar Graphs," 20th Symposium on Graph Drawing (GD), p. 199-210, 2012.

  125. D. Bremner, W. Evans, F. Frati, L. Heyer, S. G. Kobourov, W. Lenhart, G. Liotta, D. Rappaport and S. Whitesides, "On Representing Graphs by Touching Cuboids," 20th Symposium on Graph Drawing (GD), p. 187-198, 2012.

  126. H. Purchase, J. Hamer, M. Noellenburg and S. G. Kobourov, "On The Usability of Lombardi Graph Drawings," 20th Symposium on Graph Drawing (GD), p. 451-462, 2012.

  127. J. Fowler and S. G. Kobourov, "Planar Preprocessing for Spring Embedders," 20th Symposium on Graph Drawing (GD), p. 388-399, 2012.

  128. J. Alam and S. G. Kobourov, "Proportional Contact Representations of 4-connected Planar Graphs," 20th Symposium on Graph Drawing (GD), p. 211-223, 2012.

  129. J. Kaemper, S. G. Kobourov, M. Noellenburg, "Circular-Arc Cartograms," 6th IEEE Pacific Visualization Symposium (PacificVis), p. 1-8, 2013.

  130. S. G. Kobourov, T. Ueckerdt, and K. Verbeek, "Combinatorial and Geometric Properties of Planar Laman Graphs," 24th ACM-SIAM Annual Symp. on Discrete Algorithms (SODA), p. 1668-1779, 2013.

  131. J. Alam, S. Chaplick, G. Fijavz, M. Kaufmann, S. G. Kobourov, and S. Pupyrev, "Threshold-Coloring and Unit-Cube Contact Representation of Graphs," 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), p. 26-37, 2013.

  132. S. Chaplick, S. G. Kobourov, and T. Ueckerdt, "Equilateral L-Contact Graphs," 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), p. 139-151, 2013.

  133. W. Evans, S. Felsner, M. Kaufmann, S. G. Kobourov, D. Mondal, R. Nishat, and K. Verbeek, "Table Cartograms," 21st European Symposium on Algorithms (ESA), p. 421-432, 2013.

  134. J. Alam, F. Brandenburg and S. G. Kobourov, "Straight-line Grid Drawings of 3-Connected 1-Planar Graphs,", 21st Symposium on Graph Drawing (GD). Accepted, to appear in 2013.

  135. A. Das, K. Fleszar, S. G. Kobourov, J. Spoerhase, S. Veeramoni and A. Wolff, "Approximating the Generalized Minimum Manhattan Network Problem," 24st International Symposium on Algorithms and Computation (ISAAC). Accepted, to appear in 2013.

  136. J. Alam, M. Kaufmann, S. G. Kobourov, and T. Mchedlidze, "Fitting Planar Graphs on Planar Maps," 40th Conference on Current Trends in Theory and Practice of Computer Science (SofSem), p. 52-64, 2014.

  137. L. Barth, S. Fabrikant, S. G. Kobourov, A. Lubiw, M. Noellenburg, Y. Okamoto, S. Pupyrev, C. Squarcella, T. Ueckerdt, and A. Wolff, "Semantic word cloud representations: Hardness and approximation algorithms," 11th Latin American Theoretical Informatics Symposium (LATIN). Accepted, to appear in 2014.

  138. J. Alam, M. Bekos, M. Kaufmann, S. G. Kobourov, P. Kindermann, and A. Wolff, "Smooth Orthogonal Drawings of Planar Graphs," 11th Latin American Theoretical Informatics Symposium (LATIN). Accepted, to appear in 2014.

  139. D. Fried and S. G. Kobourov, "Maps of Computer Science," 7th IEEE Pacific Visualization Symposium (PacificVis). Accepted, to appear in 2014.

  140. J. Alam, S. G. Kobourov, S. Pupyrev, and J. Toeniskoetter, "Happy Edges: Threshold-Coloring of Regular Lattices," FUN with Algorithms (FUN). Accepted, to appear in 2014.

  141. L. Cruz, S. G. Kobourov, S. Pupyrev, P. Shen, and S. Veeramoni, "Computing Consensus Curves," 13th Symposium on Experimental Algorithms (SEA). Accepted, to appear in 2014.

  142. L. Barth, S. G. Kobourov, and S. Pupyrev, "Experimental Comparison of Semantic Word Clouds," 13th Symposium on Experimental Algorithms (SEA). Accepted, to appear in 2014.