
LinearTime Recognition of DoubleThreshold Graphs
A graph G = (V,E) is a doublethreshold graph if there exist a vertexwe...
read it

Variants of the Segment Number of a Graph
The segment number of a planar graph is the smallest number of line segm...
read it

Graphs with large total angular resolution
The total angular resolution of a straightline drawing is the minimum a...
read it

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Motivated by adjacency in perfect matching polytopes, we study the short...
read it

Subgraph Isomorphism on Graph Classes that Exclude a Substructure
We study Subgraph Isomorphism on graph classes defined by a fixed forbid...
read it

Orthogonal and Smooth Orthogonal Layouts of 1Planar Graphs with Low Edge Complexity
While orthogonal drawings have a long history, smooth orthogonal drawing...
read it

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
We study the computation of the diameter and radius under the rectilinea...
read it

Balanced Line Separators of Unit Disk Graphs
We prove a geometric version of the graph separator theorem for the unit...
read it
Yoshio Okamoto
is this you? claim profile