S. H. Whitesides

From MaRDI portal
Person:788734

Available identifiers

zbMath Open whitesides.sue-hMaRDI QIDQ788734

List of research outcomes

PublicationDate of PublicationType
On the reconfiguration of chains2024-01-29Paper
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs2023-11-16Paper
The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs2023-08-10Paper
1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids2023-07-03Paper
Combinatorial properties and recognition of unit square visibility graphs2023-05-12Paper
Nearest neighbour graph realizability is NP-hard2022-08-16Paper
1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids2022-07-13Paper
Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs2022-03-22Paper
https://portal.mardi4nfdi.de/entity/Q51112442020-05-26Paper
Reconfiguring Hamiltonian cycles in L-shaped grid graphs2020-02-24Paper
https://portal.mardi4nfdi.de/entity/Q45602232018-12-10Paper
Kinetic \(k\)-semi-Yao graph and its applications2018-11-19Paper
Visibility representations of boxes in 2.5 dimensions2018-10-31Paper
On the planar split thickness of graphs2018-04-11Paper
Connecting a set of circles with minimum sum of radii2018-02-19Paper
Bend complexity and Hamiltonian cycles in grid graphs2017-10-23Paper
Connectivity graphs of uncertainty regions2017-10-09Paper
The complexity of (un)folding2017-09-29Paper
Separating point sets in polygonal environments2017-09-29Paper
The number of lines tangent to arbitrary convex polyhedra in 3D2017-09-29Paper
Visibility representations of boxes in 2.5 dimensions2017-02-21Paper
Monotone Simultaneous Embeddings of Paths in d Dimensions2017-02-21Paper
Constrained Light Deployment for Reducing Energy Consumption in Buildings2017-02-01Paper
On the planar split thickness of graphs2016-05-03Paper
https://portal.mardi4nfdi.de/entity/Q34671522016-01-26Paper
Kinetic Reverse k-Nearest Neighbor Problem2015-09-15Paper
A simple, faster method for kinetic proximity problems2015-05-12Paper
Kinetic data structures for all nearest neighbors and closest pair in the plane2015-02-17Paper
Computing upward topological book embeddings of upward planar digraphs2015-02-13Paper
Acyclic Coloring with Few Division Vertices2014-08-19Paper
Acyclic coloring with few division vertices2014-08-13Paper
A Note on Minimum-Segment Drawings of Planar Graphs2013-07-09Paper
On Representing Graphs by Touching Cuboids2013-04-03Paper
Kinetic and Stationary Point-Set Embeddability for Plane Graphs2013-04-03Paper
Acyclic colorings of graph subdivisions revisited2013-01-18Paper
On Three-Dimensional Graph Drawing and Embedding2012-06-08Paper
The shape of orthogonal cycles in three dimensions2012-04-04Paper
Embedding Plane 3-Trees in ℝ2 and ℝ32012-03-09Paper
Acyclic Colorings of Graph Subdivisions2012-01-13Paper
Connecting a set of circles with minimum sum of radii2011-08-12Paper
A SUCCINCT 3D VISIBILITY SKELETON2011-03-25Paper
Connectivity graphs of uncertainty regions2010-12-09Paper
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective2010-11-16Paper
On the Computation of 3D Visibility Skeletons2010-07-20Paper
Intractability in Graph Drawing and Geometry: FPT Approaches2009-12-11Paper
Graph Drawing2009-08-11Paper
Embeddability Problems for Upward Planar Digraphs2009-03-03Paper
Faster fixed-parameter tractable algorithms for matching and packing problems2008-12-02Paper
On the parameterized complexity of layered graph drawing2008-12-02Paper
Realizing partitions respecting full and partial order information2008-11-18Paper
MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT2008-05-14Paper
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra2008-04-22Paper
The strength of weak proximity2006-10-31Paper
A fixed-parameter approach to 2-layer planarization2006-08-11Paper
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization2006-04-03Paper
Graph Drawing2005-12-07Paper
Transversals to line segments in three-dimensional space2005-11-10Paper
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS2005-09-29Paper
Algorithms – ESA 20042005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q46575742005-03-14Paper
A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q30437002004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44723172004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44740692004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44222682003-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44186342003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47961972003-03-02Paper
Embedding problems for paths with direction constrained edges.2003-01-21Paper
Curvature-Constrained Shortest Paths in a Convex Polygon2003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q27668152002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q27683822002-07-22Paper
A note on reconfiguring tree linkages: Trees can lock2002-05-15Paper
Three-dimensional orthogonal graph drawing algorithms2000-07-11Paper
The largest \(k\)-ball in a \(d\)-dimensional box1998-12-21Paper
A Visibility Representation for Graphs in Three Dimensions1998-07-05Paper
The rectangle of influence drawability problem1998-06-08Paper
Localizing a Robot with Minimum Travel1998-05-10Paper
Universal 3-dimensional visibility representations for graphs1998-04-13Paper
Simultaneous dominance representation of multiple posets1997-08-05Paper
The logic engine and the realization problem for nearest neighbor graphs1997-02-27Paper
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings1997-02-27Paper
The realization problem for Euclidean minimum spanning trees is NP-hard1996-11-10Paper
https://portal.mardi4nfdi.de/entity/Q48860761996-11-04Paper
Folding rulers inside triangles1996-09-22Paper
Reconfiguring closed polygonal chains in Euclidean \(d\)-space1995-03-20Paper
Drawing graphs in two layers1994-08-29Paper
Grid intersection graphs and boxicity1993-10-24Paper
Computing the link center of a simple polygon1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37163321985-01-01Paper
On the Movement of Robot Arms in 2-Dimensional Bounded Regions1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37336691985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36867531984-01-01Paper
Movement Problems for 2-Dimensional Linkages1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849331984-01-01Paper
Edge-colored complete graphs with alternating cycles1983-01-01Paper
A classification of certain graphs with minimal imperfection properties1982-01-01Paper
An algorithm for finding clique cut-sets1981-01-01Paper
Collineations of projective planes of order 10. Part I1979-01-01Paper
Collineations of projective planes of order 10, part II1979-01-01Paper
A note on a generalized regularity condition1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41056871976-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: S. H. Whitesides