1. Complexity of maximum cut on interval graphs;Adhikary;Discrete Comput. Geom.,2023
2. The 1-fixed-endpoint path cover problem is polynomial on interval graphs;Asdre;Algorithmica,2010
3. A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs;Asdre;Theor. Comput. Sci.,2010
4. On the end-vertex problem of graph searches;Beisegel;Discrete Math. Theor. Comput. Sci.,2019
5. Linear time LexDFS on chordal graphs;Beisegel,2020