Books and Monographs
 S. Kobourov, "Visualization of Large Graphs," PhD Thesis, Johns Hopkins University, 2000.
 M. T. Goodrich and S. Kobourov, editors, 10th International Symposium on Graph Drawing (GD), Lecture Notes in Computer Science, Vol. 2528, SpringerVerlag, 2002.

H. Hauser, S. Kobourov, H. Qu, editors, Proceedings of the 5th IEEE Pacific Visualization Symposium (PacificVis), Songdo, Korea, February 28  March 2 2012, IEEE Press, 2012.
 S. Kobourov, "ForceDirected Drawing Algorithms," In
Roberto Tamassia (editor),
Handbook of Graph Drawing and Visualization, p. 383408, CRC Press, 2013.
 T. Blasius, S. Kobourov, and I. Rutter, "Simultaneous Embedding of Planar Graphs," In
Roberto Tamassia (editor),
Handbook of Graph Drawing and Visualization, CRC Press, p. 349381, 2013.
 E. Gansner, Y. Hu, S. Kobourov, "Viewing Abstract Data as Maps,"
In Tony Huang (editor), Human Centric Visualization: Theories,
Methodologies and Case Studies, p. 6389, Springer, 2013.
 J. Abello, D. Archambault, J. Kennedy, S. Kobourov, K. Ma,
S. Miksch, C. Muelder, and A. Telea, "Temporal
Multivariate Networks," in A. Kerren, H. Purchase, and M. Ward
(editors), Multivariate Network Visualization, p. 151175, Springer, 2014.
 S. Kobourov, "Canonical
Orders and Schnyder Realizers," in M.Y. Kao (editor),
Encyclopedia of Algorithms, DOI 10.1007/9783642278488 6501, p. 18, Springer, 2015.
 R. Borgo, B. Lee, B. Bach, S. Fabrikant, R. Jianu, A. Kerren, S. Kobourov, F. McGee, L. Micallef, T. Landesberger,
K. Ballweg, S.Diehl, P. Simonetto, M. Zhou, "Crowdsourcing for Information Visualization:
Promises and Pitfalls," in A. Kerren, H. Purchase, Evaluation in the Crowd. Crowdsourcing and HumanCentered Experiments,
p. 96138, Springer, 2017.
 S. Kobourov, G. Liotta, and F. Montecchiani, "An annotated bibliography on 1planarity,"Computer Science Review, vol. 25, p. 4967, 2017.
Refereed Journal Publications
 C. A. Duncan, M. T. Goodrich, and S. Kobourov, "Balanced Aspect Ratio Trees and Their Use for
Drawing Large Graphs," Journal of Graph Algorithms and Applications, v. 4, p. 1946, 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.111124, 1998.)
 C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. Kobourov, "Drawing Planar Graphs with Circular Arcs," Discrete & Computational Geometry, v. 25, p. 405418, 2001. (A preliminary version
appeared in the 7th Symposium on Graph Drawing (GD),
p.117126, 1999.)
 C. A. Duncan, M. T. Goodrich, and S. Kobourov, "Balanced Aspect Ratio Trees: Combining the
Advantages of kd Trees and Octrees," Journal of Algorithms, v. 38, p. 303333, 2001. (Invited to this special issue on best papers from SODA'99. A preliminary version
appeared in the 10th ACMSIAM Symposium on
Discrete Algorithms, (SODA), p.300309, 1999.)
 C. A. Duncan, M. T. Goodrich, and S. Kobourov, "PlanarityPreserving Clustering and Embedding
for Large Planar Graphs," Computational Geometry: Theory and Applications, v. 24, no. 3, p. 95114, 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.186196, 1999.)
 P. Gajer and S. Kobourov, "GRIP: Graph Drawing with Intelligent Placement," Journal of Graph
Algorithms and Applications, v. 6, no. 3, p. 203224, 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. 222228, 2000.)
 C. A. Duncan and S. Kobourov, "Polar Coordinate Drawing of Planar Graphs with Good Angular
Resolution," Journal of Graph Algorithms and Applications, v. 7, no. 4, p. 311333, 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.407421, 2001.)
 P. Gajer, M. T. Goodrich, and S. Kobourov, "A MultiDimensional Approach to ForceDirected Layouts of Large Graphs," Computational Geometry: Theory and Applications, v. 29 no. 1, p.318, 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.211221, 2000.)
 T. Biedl, E. Demaine, C. A. Duncan, R. Fleischer, and S. Kobourov, "Tight Bounds on Maximal
and Maximum Matching," Journal of Discrete Mathematics, v. 285 no. 1, p. 715, 2004. (A preliminary version appeared in the 12th International Symposium on Algorithms and Computation (ISAAC), p.308319, 2001.)
 C. Collberg and S. Kobourov, "SelfPlagiarism in Computer Science," Communications of the
ACM, v. 48, no. 2, p. 8894, 2005. (A preliminary version.)
 C. Erten and S. Kobourov, "Simultaneous Embedding of a Planar Graph and Its Dual on the
Grid," Theory of Computing, v. 38, no. 3, p.313327, 2005. (A preliminary version appeared in the 13th International Symposium on Algorithms and Computation (ISAAC), p.575587, 2002.)
 C. Erten, S. 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. 165182, 2005. (A preliminary version appeared in the 11th Symposium on Graph Drawing (GD), p. 437449, 2003.)
 S. Kobourov and K. Wampler, ``NonEuclidean Spring Embedders,'' IEEE Transactions on Visualization and Computer Graphics, v. 11, no. 6, p. 757767, 2005. (A preliminary version appeared in the 10th IEEE Symposium on Information Visualization (INFOVIS), p. 207214, 2004.)
 C. Erten and S. Kobourov, ``Simultaneous Embedding of Planar Graphs with Few Bends,'' Journal of Graph
Algorithms and Applications, v. 9, no. 3, p. 347364, 2005. (A preliminary version appeared in the 12th Symposium on Graph Drawing (GD), p. 195206, 2004.)
 A. Efrat, S. Kobourov, and A. Lubiw, ``Computing Homotopic Shortest
Paths Efficiently,'' Computational Geometry: Theory and Applications,
vol. 35, no. 3, p. 162172, 2006.
(A preliminary version appeared in the 10th
European Symp. on Algorithms (ESA), p.411423, 2002.)
 P. Brass, E. Cenek, C. A. Duncan, A. Efrat, C. Erten, D. Ismailescu,
S. Kobourov, A. Lubiw, and J. S. B. Mitchell, ``On Simultaneous
Planar Graph Embeddings,'' Computational Geometry: Theory and
Applications, vol. 36, no. 2, p. 117130, 2007.
(A preliminary version appeared in the Workshop on Algorithms and Data
Structures (WADS), p. 243255, 2003.)
 A. Efrat, C. Erten, and S. Kobourov, "FixedLocation
CircularArc Drawing of Planar Graphs", Journal of Graph Algorithms
and Applications, vol. 11, no. 1, p. 145164, 2007. (A preliminary version appeared in the 11th Symposium on Graph Drawing (GD), p. 147158, 2003.)
 C. A. Duncan, A. Efrat, S. Kobourov, and C. Wenk, "Drawing Graphs with Fat Edges," International Journal of Foundations of Computer Science, vol. 17, no. 5, p. 11431165, 2006. (A preliminary version appeared in the 9th Symp. on Graph Drawing (GD), p. 162177, 2001.)
 C. A. Duncan, S. Kobourov, and V. S. A. Kumar, "Optimal
Constrained Graph Exploration," ACM Transactions on Algorithms, vol. 2, no. 3, p. 380402, 2007. (A preliminary version appeared in the 12th ACMSIAM Annual Symposium on Discrete Algorithms (SODA), p. 807814, 2001.)
 S. Kobourov and M. Landis, "Morphing Planar Graphs in Spherical Space," Journal of Graph Algorithms and Applications, vol. 12, no. 1, p.113127, 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. 306317, 2006.)
 J. Cappos, A. EstrellaBalderrama, J. Fowler, and S. Kobourov, "Simultaneous Graph Embedding with Bends and Circular Arcs," Computational Geometry: Theory and Applications, vol. 42, no. 2, p. 173182, 2008. (A preliminary version appeared in the 14th Symp. on Graph Drawing (GD), p. 95107, 2006.)
 F. Frati, M. Kaufmann and S. Kobourov, "Contrained
Simultaneous and NearSimultaneous Embeddings," Journal of Graph
Algorithms and Applications, vol. 13, no. 3, p. 447465, 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. 268279, 2006.)
 A. EstrellaBalderrama, J. Fowler, and S. Kobourov,
"Characterization of Unlabeled Level Planar Trees," Computational
Geometry: Theory and Applications, vol. 42, no. 6, p. 704721,
2009. (A preliminary version appeared in the 14th Symposium on Graph Drawing (GD), p. 367379, 2006.)
 C. Binucci, E. Di Giacomo, W. Didimo, A. EstrellaBalderrama,
F. Frati, S. Kobourov, G. Liotta, "Upward Straightline Embeddings
of Directed Graphs into Point Sets," Computational Geometry: Theory
and Applications, vol. 43, no. 2, p. 219232, 2010. (A preliminary version appeared in the 21th Canadian Conference on Computational Geometry (CCCG), 2009.)
 A. EstrellaBalderrama, J. Fowler, and S. Kobourov, "GraphSET,
a tool for simultaneous graph drawing," Software: Practice and
Experience, vol. 40, no. 10, p. 849863, 2010. (A preliminary version appeared in the 16th Symposium on Graph
Drawing (GD), p.169180, 2008.)
 C. Erten, A. Efrat, D. Forrester, A. Iyer, and
S. Kobourov, "ForceDirected Approaches to Sensor Localization,"
IEEE Transaction on Sensor Networks, vol. 7, no. 3, p. 125, 2010.
(A preliminary version appeared in the 8th Workshop on Algorithm Engineering and Experiments (ALENEX), p. 108118, 2006.)
 E. Gansner, Y. Hu, and S. Kobourov, "Visualizing Graphs and
Clusters as Maps," IEEE Computer Graphics and Applications, vol. 30, no. 6, p. 4466, 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. 201208, 2010.)
 U. Brandes, C. Erten, A. EstrellaBalderrama, J, Fowler, F. Frati,
M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S. Kobourov,
G. Liotta, P. Mutzel, and A. Symvonis, "Colored Simultaneous Geometric
Embeddings and Universal Pointsets," Algorithmica, vol. 60. no. 3,
p. 569592, 2011. (A preliminary version appeared in the 13th International Computing and Combinatorics Conference, (COCOON), p. 254263, 2007.)
 C. Duncan, S. Kobourov, and M. Goodrich, "Planar Drawings of
HigherGenus Graphs," Journal of Graph Algorithms and
Applications, vol. 15, no. 1, pp. 732, 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. 4560, 2009.)
 J. Fowler, M. Juenger, S. 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. 385398, 2011.
(A preliminary version appeared in the 34th Workshop on GraphTheoretic Concepts in Computer Science (WG), p. 146158, 2008.)
 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. 85108, 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. 195207, 2010.)
 E. Gansner, Y. Hu, M. Kaufmann, and S. Kobourov,
"Optimal Polygonal Representation of Planar Graphs," Algorithmica, vol. 63, no. 3, p. 672691, 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. 417432, 2010.)
 J. Alam, T. Biedl, S. Felsner, M. Kaufmann, and S. Kobourov, "Proportional Contact Representations of Planar Graphs," Journal of Graph Algorithms and Applications, vol. 16, no. 3, p. 701728, 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. 2638, 2011.)
 Y. Hu, S. Kobourov, and D. Mashima,
"Visualizing Dynamic Data with Maps," IEEE Transactions on Visualization and Computer Graphics, vol. 18, no. 9, p. 14241437, 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. 102110, 2011.)
 C. Duncan, D. Eppstein, M. Goodrich, S. Kobourov, and M. Noellenburg, "Drawing Trees with Perfect Angular Resolution and Polynomial Area," Discrete & Computational Geometry, Vol. 49, no. 2, p. 157182, 2013. (A preliminary version appeared in the 18th Symposium on Graph Drawing (GD), p. 183194, 2010.)
 M. Hingle, D. Yoon, J. Fowler, S. 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.125145, 2013.
 J. Alam, T. Biedl, S. Felsner, A. Gerasch, M. Kaufmann and
S. Kobourov, "LinearTime Algorithms for Proportional Contact
Graph Representations." Algorithmica, Vol. 67, p. 322, 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. 281291, 2011.)
 M. Bekos, S. Kobourov, M. Kaufmann and A. Symvonis, "Smooth Orthogonal Layouts,"
Journal of Graph Algorithms and Applications, vol. 17, no. 5,
p. 575595, 2013. (A preliminary version appeared in the 20th
Symposium on Graph Drawing (GD), p. 150161, 2012.)
 J. Alam, T. Biedl, S. Felsner, M. Kaufmann, S. Kobourov and
T. Ueckerdt, "Computing Cartograms with Optimal Complexity,"
Discrete & Computational Geometry, vol. 50, no. 3, p. 784810,
2013. (A preliminary version appeared in the 28th
ACM Symposium on Computational Geometry (SoCG), p. 2130, 2012.)
 Y. Hu, S. Kobourov, S. Veeramoni, "Embedding, Clustering and
Coloring for Dynamic Maps," Journal of Graph Algorithms and
Applications, vol. 18, no. 1, p. 77109, 2014. (A preliminary version appeared in the 5th IEEE Pacific Visualzation Symposium (PacificVis), p. 3340 2012.)
 M. Bekos, M. Kaufmann, S. Kobourov, S. Veeramoni,
"On Maximum Differential Coloring of Planar Graphs," Journal of Discrete
Algorithms. vol. 29, p. 17, 2014.
 B. Saket, P. Simonetto, S. Kobourov, Katy Borner,
"Evaluation of Node, NodeLink, and NodeLinkGroup Diagrams,"
IEEE Transactions on Visualization and Computer Graphics (TVCG), vol. 20, no. 12, p. 22312240, 2014.
 B. Saket, C. Scheidegger, S. Kobourov, Katy Borner, "Mapbased Visualizations Increase LongTerm Recall of Data,"
Computer Graphics Forum, special issue on EUROVIS'15, vol. 34, no. 3,
p. 441450, 2015.
 J. Alam, S. Kobourov, S. Veeramoni,
"Quantitative Measures for Cartogram
Generation Techniques,"
Computer Graphics Forum, special issue on
EUROVIS'15, vol. 34, no. 3, p. 351360, 2015.
 A. Das, E. Gansner, M. Kaufmann, S. Kobourov, J. Spoerhase, and
A. Wolff,
"Approximating Minimum Manhattan Networks in Higher Dimensions," Algorithmica. vol. 71, no. 1, p. 3652, 2015.
(A preliminary version appeared in the 19th European Symposium on
Algorithms (ESA), p. 4960, 2011.)

J. Alam, M. Kaufmann, S. Kobourov, and T. Mchedlidze, "Fitting
Planar Graphs on Planar Maps," Journal of Graph Algorithms and
Applications, vol. 19, no. 1, p. 413440, 2015.
(A preliminary version
appeared in the 40th Conference on Current Trends in
Theory and Practice of Computer Science (SofSem), p. 5264, 2014.)
 P. Angelini, W. Didimo, S. Kobourov, T. Mchedlidze,
V. Roselli, A. Symvonis, and S. Wismath, "Monotone Drawings of Graphs
with Fixed Embedding," Algorithmica, vol. 71, no. 2, p. 233257, 2015.
(A preliminary version appeared in the 19th Symposium on Graph Drawing (GD), p. 379390, 2011.)
 J. Alam, S. Chaplick, G. Fijavz,
M. Kaufmann, S. Kobourov, S. Pupyrev, J. Toeniskoetter,
"ThresholdColoring and UnitCube Contact Representation of Planar
Graphs," Discrete Applied Mathematics, vol. 216, no. 1, p. 2 14, 2017.
(A preliminary version appeared in the
39th International Workshop on GraphTheoretic Concepts in Computer Science
(WG), p. 2637, 2013.)
 M. Bekos, T. van Dijk, M. Fink, P. Kindermann, S. Kobourov,
S. Pupyrev, J. Spoerhase, A. Wolff,
"Improved Approximation Algorithms for Box Contact Representations,"
Algorithmica, vol. 77, no. 3, p. 902920, 2017
(A preliminary version appeared in the 22nd
European Symposium on Algorithms (ESA), p. 8799, 2014.)
 M. Bekos, S. Kobourov, M. Kaufmann, S. Veeramoni, "The Maximum kDifferential Coloring Problem," Journal of Discrete
Algorithms, vol. 45, p. 3553, 2017.
(A preliminary version
appeared in the 41st Conference on Current Trends in Theory and Practice of Computer Science (SofSem), p. 115127, 2015.)
 B. Saket, C. Scheidegger, S. Kobourov, "Comparing NodeLink
and NodeLinkGroup Visualizations From An Enjoyment Perspective,"
Computer Graphics Forum, vol. 35, no. 3, p. 4150, 2016. (A preliminary
version appeared in the 18th IEEE Eurographics Conference on Visualization EUROVIS'16.)
 S. Nusrat and S. Kobourov, "The State of the Art in Cartograms,"
Computer Graphics Forum, vol. 35, no. 3, p. 619642, 2016. (A
preliminary version appeared in the 18th IEEE Eurographics Conference on Visualization (EUROVIS'16).)
 S. Emmons, S. Kobourov, M. Gallant, K. Borner, "Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale," PLOS ONE, vol. 11, no. 7, e0159161. doi:10.1371/journal.pone.0159161, 2016.
 A. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni and
A. Wolff, "Approximating the Generalized Minimum
Manhattan Network Problem," Algorithmica, vol. 80, no. 4, p. 11701190, 2018. (A preliminary
version appeared in the 24st International Symposium on
Algorithms and Computation (ISAAC), p. 722732, 2013.)
 J. Alam, S. Kobourov, D. Mondal, "Orthogonal Layout with Optimal
Face Complexity," Computational Geometry: Theory and Applications, vol. 63, p. 4052, 2017.
(A preliminary
version appeared in the 42nd International Conference on Current Trends in Theory and Practice
of Computer Science (SofSem), p. 121133, 2016.)
 P. Angelini, M. Bekos, F. De Luca, W. Didimo, M. Kaufmann,
S. Kobourov, F. Montecchiani, C. Raftopoulou, V. Roselli, A. Symvonis,
"VertexColoring with Defects," Journal of Graph Algorithms and
Applications, vol. 21, no. 3, p. 313340, 2017.
 H. Kruiger, P. Rauber, R. Martins, A. Kerren, S. Kobourov, and
A. Telea, "Graph Layouts by tSNE," Computer Graphics Forum,
vol. 36, no. 3, 2017. (A preliminary
version appeared in the 19th IEEE Eurographics Conference on
Visualization (EUROVIS), 2017.)
 E. Welch and S. Kobourov, "Measuring Symmetry in Drawings of
Graphs," Computer Graphics Forum, vol. 36, no. 3, 2017. (A preliminary
version appeared in the 19th IEEE Eurographics Conference on
Visualization (EUROVIS), 2017.)
 M. Chimani, S. Felsner, S. Kobourov, T. Ueckerdt, P. Valtr, and
A. Wolff,"On the Maximum Crossing Number,"
Journal of Graph Algorithms and Applications, vol. 22, no. 1,
p. 6787, 2018. (A preliminary version appeared in the
28th International Workshop on Combinatorial Algorithms (IWOCA), 2017.)
 D. Eppstein, P. Kindermann, S. Kobourov, G. Liotta, A. Lubiw,
A. Maignan, D. Mondal, H. Vosoughpour, S. Whitesides and S. Wismath,
"On the Planar Split Thickness of Graphs," Algorithmica, vol. 80,
no. 3, p. 977 994, 2018. (A preliminary version appeared in the
12th Latin American Theoretical Informatics Symposium (LATIN),
p. 403415, 2016.)
 W. Evans, S. Felsner, M. Kaufmann, S. Kobourov, D. Mondal,
R. Nishat, and K. Verbeek, ``Table Cartograms,'' Computational
Geometry: Theory and Applications, vol. 68, p. 174185, 2018.
(A preliminary version
appeared in the 21st European Symposium on Algorithms (ESA),
p. 421432, 2013.)
 S. Nusrat, J. Alam, S. Kobourov, "Evaluating
Cartogram Effectiveness," IEEE Transactions on Visualization and
Computer Graphics, vol. 24, no. 2, p. 10771090, 2018
 S. Nusrat, J. Alam, C. Scheidegger, S. Kobourov, "Cartogram
Visualization for Bivariate GeoStatistical Data," IEEE
Transactions on Visualization and Computer Graphics, DOI:
10.1109/TVCG.2017.2765330, 2018.
 U. Soni, Y. Lu, B. Hansen, H. Purchase, S. Kobourov,
R. Maciejewski, "The Perception of Graph Properties in Graph Layouts,"
Computer Graphics Forum, 2018. (A
preliminary
version
appeared in the 20th IEEE Eurographics Conference on Visualization (EUROVIS), 2018.)
Refereed Conference Publications
 B. Awerbuch and S. Kobourov, "PolylogarithmicOverhead Piecemeal Graph Exploration," Proceedings of the 11th Conference on Computational Learning Theory (COLT), p. 280286, July 1998.
 C. A. Duncan, M. T. Goodrich, and S. Kobourov, "Balanced Aspect Ratio Trees and Their
Use for Drawing Large Graphs," 6th Annual Symposium on Graph Drawing (GD), p. 111124, 1998.
(Prelim. version of 1.)
 C. A. Duncan, M. T. Goodrich, and S. Kobourov, "PlanarityPreserving Clustering and Embedding
for Large Planar Graphs," 7th Symp. on Graph Drawing (GD), p. 186196, 1999. (Prelim. version
of 4.)
 C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. Kobourov, "Drawing Planar Graphs with
Circular Arcs," 7th Annual Symposium on Graph Drawing (GD), p. 117126, 1999. (Prelim. version
of 2.)
 C. A. Duncan, M. T. Goodrich, and S. Kobourov, "Balanced Aspect Ratio Trees: Combining the
Advantages of k d Trees and Octrees," 10th ACMSIAM Annual Symposium on Discrete Algorithms,
(SODA), p. 300309, 1999. (Prelim. version of 3.)
 S. Bridgeman, M. T. Goodrich, S. Kobourov, and R. Tamassia, "PILOT: An Interactive Tool for
Learning and Grading," 31st Annual Technical Symposium on Computer Science Education (SIGCSE),
p. 139143, March 2000.
 S. Bridgeman, M. T. Goodrich, S. 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. 300304, March 2000.
 P. Gajer, M. T. Goodrich, and S. Kobourov, "A Fast MultiDimensional Algorithm for Drawing
Large Graphs," 8th Symp. on Graph Drawing (GD), p. 211221, 2000. (Prelim. version of 8.)
 P. Gajer and S. Kobourov, "GRIP: Graph Drawing with Intelligent Placement," 8th Symp. on
Graph Drawing (GD), p. 222228, 2000. (Prelim. version of 5.)
 C. A. Duncan, S. Kobourov, and V. S. A. Kumar, "Optimal Constrained Graph Exploration,"
12th ACMSIAM Annual Symp. on Discrete Algorithms (SODA), p. 807814, 2001.
 C. A. Duncan and S. Kobourov, "Polar Coordinate Drawing of Planar Graphs with Good Angular
Resolution," 9th Symp. on Graph Drawing (GD), p. 407421, 2001. (Prelim. version of 6.)
 T. Biedl, E. Demaine, C. A. Duncan, R. Fleischer, and S. Kobourov, "Tight Bounds on Maximal
and Maximum Matching," 12th Intl. Symp. on Algorithms & Computation (ISAAC), p. 308319, 2001.
(Prelim. version of 9.)
 C. A. Duncan, A. Efrat, S. Kobourov, and C. Wenk, "Drawing Graphs with Fat Edges," 9th
Symp. on Graph Drawing (GD), p. 162177, 2001.
 A. Efrat, S. Kobourov, M. Stepp, and C. Wenk, "Growing Fat Graphs," 18th Annual Symposium
on Computational Geometry (SCG), p. 277278, 2002.
 C. Collberg, S. 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. 228228, 2002.
 A. Efrat, S. Kobourov, and A. Lubiw, "Computing Homotopic Shortest Paths Efficiently," 10th
European Symp. on Algorithms (ESA), p.411423, 2002. (Prelim. version of 11.)
 C. Erten and S. Kobourov, "Simultaneous Embedding of a Planar Graph and Its Dual on the
Grid," 13th Intl. Symp. on Algorithms & Computation (ISAAC), p. 575587, 2002. (Prelim. version
of 10.)
 C. Collberg, S. Kobourov, J. Nagra, J. Pitts, and K. Wampler, "A System for GraphBased
Visualization of the Evolution of Software," ACM Symp. on Software Visualization (SoftVis), p. 7786, 2003.
 P. Brass, E. Cenek, C. A. Duncan, A. Efrat, C. Erten, D. Ismailescu, S. Kobourov, A. Lubiw, and
J. S. B. Mitchell, "On Simultaneous Planar Graph Embeddings," Workshop on Algorithms and Data
Structures (WADS), p. 243255, 2003. (Prelim. version of 13.)
 C. Collberg, S. Kobourov, S. Kobes, B. Smith, S. Trush, and G. Yee, "TetraTetris: An Application of MultiUser TouchBased Interaction using DiamondTouch", 9th International Conference on
HumanComputer Interaction (INTERACT), p. 8188, 2003.
 A. Efrat, H. H. GonzalesBanos, S. Kobourov, and L. Palaniappan, "Optimal Motion Strategies to
Track and Capture a Predictable Target," IEEE Conference of Robotics and Automation (ICRA), p. 411423, 2003.
 C. Collberg, S. Kobourov, E. Carter, and C. Thomborson, "ErrorCorrecting Graphs for Software
Watermarking", 29th Workshop on Graph Theoretic Concepts in Computer Science (WG), p. 156167,
2003.
 C. Collberg, S. Kobourov, J. Louie, and T. Slattery, "SPLAT: A System for SelfPlagiarism
Detection", IADIS Conference on WWW/Internet, p. 508514, 2003.
 A. Efrat, C. Erten, and S. Kobourov, "FixedLocation CircularArc Drawing of Planar Graphs",
11th Symposium on Graph Drawing (GD), p. 147158, 2003.
 C. Erten, S. Kobourov, and C. Pitta, "IntersectionFree Morphing of Planar Graphs", 11th Symposium on Graph Drawing (GD), p. 320331, 2003.
 F. Brandenburg, D. Eppstein, M. T. Goodrich, S. Kobourov, G. Liotta, P. Mutzel, "Selected Open Problems
in Graph Drawing," 11th Symposium on Graph Drawing (GD), p. 515539, 2003.
 C. Erten, S. Kobourov, V. Le, and A. Navabi, "Simultaneous Graph Drawing: Layout Algorithms
and Visualization Schemes", 11th Symposium on Graph Drawing (GD), p. 437449, 2003.
 C. Erten, P. J. Harding, S. Kobourov, K. Wampler, and G. Yee, "GraphAEL: Graph Animations
with Evolving Layouts", 11th Symposium on Graph Drawing (GD), p. 98110, 2003.
 C. Collberg, S. Kobourov, and S. Westbrook, "AlgoVista: An Algorithmic Search Tool in an Educational Setting," 35st Technical Symposium on Computer Science Education (SIGCSE), p. 462466, 2004.
 C. Erten, P. Harding, S. Kobourov, K. Wampler, and G. Yee, "Exploring the Computing Literature
Using Temporal Graph Visualization," Conference on Visualization and Data Analysis (VDA), p. 4556, 2004.
 C. Duncan, D. Eppstein, and S. Kobourov, "The Geometric Thickness of Low Degree Graphs,"
20th Annual ACMSIAM Symposium on Computational Geometry (SCG), p. 340346, 2004.
 C. Erten, S. Kobourov, and C. Pitta, "Morphing Planar Graphs," 20th Annual ACMSIAM Symposium on
Computational Geometry (SCG), p.451452, 2004.
 S. Kobourov and K. Wampler "NonEuclidean Spring Embedders," 10th Annual IEEE Symposium on Information Visualization (InfoVis), p. 207214, 2004.
 J. Abello, S. Kobourov, and R. Yusufov, ``Visualizing Large Graphs with CompoundFisheye Views and Treemaps,'' 12th
Symposium on Graph Drawing (GD), p. 431442, 2004.
 S. Kobourov and C. Pitta, ``An Interactive MultiUser System for Simultaneous Graph Drawing,'' 12th
Symposium on Graph Drawing (GD), p. 492503, 2004.
 C. Erten and S. Kobourov, ``Simultaneous Embedding of Planar Graphs with Few Bends,'' 12th
Symposium on Graph Drawing (GD), p. 195206, 2004.
 D. Forrester, S. Kobourov, A. Navabi, K. Wampler, G. Yee, ``graphael: A System for Generalized ForceDirected Layouts,'' 12th
Symposium on Graph Drawing (GD), p. 454466, 2004.
 B. Dux, A. Iyer, S. Debray, D. Forrester, and S. Kobourov, ``Visualizing the Behavior of Dynamically Modifiable Code.'' 13th IEEE International Workshop on Program Comprehension (IWPC), p. 337340, 2005.
 C. Collberg, S. Debray, S. Kobourov, and S. Westbrook, ``Increasing Undergraduate Involvement in Computer Science Research,'' 8th World Conference on Computers in Education (WCCE), p. 342352, 2005.
 J. Cappos, S. Kobourov, M. Miles, M. Stepp, K. Pavlou, and A. Wixted, "Collaboration with DiamondTouch," 10th International Conference on HumanComputer Interaction (INTERACT), p. 986990, 2005.
 C. Erten, A. Efrat, D. Forrester, A. Iyer, and S. Kobourov, ``ForceDirected Approaches to Sensor Localization,'' 8th Workshop on Algorithm Engineering and Experiments (ALENEX), p. 108118, 2006.
 S. Kobourov and M. Landis, "Morphing Planar Graphs in Spherical Space," 14th Symposium on Graph Drawing (GD), p. 306317, 2006.
 A. EstrellaBalderrama, J. Fowler, and S. Kobourov, "Characterization of Unlabeled Level Planar Trees," 14th Symposium on Graph Drawing (GD), p. 367379, 2006.
 J. Cappos, A. EstrellaBalderrama, J. Fowler, and S. Kobourov, "Simultaneous Graph Embedding with Bends and Circular Arcs," 14th Symposium on Graph Drawing (GD), p. 95107, 2006.
 U. Brandes, C. Erten, J. Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S. Kobourov, G. Liotta, P. Mutzel, A. Symvonis, "Colored Simultaneous Geometric Embeddings," 13th International Computing and Combinatorics Conference, (COCOON), p. 254263, 2007.
 J. Fowler and S. Kobourov, ``Characterization of Unlabeled Level Planar Graphs,'' 15th Symposium on Graph Drawing (GD), p. 3749, 2007.
 J. Fowler and S. Kobourov, ``Minimum Level Nonplanar Patterns for Trees,'' 15th Symposium on Graph Drawing (GD), p. 6975, 2007.
 F. Frati, M. Kaufmann and S. Kobourov, ``Constrained Simultaneous and NearSimultaneous Embeddings,'' 15th Symposium on Graph Drawing (GD), p. 268279, 2007.
 J. Fowler, M. Junger, S. 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. 4144, 2008.
 A. EstrellaBalderrama, F. Frati, and S. Kobourov, "Upward Straightline Embeddings of Directed Graphs
into Point Sets,"34th Workshop on GraphTheoretic Concepts in Computer Science (WG), p. 122133, 2008.
 J. Fowler, M. Junger, S. Kobourov, and M. Schulz, "Characterizing Simultaneous Embedding with Fixed Edges," 34th Workshop on GraphTheoretic Concepts in Computer Science (WG), p. 146158, 2008.
 A. EstrellaBalderrama, J. Fowler and S. Kobourov, "GraphSET: Graph Simultaneous Embedding Tool," 16th Symposium on Graph Drawing (GD), p. 169180, 2008.
 A. EstrellaBalderamma, J. Fowler, and S. Kobourov, "Colored Simultaneous Geometric Embeddings and
Universal Pointsets," 21th Canadian Conference on Computational
Geometry (CCCG), p. 2530, 2009.
 C. Binucci, E. Di Giacomo, W. Didimo, A. EstrellaBalderamma,
F. Frati, S. Kobourov, and G. Liotta, "Directed Graphs with an Upward Straightline
Embedding into Every Point Set," 21th Canadian Conference on
Computational Geometry (CCCG), p. 7580, 2009.
 A. EstrellaBalderrama, J. Fowler, and S. Kobourov, "On the Characterization of Level Planar
Trees by Minimal Patterns," 17th Symposium on Graph Drawing (GD),
p. 6980, 2009.
 C. Duncan, S. Kobourov, and M. Goodrich, "Planar Drawings of HigherGenus Graphs," 17th
Symposium on Graph Drawing (GD), p. 4560, 2009.
 E. Gansner, Y. Hu, S. Kobourov, and C. Volinsky, "Putting Recommendations on the Map  Visualizing
Clusters and Relations," 3rd ACM Conference on Recommendation
Systems, p. 345354, 2009.
 E. Gansner, Y. Hu, and S. Kobourov, "GMap: Visualizing Graphs and Clusters as Maps",
3rd IEEE Pacific Visualzation Symposium, p. 201208, 2010.
 E. Gansner, Y. Hu, M. Kaufmann, and S. Kobourov, "Optimal Polygonal Representation of Planar
Graphs," 9th Latin American Theoretical Informatics Symposium
(LATIN), p. 417432, 2010.
 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. 1924, 2010.
 K. Coogan, B. Katz, V. Khare, S. Kobourov, "MSDRD Network
Localization Algorithm," 6th Workshop on Algorithms for Sensor Systems (ALGOSENSORS), p. 148160, 2010.
 V. Dujmovic, W. Evans, S. Kobourov, G. Liotta, C. Weibel, and
S. Wismath, "On Graphs Supported by Line Sets," 18th Symposium on
Graph Drawing (GD), p. 7782, 2010.
 C. Duncan, D. Eppstein, M. Goodrich, S. Kobourov, and M. Noellenburg, "Lombardi Drawings of Graphs," 18th Symposium on Graph
Drawing (GD), p. 195207, 2010.
 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. 183194, 2010.
 E. Gansner, Y. Hu, and S. Kobourov, "On Touching Triangle
Graphs," 18th Symposium on Graph Drawing (GD), p. 250261, 2010.
 Y. Hu, S. Kobourov, and S. Veeramoni, "On Maximum Differential
Graph Coloring," 18th Symposium on Graph Drawing (GD), p. 274286, 2010.
 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. 133151, 2011.
 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. 8893,
2011.
 J. Alam, T. Biedl, S. Felsner, M. Kaufmann, and S. Kobourov,
"Proportional Contact Representations of Planar Graphs," 19th
Symposium on Graph Drawing (GD), p. 2638, 2011.
 P. Angelini, W. Didimo, S. Kobourov, T. Mchedlidze, V. Roselli,
A. Symvonis, and S. Wismath, "Monotone Drawings of Graphs with Fixed
Embedding," 19th Symposium on Graph Drawing (GD), p. 379390, 2011.
 C. Duncan, D. Eppstein, M. Goodrich, S. Kobourov, and M. Loeffler,
"Planar and PolyArc Lombardi Drawings," 19th Symposium on Graph
Drawing (GD), p. 308319, 2011.
 R. Chernobelskiy, K. Cunningham, M. Goodrich, S. Kobourov, and
L. Trott, "ForceDirected LombardiStyle Graph
Drawing," 19th
Symposium on Graph Drawing (GD), p. 320331, 2011.
 Y. Hu, S. Kobourov, and D. Mashima, "Visualizing Dynamic Data with Maps," 4th IEEE
Pacific Visualzation Symposium (PacificVis), p. 102110, 2011.
 J. Alam, T. Biedl, S. Felsner, A. Gerasch, M. Kaufmann and
S. Kobourov, "LinearTime Algorithms for Proportional Contact
Graph Representations," 22nd Symposium on Algorithms and Computation
(ISAAC), p. 281291, 2011. (Best paper award.)
 A. Das, E. Gansner, M. Kaufmann, S. Kobourov, J. Spoerhase,
and A. Wolff, "Approximating Minimum Manhattan
Networks in Higher Dimensions," 19th European Symposium on
Algorithms (ESA), p. 4960, 2011.
 Y. Hu, S. Kobourov, S. Veeramoni, "Embedding, Clustering and Coloring for Dynamic Maps," 5th IEEE Pacific Visualzation Symposium (PacificVis), p. 3340 2012.
 J. Alam, T. Biedl, S. Felsner, M. Kaufmann, S. Kobourov, and T. Ueckerdt,
"Computing Cartograms with Optimal Complexity," 28th
ACM Symposium on Computational Geometry (SoCG), p. 2130, 2012.
 M. Bekos, S. Kobourov, M. Kaufmann and A. Symvonis, "Smooth Orthogonal Layouts," 20th
Symposium on Graph Drawing (GD), p. 150161, 2012.
 S. Kobourov, D. Mondal and R. Nishat, "Touching Triangle Representations for 3Connected
Planar Graphs," 20th Symposium on Graph Drawing (GD), p. 199210, 2012.
 D. Bremner, W. Evans, F. Frati, L. Heyer, S. Kobourov, W. Lenhart, G. Liotta, D. Rappaport and
S. Whitesides, "On Representing Graphs by Touching Cuboids," 20th Symposium on Graph Drawing
(GD), p. 187198, 2012.
 H. Purchase, J. Hamer, M. Noellenburg and S. Kobourov, "On The Usability of Lombardi Graph Drawings," 20th Symposium on Graph Drawing (GD), p. 451462, 2012.
 J. Fowler and S. Kobourov, "Planar Preprocessing for Spring Embedders," 20th Symposium on
Graph Drawing (GD), p. 388399, 2012.
 J. Alam and S. Kobourov, "Proportional Contact Representations of 4connected Planar Graphs,"
20th Symposium on Graph Drawing (GD), p. 211223, 2012.
 J. Kaemper, S. Kobourov, M. Noellenburg, "CircularArc Cartograms,"
6th IEEE Pacific Visualization Symposium (PacificVis), p. 18, 2013.
 S. Kobourov, T. Ueckerdt, and K. Verbeek, "Combinatorial and Geometric Properties of Planar Laman Graphs,"
24th ACMSIAM Annual Symp. on Discrete Algorithms (SODA), p. 16681779, 2013.
 J. Alam, S. Chaplick, G. Fijavz, M. Kaufmann, S. Kobourov,
and S. Pupyrev, "ThresholdColoring and UnitCube Contact Representation of Graphs,"
39th International Workshop on GraphTheoretic Concepts in Computer Science
(WG), p. 2637, 2013.
 S. Chaplick, S. Kobourov, and T. Ueckerdt, "Equilateral LContact Graphs,"
39th International Workshop on GraphTheoretic Concepts in Computer Science
(WG), p. 139151, 2013.
 W. Evans, S. Felsner, M. Kaufmann, S. Kobourov, D. Mondal,
R. Nishat, and K. Verbeek, "Table Cartograms," 21st European
Symposium on Algorithms (ESA), p. 421432, 2013.

J. Alam, F. Brandenburg and S. Kobourov, "Straightline Grid Drawings of 3Connected
1Planar Graphs,", 21st Symposium on Graph Drawing (GD), p. 8394, 2013.
 A. Das, K. Fleszar, S. Kobourov, J. Spoerhase, S. Veeramoni and
A. Wolff, "Approximating the Generalized Minimum
Manhattan Network Problem," 24st International Symposium on
Algorithms and Computation (ISAAC), p. 722732, 2013.
 J. Alam, M. Kaufmann, S. Kobourov, and T. Mchedlidze, "Fitting
Planar Graphs on Planar Maps," 40th Conference on Current Trends in
Theory and Practice of Computer Science (SofSem), p. 5264, 2014.
 L. Barth, S. Fabrikant, S. 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), p. 514525, 2014.
 J. Alam, M. Bekos, M. Kaufmann, S. Kobourov, P. Kindermann,
and A. Wolff, "Smooth Orthogonal Drawings of Planar Graphs," 11th
Latin American Theoretical Informatics Symposium (LATIN), p. 144155, 2014.
 W. Evans, S. Felsner, S. Kobourov, T. Ueckerdt, "Graphs admitting drealizers:
treedecompositions and boxrepresentations", 30th European
Workshop on Computational Geometry (EuroCG), 2014.
 J. Alam, S. Kobourov, S. Pupyrev, and J. Toeniskoetter, "Happy Edges: ThresholdColoring of Regular Lattices," FUN
with Algorithms (FUN), p. 2839, 2014.
 L. Cruz, S. Kobourov, S. Pupyrev, P. Shen, and S. Veeramoni, "Computing Consensus Curves," 13th Symposium on
Experimental Algorithms (SEA), p. 223234, 2014.
 L. Barth, S. Kobourov, and S. Pupyrev, "Experimental Comparison of Semantic Word Clouds," 13th Symposium on Experimental Algorithms (SEA), p. 247258, 2014.
 D. Fried and S. Kobourov, "Maps of Computer Science," 7th IEEE
Pacific Visualization Symposium (PacificVis), p. 113120, 2014.
 J. Alam, S. Kobourov, G. Liotta, S. Pupyrev, and S. Veeramoni, "Proportional Contact Representations Using Ls" 5th International Conference on Information, Intelligence, Systems and Applications (IISA), p. 2732, 2014.
 M. Bekos, T. van Dijk, M. Fink, P. Kindermann, S. Kobourov, S. Pupyrev, J. Spoerhase, A. Wolff, "Improved Approximation Algorithms for Box Contact Representations," 22nd European Symposium on Algorithms (ESA), p. 8799, 2014
 S. Pupyrev, P. Simonetto, S. Kobourov, "Visualizing Graphs as Maps with Contiguous Regions," 16th IEEE Eurographics Conference on Visualization (EUROVIS  short papers), p. 3135, 2014.
 S. Kobourov, B. Saket, P. Simonetto, "GroupLevel Graph
Visualization Taxonomy," 16th IEEE Eurographics Conference on Visualization (EUROVIS  short papers), p. 8589, 2014.
 S. Kobourov, S. Pupyrev, B. Saket, "Are Crossings Important for Drawing Large Graphs?" 22nd Symposium on Graph Drawing (GD), p. 234245, 2014.
 J. Alam, D. Eppstein, M. Goodrich, S. Kobourov, S. Pupyrev,
"Balanced Circle Packings for Planar Graphs," 22nd Symposium on Graph Drawing (GD), p. 125136, 2014.
 A. Efrat, Y. Hu, S. Kobourov, S. Pupyrev, "MapSets: Visualizing Embedded and Clustered Graphs," 22nd Symposium on Graph Drawing (GD), p. 452463, 2014.
 J. Fowler, T. Johnson, P. Simonetto, M. Schneider, C. Acedo, S. Kobourov, and L. Lazos, "IMap: Visualizing Network Activity over Internet Maps," 11th Visualization for Cyber Security Conference (VizSec), p. 8087, 2014.
 D. Fried, M. Surdeanu, S. Kobourov, and M. Hingle, "Analyzing the Language of Food on Social Media,"
IEEE International Conference on Big Data (BigData), p. 778783, 2014.
 S. Kobourov, B. Saket, P. Simonetto, Katy Borner,
"Evaluation of Node, NodeLink, and NodeLinkGroup Diagrams," 20th IEEE Symposium on
Information Visualization (INFOVIS), p. 22312240, 2014.
 M. Bekos, S. Kobourov, M. Kaufmann, S. Veeramoni, "The Maximum kDifferential Coloring Problem," 41st Conference on Current Trends in Theory and Practice of Computer Science (SofSem), p. 115127, 2015.
 B. Saket, C. Scheidegger, S. Kobourov, Katy Borner,
"Mapbased Visualizations Increase LongTerm Recall of Data,"
17th IEEE Eurographics Conference on Visualization (EUROVIS), 2015.
 J. Alam, S. Kobourov, S. Veeramoni, "Quantitative Measures for Cartogram
Generation Techniques," 17th IEEE Eurographics Conference on
Visualization (EUROVIS), 2015.
 S. Kobourov and S. Nusrat, "Task Taxonomy for Cartograms,"
17th IEEE Eurographics Conference on Visualization (EUROVIS  short papers), 2015.
 B. Saket, S. Kobourov, C. Scheidegger, "Towards Understanding Enjoyment and Flow in Information Visualization,"
17th IEEE Eurographics Conference on Visualization (EUROVIS  short papers), 2015.
 T. Johnson, C. Acedo, S. Kobourov, S. Nusrat, "Analyzing the Evolution of the Internet," 17th IEEE Eurographics Conference on Visualization
(EUROVIS  short papers), 2015.
 J. Alam, S. Kobourov, S. Pupyrev and J. Toeniskoetter, "Weak Unit Disk and Interval Representation of
Graphs," 41st International Workshop on GraphTheoretic Concepts
in Computer Science(WG), 2015.
 J. Alam, W. Evan, S. Kobourov, S. Pupyrev, J. Toeniskoetter,
T. Ueckerdt, "Contact Representations
of NonPlanar Graphs", Symposium on Algorithms and Data Structures
(WADS), p. 1427, 2015.
 J. Alam, D. Eppstein, M. Kaufmann, S. Kobourov, S. Pupyrev,
A. Schulz, T. Ueckerdt, "Contact Graphs of Circular
Arcs", Symposium on Algorithms and Data Structures (WADS), p. 113, 2015.
 E. Di Giacomo, W. Didimo, S. Hong, M. Kaufmann, S. Kobourov,
G. Liotta, K. Misue, A. Symvonis and H. Yen, "Low Ply Graph Drawing,"
6th IEEE International Conference on Information, Intelligence, Systems and Applications
(IISA), p. 16, 2015.
 T. Bruckdorfer, M. Kaufmann, S. Kobourov, S. Pupyrev, "On
Embeddability of Buses in Point Sets,"
23rd Symposium on Graph Drawing (GD), p. 395408, 2015.
 D. Eppstein, P. Kindermann, S. Kobourov, G. Liotta, A. Lubiw,
A. Maignan, D. Mondal, H. Vosoughpour, S. Whitesides and S. Wismath,
"On the Planar Split Thickness of Graphs,"
12th Latin American Theoretical Informatics Symposium (LATIN), p. 403415, 2016.
 J. Alam, S. Kobourov, D. Mondal, "Orthogonal Layout with Optimal
Face Complexity,"
42nd International Conference on Current Trends in Theory and Practice
of Computer Science (SofSem), p. 121133, 2016.
 J. Alam, M. Kaufmann, S. Kobourov, "On Contact Graphs with Cubes
and Proportional Boxes,"
42nd International Conference on Current Trends in Theory and Practice
of Computer Science (SofSem), p. 107120, 2016.
 D. Bell, D. Fried, L. Huangfu, M. Surdeanu, S. Kobourov,
"Towards Using Social Media to Identify Individuals at Risk for
Preventable Chronic Illness,"
10th International Conference on Language Resources and Evaluation (LREC), 2016.
 B. Saket, C. Scheidegger, S. Kobourov, "Comparing NodeLink and NodeLinkGroup Visualizations From An Enjoyment Perspective,"
18th IEEE Eurographics Conference on Visualization (EUROVIS), 2016.
 S. Nusrat and S. Kobourov, "The State of the Art in Cartograms,"
19th IEEE Eurographics Conference on Visualization (EUROVIS), 2016.
 P. Angelini, M. Bekos, T. Bruckdorfer, J. Hancl,
M. Kaufmann, S. Kobourov, J. Kratochvil, A. Symvonis, and P. Valtr, "Low Ply
Drawings of Trees," 24th Symposium on Graph Drawing and Network
Visualization (GD), p. 236248, 2016.
 F. De Luca, E. Di Giacomo, W. Didimo, S. Kobourov and
G. Liotta, "An Experimental Study on the Ply Number of Straightline Drawings," 11th International Conference and Workshops on Algorithms and Computation (WALCOM), 2017.
 M. Chimani, S. Felsner, S. Kobourov, T. Ueckerdt, P. Valtr, and
A. Wolff, "On the Maximum Crossing Number," 28th International Workshop on Combinatorial Algorithms (IWOCA), 2017.
 H. Kruiger, P. Rauber, R. Martins, A. Kerren, S. Kobourov, and A. Telea,
"Graph Layouts by tSNE," 19th IEEE Eurographics Conference on Visualization (EUROVIS), 2017.
 E. Welch and S. Kobourov, "Measuring Symmetry in Drawings of Graphs," 19th IEEE Eurographics Conference on Visualization (EUROVIS), 2017.
 P. Angelini, S. Chaplick, F. De Luca, J. Fiala, J. Hancl, N. Heinsohn, M. Kaufmann, S. Kobourov, J. Kratochvil and P. Valtr "On Vertex and EmptyPly Proximity Drawings," 25th Symposium on Graph Drawing (GD), 2017.
 M. Okoe, R. Jianu and S. Kobourov "Revisited Experimental Comparison of NodeLink and Matrix Representations," 25th Symposium on Graph Drawing (GD),
2017. Best paper award.
 P. Simonetto, D. Archambault and S. Kobourov "Drawing Dynamic Graphs Without Timeslices," 25th Symposium on Graph Drawing (GD),
2017.
 P. Kindermann, S. Kobourov, M. Loeffler, M. Noellenburg, A. Schulz and B. Vogtenhuber "Lombardi Drawings of Knots and Links," 25th Symposium on Graph Drawing (GD),
2017.
 R. Burd, K. Espy, I. Hossain, S. Kobourov, N. Merchant, H. Purchase,
"GRAM: Global Research Activity Map," 12th International Conference on
Advanced Visual Interfaces (AVI), 2018.
 U. Soni, Y. Lu, B. Hansen, H. Purchase, S. Kobourov,
R. Maciejewski,
"The Perception of Graph Properties in Graph Layouts," 20th IEEE
Eurographics Conference on Visualization (EUROVIS), 2018.
 R. Ahmed, S. Kobourov, S. Rahman, "Online Facility Assignment," 13th
International Conference and Workshops on Algorithms and Computation
(WALCOM), p. 156168, 2018. (Best paper award)
 R. Ahmed, P. Angelini, F. Sahneh, A. Efrat,
D. Glickenstein, M. Gronemann, N. Heinsohn, S. Kobourov, R. Spence, J. Watkins, A. Wolff, "MultiLevel Steiner Trees," 17th Symposium on Experimental Algorithms (SEA), 2018.