### O-joung Kwon (권오정), Classes of intersection digraphs with good algorithmic properties

Zoom ID: 875 9395 3555 (relay) [CLOSED]An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if $S_v\cap T_v\neq \emptyset$ for every vertex $v$. Compared to well-known undirected …