Feature selection by interactive clustering. - Stephen K. Wismath; H. P. Soong; Selim G. Akl (Pattern Recognit., 1981)

Characterizing bar line-of-sight graphs. - Stephen K. Wismath (SCG, 1985)

Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). - David G. Kirkpatrick; Stephen K. Wismath (WADS, 1989)

Computing the Full Visibility Graph of a Set of Line Segments. - Stephen K. Wismath (Inf. Process. Lett., 1992)

Reconstruction of Parallel Line Segments From Endpoint Visibility Information. - Stephen K. Wismath (CCCG, 1994)

Orthogonal Polygon Reconstruction. - L. Jackson; Stephen K. Wismath (CCCG, 1996)

Determining Bar-representability for Ordered Weighted Graphs. - David G. Kirkpatrick; Stephen K. Wismath (Comput. Geom., 1996)

Orthogonal 3-D Graph Drawing. - Therese Biedl; Thomas C. Shermer; Sue Whitesides; Stephen K. Wismath (GD, 1997)

Bounds for Orthogonal 3-D Graph Drawing. - Therese Biedl; Thomas C. Shermer; Sue Whitesides; Stephen K. Wismath (J. Graph Algorithms Appl., 1999)

Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. - J. Mark Keil; David M. Mount; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2000)

Point and Line Segment Reconstruction from Visibility Information. - Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2000)

Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. - Michael Closson; Shane Gartshore; John R. Johansen; Stephen K. Wismath (J. Graph Algorithms Appl., 2001)

Drawing series-parallel graphs on a box. - Emilio Di Giacomo; Giuseppe Liotta; Stephen K. Wismath (CCCG, 2002)

Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (GD, 2002)

Orthogonal polygon reconstruction from stabbing information. - L. Jackson; Stephen K. Wismath (Comput. Geom., 2002)

GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions. - Breanne Dyck; Jill Joevenazzo; Elspeth Nickle; Jon Wilsdon; Stephen K. Wismath (GD, 2003)

Drawing Planar Graphs on a Curve. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (WG, 2003)

Properties of Arrangement Graphs. - Prosenjit Bose; Hazel Everett; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2003)

Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. - Stefan Felsner; Giuseppe Liotta; Stephen K. Wismath (J. Graph Algorithms Appl., 2003)

Editorial. - Hazel Everett; Stephen K. Wismath (Comput. Geom., 2004)

Animation of curve constrained drawings of planar graphs. - Kim Hansen; Stephen K. Wismath (SCG, 2005)

Drawing Kn in Three Dimensions with One Bend Per Edge. - Olivier Devillers; Hazel Everett; Sylvain Lazard; Maria Pentcheva; Stephen K. Wismath (GD, 2005)

Curve-constrained drawings of planar graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (Comput. Geom., 2005)

k -Colored Point-Set Embeddability of Outerplanar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Francesco Trotta; Stephen K. Wismath (GD, 2006)

Book Embeddability of Series-Parallel Digraphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Stephen K. Wismath (Algorithmica, 2006)

Drawing Kn in Three Dimensions with One Bend per Edge. - Olivier Devillers; Hazel Everett; Sylvain Lazard; Maria Pentcheva; Stephen K. Wismath (J. Graph Algorithms Appl., 2006)

Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (GD, 2007)

Point-Set Embedding of Trees with Edge Constraints. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (GD, 2007)

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. - Olivier Devillers; Vida Dujmovic; Hazel Everett; Samuel Hornus; Sue Whitesides; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2007)

A note on alpha-drawable k-trees. - Svetlana Stolpner; Jonathan Lenchner; Giuseppe Liotta; David Bremner; Christophe Paul; Marc Pouget; Stephen K. Wismath (CCCG, 2008)

k-colored Point-set Embeddability of Outerplanar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Francesco Trotta; Stephen K. Wismath (J. Graph Algorithms Appl., 2008)

Point-set embeddings of trees with given partial drawings. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2009)

Volume requirements of 3D upward drawings. - Emilio Di Giacomo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Discret. Math., 2009)

On Graphs Supported by Line Sets. - Vida Dujmovic; William S. Evans; Stephen G. Kobourov; Giuseppe Liotta; Christophe Weibel; Stephen K. Wismath (GD, 2010)

Matched drawability of graph pairs and of graph triples. - Luca Grilli 001; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2010)

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. - Hazel Everett; Sylvain Lazard; Giuseppe Liotta; Stephen K. Wismath (Discret. Comput. Geom., 2010)

Constrained Point-Set Embeddability of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Int. J. Comput. Geom. Appl., 2010)

Point-Set Embedding in Three Dimensions. - Stephen K. Wismath; Henk Meijer (CCCG, 2012)

On point-sets that support planar graphs. - Vida Dujmovic; William S. Evans; Sylvain Lazard; William J. Lenhart; Giuseppe Liotta; David Rappaport; Stephen K. Wismath (Comput. Geom., 2013)

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Stephen K. Wismath (CoRR, 2013)

Animation of an Algorithm for Drawing Graphs in 3D. - Lezar DeGuzman; Stephen K. Wismath (SoCG, 2014)

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Tamara Mchedlidze; Stephen K. Wismath (J. Graph Algorithms Appl., 2014)

Guest Editors' Foreword. - Stephen K. Wismath; Alexander Wolff 001 (J. Graph Algorithms Appl., 2014)

Monotone Drawings of Graphs with Fixed Embedding. - Patrizio Angelini; Walter Didimo; Stephen G. Kobourov; Tamara Mchedlidze; Vincenzo Roselli; Antonios Symvonis; Stephen K. Wismath (Algorithmica, 2015)

Planar and Quasi-Planar Simultaneous Geometric Embedding. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. J., 2015)

Point Set Embedding in 3D. - Henk Meijer; Stephen K. Wismath (J. Graph Algorithms Appl., 2015)

Polynomial volume point set embedding of graphs in 3D. - Farshad Barahimi; Stephen K. Wismath (CCCG, 2016)

Monotone Simultaneous Embeddings of Paths in d Dimensions. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (GD, 2016)

Alternating paths and cycles of minimum length. - William S. Evans; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2016)

Monotone Simultaneous Embeddings of Paths in R^d. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (CoRR, 2016)

On the Planar Split Thickness of Graphs. - David Eppstein; Philipp Kindermann; Stephen G. Kobourov; Giuseppe Liotta; Anna Lubiw; Aude Maignan; Debajyoti Mondal; Hamideh Vosoughpour; Sue Whitesides; Stephen K. Wismath (Algorithmica, 2018)

Ortho-polygon Visibility Representations of Embedded Graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Algorithmica, 2018)

Visibility representations of boxes in 2.5 dimensions. - Alessio Arleo; Carla Binucci; Emilio Di Giacomo; William S. Evans; Luca Grilli 001; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Sue Whitesides; Stephen K. Wismath (Comput. Geom., 2018)

Monotone Simultaneous Paths Embeddings in ℝd. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Guillaume Moroz; Sue Whitesides; Stephen K. Wismath (Discret. Math. Theor. Comput. Sci., 2018)

New results on edge partitions of 1-plane graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Theor. Comput. Sci., 2018)

Colored anchored visibility representations in 2D and 3D space. - Carla Binucci; Emilio Di Giacomo; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Vera Sacristán; Stephen K. Wismath (Comput. Geom., 2020)

Packing Trees into 1-planar Graphs. - Felice De Luca; Emilio Di Giacomo; Seok-Hee Hong 001; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; Henk Meijer; Alessandra Tappini; Stephen K. Wismath (J. Graph Algorithms Appl., 2021)

New Bounds on the Local and Global Edge-length Ratio of Planar Graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (CoRR, 2023)

Bounds on the edge-length ratio of 2-outerplanar graphs. - Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Comput. Geom., 2025)

Introducing fairness in network visualization. - Peter Eades; Seokhee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli; Stephen K. Wismath (Inf. Sci., 2025)