Graph Search Trees and the Intermezzo Problem. - Jesse Beisegel; Ekkehard Köhler; Fabienne Ratajczak; Robert Scheffler 001; Martin Strehler 001 (MFCS, 2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths. - Jesse Beisegel; Katharina Klost; Kristin Knorr; Fabienne Ratajczak; Robert Scheffler 001 (CoRR, 2025)

Computing Hamiltonian Paths with Partial Order Restrictions. - Jesse Beisegel; Fabienne Ratajczak; Robert Scheffler 001 (ACM Trans. Comput. Theory, 2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs. - Jesse Beisegel; Katharina Klost; Kristin Knorr; Fabienne Ratajczak; Robert Scheffler 001 (CoRR, 2025)