8 citations · 17 across the 9 of their papers we have counts for
3 papers · 1 filter
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler +3
We propose a novel way of generalizing the class of interval graphs, via a graph width parameter called the simultaneous interval number. This parameter is related to the simultane…
Graph Search Trees and the Intermezzo Problem
Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak +2
The last in-tree recognition problem asks whether a given spanning tree can be derived by connecting each vertex with its rightmost left neighbor of some search ordering. In this s…
Computing Hamiltonian Paths with Partial Order Restrictions
Jesse Beisegel, Fabienne Ratajczak, Robert Scheffler
When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example one could deci…