Stephen K. Wismath

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

Stephen K. Wismath, Henk Meijer: Point-Set Embedding in Three Dimensions. CCCG 2012: 223-228

Vida Dujmovic, William S. Evans, Sylvain Lazard, William Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath: On Point-Sets That Support Planar Graphs. Graph Drawing 2011: 64-74

Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath: Monotone Drawings of Graphs with Fixed Embedding. Graph Drawing 2011: 379-390

Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Matched drawability of graph pairs and of graph triples. Comput. Geom. 43(6-7): 611-634 (2010)

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath: Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. Discrete & Computational Geometry 43(2): 272-288 (2010)

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Int. J. Comput. Geometry Appl. 20(5): 577-600 (2010)

Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath: On Graphs Supported by Line Sets. Graph Drawing 2010: 177-182

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

Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Volume requirements of 3D upward drawings. Discrete Mathematics 309(7): 1824-1837 (2009)

Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333

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

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

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Constrained Point-Set Embeddability of Planar Graphs. Graph Drawing 2008: 360-371

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

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Point-Set Embedding of Trees with Edge Constraints. Graph Drawing 2007: 113-124

Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath: Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. Graph Drawing 2007: 345-351

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Book Embeddability of Series-Parallel Digraphs. Algorithmica 45(4): 531-547 (2006)

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

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath: k -Colored Point-Set Embeddability of Outerplanar Graphs. Graph Drawing 2006: 318-329

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

Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath: Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. CCCG 2005: 302-305

Kim Hansen, Stephen K. Wismath: Animation of curve constrained drawings of planar graphs. Symposium on Computational Geometry 2005: 374-375

Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath: Drawing K_n in Three Dimensions with One Bend Per Edge. Graph Drawing 2005: 83-88

Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Volume Requirements of 3D Upward Drawings. Graph Drawing 2005: 101-110

Hazel Everett, Stephen K. Wismath: Editorial. Comput. Geom. 28(1): 1 (2004)

Prosenjit Bose, Hazel Everett, Stephen K. Wismath: Properties of Arrangement Graphs. Int. J. Comput. Geometry Appl. 13(6): 447-462 (2003)

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

Breanne Dyck, Jill Joevenazzo, Elspeth Nickle, Jon Wilsdon, Stephen K. Wismath: GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions. Graph Drawing 2003: 496-497

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Drawing Planar Graphs on a Curve. WG 2003: 192-204

L. Jackson, Stephen K. Wismath: Orthogonal polygon reconstruction from stabbing information. Comput. Geom. 23(1): 69-83 (2002)

Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath: Drawing series-parallel graphs on a box. CCCG 2002: 149-153

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath: Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. Graph Drawing 2002: 162-173

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

Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. Graph Drawing 2001: 328-342

Stephen K. Wismath: Point and Line Segment Reconstruction from Visibility Information. Int. J. Comput. Geometry Appl. 10(2): 189-200 (2000)

Mark Keil, David M. Mount, Stephen K. Wismath: Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. Int. J. Comput. Geometry Appl. 10(5): 535-552 (2000)

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

Michael Closson, Shane Gartshore, John R. Johansen, Stephen K. Wismath: Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. Graph Drawing 1999: 49-58

Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Orthogonal 3-D Graph Drawing. Graph Drawing 1997: 76-86

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

L. Jackson, Stephen K. Wismath: Orthogonal Polygon Reconstruction. CCCG 1996: 44-49

Stephen K. Wismath: Reconstruction of Parallel Line Segments From Endpoint Visibility Information. CCCG 1994: 369-374

Stephen K. Wismath: Computing the Full Visibility Graph of a Set of Line Segments. Inf. Process. Lett. 42(5): 257-261 (1992)

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

Stephen K. Wismath: Characterizing bar line-of-sight graphs. Symposium on Computational Geometry 1985: 147-152

Stephen K. Wismath, H. P. Soong, Selim G. Akl: Feature selection by interactive clustering. Pattern Recognition 14(1-6): 75-80 (1981)