121 citations · 153 across the 25 of their papers we have counts for
5 papers · 1 filter
Variants of the Segment Number of a Graph
Yoshio Okamoto, Alexander Ravsky, Alexander Wolff
The \emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. Th…
Linear-Time Recognition of Double-Threshold Graphs
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi +1
A graph is a double-threshold graph if there exist a vertex-weight function and two real numbers s…
Graphs with large total angular resolution
Oswin Aichholzer, Matias Korman, Yoshio Okamoto +4
The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawi…
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest…
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi +4
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus…