Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to...
This paper considers representations of graphs as rectangle-visibility graphs and as doubly linear graphs. These are, respectively, graphs whose vertices are isothetic rectangles ...
Joan P. Hutchinson, Thomas C. Shermer, Andrew Vinc...
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...