2009 |
36 | EE | 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 |
2008 |
35 | | Svetlana Stolpner,
Jonathan Lenchner,
Giuseppe Liotta,
David Bremner,
Christophe Paul,
Marc Pouget,
Stephen K. Wismath:
A note on alpha-drawable k-trees.
CCCG 2008 |
34 | EE | Emilio Di Giacomo,
Walter Didimo,
Giuseppe Liotta,
Henk Meijer,
Stephen K. Wismath:
Constrained Point-Set Embeddability of Planar Graphs.
Graph Drawing 2008: 360-371 |
33 | EE | 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) |
2007 |
32 | EE | 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 |
31 | EE | 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 |
30 | EE | 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) |
2006 |
29 | EE | 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 |
28 | EE | Emilio Di Giacomo,
Walter Didimo,
Giuseppe Liotta,
Stephen K. Wismath:
Book Embeddability of Series-Parallel Digraphs.
Algorithmica 45(4): 531-547 (2006) |
27 | EE | 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) |
2005 |
26 | EE | 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 |
25 | EE | Emilio Di Giacomo,
Giuseppe Liotta,
Henk Meijer,
Stephen K. Wismath:
Volume Requirements of 3D Upward Drawings.
Graph Drawing 2005: 101-110 |
24 | EE | Olivier Devillers,
Hazel Everett,
Sylvain Lazard,
Maria Pentcheva,
Stephen K. Wismath:
Drawing Kn in Three Dimensions with One Bend Per Edge.
Graph Drawing 2005: 83-88 |
23 | EE | Kim Hansen,
Stephen K. Wismath:
Animation of curve constrained drawings of planar graphs.
Symposium on Computational Geometry 2005: 374-375 |
22 | EE | Emilio Di Giacomo,
Walter Didimo,
Giuseppe Liotta,
Stephen K. Wismath:
Curve-constrained drawings of planar graphs.
Comput. Geom. 30(1): 1-23 (2005) |
2004 |
21 | EE | Hazel Everett,
Stephen K. Wismath:
Editorial.
Comput. Geom. 28(1): 1- (2004) |
2003 |
20 | EE | 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 |
19 | EE | Emilio Di Giacomo,
Walter Didimo,
Giuseppe Liotta,
Stephen K. Wismath:
Drawing Planar Graphs on a Curve.
WG 2003: 192-204 |
18 | EE | Prosenjit Bose,
Hazel Everett,
Stephen K. Wismath:
Properties of Arrangement Graphs.
Int. J. Comput. Geometry Appl. 13(6): 447-462 (2003) |
17 | EE | 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) |
2002 |
16 | EE | Emilio Di Giacomo,
Giuseppe Liotta,
Stephen K. Wismath:
Drawing series-parallel graphs on a box.
CCCG 2002: 149-153 |
15 | EE | 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 |
14 | | L. Jackson,
Stephen K. Wismath:
Orthogonal polygon reconstruction from stabbing information.
Comput. Geom. 23(1): 69-83 (2002) |
2001 |
13 | EE | Stefan Felsner,
Giuseppe Liotta,
Stephen K. Wismath:
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions.
Graph Drawing 2001: 328-342 |
12 | EE | Michael Closson,
Shane Gartshore,
John R. Johansen,
Stephen K. Wismath:
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing.
J. Graph Algorithms Appl. 5(2): (2001) |
2000 |
11 | | Stephen K. Wismath:
Point and Line Segment Reconstruction from Visibility Information.
Int. J. Comput. Geometry Appl. 10(2): 189-200 (2000) |
10 | | 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) |
1999 |
9 | EE | Michael Closson,
Shane Gartshore,
John R. Johansen,
Stephen K. Wismath:
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing.
Graph Drawing 1999: 49-58 |
8 | EE | 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) |
1997 |
7 | | Therese C. Biedl,
Thomas C. Shermer,
Sue Whitesides,
Stephen K. Wismath:
Orthogonal 3-D Graph Drawing.
Graph Drawing 1997: 76-86 |
1996 |
6 | | L. Jackson,
Stephen K. Wismath:
Orthogonal Polygon Reconstruction.
CCCG 1996: 44-49 |
5 | | David G. Kirkpatrick,
Stephen K. Wismath:
Determining Bar-representability for Ordered Weighted Graphs.
Comput. Geom. 6: 99-122 (1996) |
1994 |
4 | | Stephen K. Wismath:
Reconstruction of Parallel Line Segments From Endpoint Visibility Information.
CCCG 1994: 369-374 |
1992 |
3 | | Stephen K. Wismath:
Computing the Full Visibility Graph of a Set of Line Segments.
Inf. Process. Lett. 42(5): 257-261 (1992) |
1989 |
2 | | David G. Kirkpatrick,
Stephen K. Wismath:
Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract).
WADS 1989: 325-334 |
1981 |
1 | EE | Stephen K. Wismath,
H. P. Soong,
Selim G. Akl:
Feature selection by interactive clustering.
Pattern Recognition 14(1-6): 75-80 (1981) |