Saeed Mehrabi

On RAC drawings of 1-planar graphs

Abstract A drawing of a graph is 1-planar if each edge is crossed at most once. A graph is 1-planar if it has a 1-planar drawing. A k-bend RAC (Right Angle Crossing) drawing of a graph is a polyline drawing where each edge has at most k bends and edges cross only at right angles. A graph is k-bend RAC if it has a k -bend RAC drawing. A 0-bend RAC graph (drawing) is also called a straight-line RAC graph (drawing) . The relationships between 1-planar and k -bend RAC graphs have been partially studied in the literature. It is known that there are both 1-planar graphs that are not straight-line RAC and straight-line RAC graphs that are not 1-planar. The existence of 1-planar straight-line RAC drawings has been proven only for restricted families of 1-planar graphs. Two of the main questions still open are: ( i ) What is the complexity of deciding whether a graph has a drawing that is both 1-planar and straight-line RAC? ( i i ) Does every 1-planar graph have a drawing that is both 1-planar and 1-bend RAC? In this paper we answer these two questions. Namely, we prove an NP-hardness result for the first question, and we positively answer the second question by describing a drawing algorithm for 1-planar graphs.

On Guarding Orthogonal Polygons with Sliding Cameras

A sliding camera inside an orthogonal polygon

Guarding monotone art galleries with sliding cameras in linear time

P

1-Bend RAC Drawings of 1-Planar Graphs

is a point guard that travels back and forth along an orthogonal line segment

Approximating Domination on Intersection Graphs of Paths on a Grid

gamma

Computing conforming partitions of orthogonal polygons with minimum stabbing number

in

Boundary Labeling for Rectangular Diagrams

P

Guarding Orthogonal Art Galleries with Sliding k-Transmitters: Hardness and Approximation

. The sliding camera

Grid-Obstacle Representations with Connections to Staircase Guarding.

g

Approximating Weighted Duo-Preservation in Comparative Genomics

can see a point