Stephen K. Wismath

According to our database1, Stephen K. Wismath authored at least 55 papers between 1981 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Packing Trees into 1-Planar Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2018
New results on edge partitions of 1-plane graphs.
Theor. Comput. Sci., 2018

Monotone Simultaneous Paths Embeddings in ℝd.
Discrete Mathematics & Theoretical Computer Science, 2018

Visibility representations of boxes in 2.5 dimensions.
Comput. Geom., 2018

Ortho-polygon Visibility Representations of Embedded Graphs.
Algorithmica, 2018

On the Planar Split Thickness of Graphs.
Algorithmica, 2018

2016
Monotone Simultaneous Embeddings of Paths in R^d.
CoRR, 2016

Alternating paths and cycles of minimum length.
Comput. Geom., 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Point Set Embedding in 3D.
J. Graph Algorithms Appl., 2015

Planar and Quasi-Planar Simultaneous Geometric Embedding.
Comput. J., 2015

Monotone Drawings of Graphs with Fixed Embedding.
Algorithmica, 2015

2014
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2014

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.
J. Graph Algorithms Appl., 2014

Animation of an Algorithm for Drawing Graphs in 3D.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.
CoRR, 2013

On point-sets that support planar graphs.
Comput. Geom., 2013

2012
Point-Set Embedding in Three Dimensions.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2010
Constrained Point-Set Embeddability of Planar Graphs.
Int. J. Comput. Geometry Appl., 2010

Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices.
Discrete & Computational Geometry, 2010

Matched drawability of graph pairs and of graph triples.
Comput. Geom., 2010

On Graphs Supported by Line Sets.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
Volume requirements of 3D upward drawings.
Discrete Mathematics, 2009

Point-set embeddings of trees with given partial drawings.
Comput. Geom., 2009

2008
k-colored Point-set Embeddability of Outerplanar Graphs.
J. Graph Algorithms Appl., 2008

A note on alpha-drawable k-trees.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
Int. J. Comput. Geometry Appl., 2007

Point-Set Embedding of Trees with Edge Constraints.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
Drawing Kn in Three Dimensions with One Bend per Edge.
J. Graph Algorithms Appl., 2006

Book Embeddability of Series-Parallel Digraphs.
Algorithmica, 2006

k -Colored Point-Set Embeddability of Outerplanar Graphs.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

2005
Curve-constrained drawings of planar graphs.
Comput. Geom., 2005

Drawing Kn in Three Dimensions with One Bend Per Edge.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Animation of curve constrained drawings of planar graphs.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Editorial.
Comput. Geom., 2004

2003
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions.
J. Graph Algorithms Appl., 2003

Properties of Arrangement Graphs.
Int. J. Comput. Geometry Appl., 2003

Drawing Planar Graphs on a Curve.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Orthogonal polygon reconstruction from stabbing information.
Comput. Geom., 2002

Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Drawing series-parallel graphs on a box.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing.
J. Graph Algorithms Appl., 2001

2000
Point and Line Segment Reconstruction from Visibility Information.
Int. J. Comput. Geometry Appl., 2000

Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time.
Int. J. Comput. Geometry Appl., 2000

1999
Bounds for Orthogonal 3-D Graph Drawing.
J. Graph Algorithms Appl., 1999

1997
Orthogonal 3-D Graph Drawing.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996
Determining Bar-representability for Ordered Weighted Graphs.
Comput. Geom., 1996

Orthogonal Polygon Reconstruction.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1994
Reconstruction of Parallel Line Segments From Endpoint Visibility Information.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1992
Computing the Full Visibility Graph of a Set of Line Segments.
Inf. Process. Lett., 1992

1989
Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract).
Proceedings of the Algorithms and Data Structures, 1989

1985
Characterizing bar line-of-sight graphs.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1981
Feature selection by interactive clustering.
Pattern Recognition, 1981


  Loading...