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. 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.)

3. 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.)

4. 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.)

5. 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.)

6. 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.)

7. 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.)

8. 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.)

9. 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.)

10. 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.)

11. 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.)

12. 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.)

13. 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.)

14. 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.)

15. 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.)

16. 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.)

17. 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.)

18. C. A. Duncan, A. Efrat, S. G. Kobourov, and C. Wenk, "Drawing Graphs with Fat Edges," International Journal of Foundations of Computer Science. Accepted, to appear in 2006. (A preliminary version appeared in the 9th Symp. on Graph Drawing (GD), p. 162-177, 2001.)

19. C. A. Duncan, S. G. Kobourov, and V. S. A. Kumar, ``Optimal Constrained Graph Exploration,'' ACM Transactions on Algorithms. Accepted, to appear in 2006. (A preliminary version appeared in the 12th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), p. 807-814, 2001.)

20. 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.

21. 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.)

22. 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.)

23. 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.)

24. 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.)

25. 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.

26. 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.

27. 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.)

28. 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.)

29. 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.

30. 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.)

31. 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.)

32. 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.

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

34. 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.

35. 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.)

36. 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.)

37. 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.

38. 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.)

39. 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.

40. 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.

41. 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.

42. 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.

43. 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.

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

45. 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.

46. 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.

47. 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.

48. 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.

49. 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.

50. 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.

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

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

53. 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.

54. 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.

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

56. 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.

57. 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.

58. 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.

59. 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.

60. 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.

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

62. 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.

63. 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.

64. 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.

65. J. Fowler and S. G. Kobourov, ``Characterization of Unlabeled Level Planar Graphs,'' 15th Symposium on Graph Drawing (GD). Accepted, to appear in 2007.

66. J. Fowler and S. G. Kobourov, ``Minimum Level Nonplanar Patterns for Trees,'' 15th Symposium on Graph Drawing (GD). Accepted, to appear in 2007.

67. F. Frati, M. Kaufmann and S. G. Kobourov, ``Constrained Simultaneous and Near-Simultaneous Embeddings,'' 15th Symposium on Graph Drawing (GD). Accepted, to appear in 2007.