The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephen K. Wismath: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Steve Wismath
    Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:302-305 [Conf]
  2. Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath
    Drawing series-parallel graphs on a box. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:149-153 [Conf]
  3. L. Jackson, Stephen K. Wismath
    Orthogonal Polygon Reconstruction. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:44-49 [Conf]
  4. Stephen K. Wismath
    Reconstruction of Parallel Line Segments From Endpoint Visibility Information. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:369-374 [Conf]
  5. Kim Hansen, Stephen K. Wismath
    Animation of curve constrained drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:374-375 [Conf]
  6. Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
    Orthogonal 3-D Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:76-86 [Conf]
  7. Michael Closson, Shane Gartshore, John R. Johansen, Stephen K. Wismath
    Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:49-58 [Conf]
  8. Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath
    Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:328-342 [Conf]
  9. Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
    Drawing Kn in Three Dimensions with One Bend Per Edge. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:83-88 [Conf]
  10. Breanne Dyck, Jill Joevenazzo, Elspeth Nickle, Jon Wilsdon, Stephen K. Wismath
    GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:496-497 [Conf]
  11. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:162-173 [Conf]
  12. Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
    Volume Requirements of 3D Upward Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:101-110 [Conf]
  13. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Francesco Trotta, Stephen K. Wismath
    k -Colored Point-Set Embeddability of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:318-329 [Conf]
  14. David G. Kirkpatrick, Stephen K. Wismath
    Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:325-334 [Conf]
  15. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Drawing Planar Graphs on a Curve. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:192-204 [Conf]
  16. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Book Embeddability of Series-Parallel Digraphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:4, pp:531-547 [Journal]
  17. Hazel Everett, Stephen K. Wismath
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:1-0 [Journal]
  18. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Curve-constrained drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:1-23 [Journal]
  19. David G. Kirkpatrick, Stephen K. Wismath
    Determining Bar-representability for Ordered Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:99-122 [Journal]
  20. L. Jackson, Stephen K. Wismath
    Orthogonal polygon reconstruction from stabbing information. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:69-83 [Journal]
  21. Prosenjit Bose, Hazel Everett, Stephen K. Wismath
    Properties of Arrangement Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:6, pp:447-462 [Journal]
  22. Mark Keil, David M. Mount, Stephen K. Wismath
    Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:5, pp:535-552 [Journal]
  23. Stephen K. Wismath
    Point and Line Segment Reconstruction from Visibility Information. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:2, pp:189-200 [Journal]
  24. Stephen K. Wismath
    Computing the Full Visibility Graph of a Set of Line Segments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:5, pp:257-261 [Journal]
  25. Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
    Bounds for Orthogonal 3-D Graph Drawing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:4, pp:63-79 [Journal]
  26. Michael Closson, Shane Gartshore, John R. Johansen, Stephen K. Wismath
    Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2001, v:5, n:2, pp:- [Journal]
  27. Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath
    Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:363-398 [Journal]
  28. Stephen K. Wismath, H. P. Soong, Selim G. Akl
    Feature selection by interactive clustering. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1981, v:14, n:1-6, pp:75-80 [Journal]

  29. A note on alpha-drawable k-trees. [Citation Graph (, )][DBLP]


  30. Characterizing bar line-of-sight graphs. [Citation Graph (, )][DBLP]


  31. Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


  32. Point-Set Embedding of Trees with Edge Constraints. [Citation Graph (, )][DBLP]


  33. Constrained Point-Set Embeddability of Planar Graphs. [Citation Graph (, )][DBLP]


  34. Matched Drawability of Graph Pairs and of Graph Triples. [Citation Graph (, )][DBLP]


  35. Point-set embeddings of trees with given partial drawings. [Citation Graph (, )][DBLP]


  36. Matched drawability of graph pairs and of graph triples. [Citation Graph (, )][DBLP]


  37. Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices. [Citation Graph (, )][DBLP]


  38. Volume requirements of 3D upward drawings. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002