S. Wismath

From MaRDI portal
Person:706718

Available identifiers

zbMath Open wismath.stephen-kMaRDI QIDQ706718

List of research outcomes





PublicationDate of PublicationType
Packing Trees into 1-planar Graphs2022-06-28Paper
Colored anchored visibility representations in 2D and 3D space2020-10-23Paper
Packing trees into 1-planar graphs2020-07-22Paper
Packing Trees into 1-planar Graphs2019-11-05Paper
https://portal.mardi4nfdi.de/entity/Q45602232018-12-10Paper
Visibility representations of boxes in 2.5 dimensions2018-10-31Paper
Ortho-polygon visibility representations of embedded graphs2018-07-25Paper
On the planar split thickness of graphs2018-04-11Paper
New results on edge partitions of 1-plane graphs2018-02-06Paper
Ortho-polygon visibility representations of embedded graphs2017-02-21Paper
Visibility representations of boxes in 2.5 dimensions2017-02-21Paper
Monotone Simultaneous Embeddings of Paths in d Dimensions2017-02-21Paper
Alternating Paths and Cycles of Minimum Length2017-02-10Paper
Alternating paths and cycles of minimum length2016-11-14Paper
On the planar split thickness of graphs2016-05-03Paper
Monotone drawings of graphs with fixed embedding2015-05-26Paper
Point-Set Embedding in Three Dimensions2015-05-18Paper
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs2015-01-15Paper
Planar and Quasi Planar Simultaneous Geometric Embedding2015-01-07Paper
On point-sets that support planar graphs2012-10-12Paper
Monotone Drawings of Graphs with Fixed Embedding2012-03-09Paper
On Point-Sets That Support Planar Graphs2012-03-09Paper
On Graphs Supported by Line Sets2011-02-11Paper
CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS2010-12-15Paper
Matched drawability of graph pairs and of graph triples2010-07-28Paper
Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices2010-03-04Paper
Graph-Theoretic Concepts in Computer Science2010-01-12Paper
Point-set embeddings of trees with given partial drawings2009-07-27Paper
Volume requirements of 3D upward drawings2009-04-09Paper
Constrained Point-Set Embeddability of Planar Graphs2009-03-03Paper
Matched Drawability of Graph Pairs and of Graph Triples2009-02-24Paper
k-colored Point-set Embeddability of Outerplanar Graphs2009-01-19Paper
Drawing Kn in Three Dimensions with One Bend per Edge2009-01-19Paper
Point-Set Embedding of Trees with Edge Constraints2008-03-25Paper
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices2008-03-25Paper
k-Colored Point-Set Embeddability of Outerplanar Graphs2007-08-28Paper
Graph Drawing2006-11-13Paper
Graph Drawing2006-11-13Paper
Book embeddability of series-parallel digraphs2006-09-26Paper
POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION2005-06-10Paper
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions2005-05-25Paper
PROPERTIES OF ARRANGEMENT GRAPHS2005-03-30Paper
Curve-constrained drawings of planar graphs2005-02-09Paper
https://portal.mardi4nfdi.de/entity/Q30437342004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44222722003-09-03Paper
VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME2001-09-13Paper
Fully dynamic \(3\)-dimensional orthogonal graph drawing2001-02-19Paper
Determining bar-representability for ordered weighted graphs1996-11-04Paper
https://portal.mardi4nfdi.de/entity/Q40288971993-03-28Paper
Computing the full visibility graph of a set of line segments1993-01-16Paper

Research outcomes over time

This page was built for person: S. Wismath