• On the Tractability of Optimization Problems on H-Graphs 

      Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent (Journal article; Peer reviewed, 2020)
      For a graph H, a graph G is an H-graph if it is an intersection graph of connected subgraphs of some subdivision of H. H-graphs naturally generalize several important graph classes like interval graphs or circular-arc ...