8 citations · 13 across the 7 of their papers we have counts for
11 papers
On Kernels and Leaves: Searching for Bare and Lush Trees
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
We study a variation of the classical Maximum (Minimum) Leaf Spanning Tree problem. In many applications, Depth-First Search (DFS) is used to compute a spanning tree of a graph. Su…
Breadth-First Search Trees with Many or Few Leaves
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
The Maximum (Minimum) Leaf Spanning Tree problem asks for a spanning tree with the largest (smallest) number of leaves. As spanning trees are often computed using graph search algo…
Sandwich Monotonicity and Recognition of Weighted Graph Classes
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler +5
Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is, graphs obtained from…
On the Price of Anarchy in Packet Routing Games with FIFO
Daniel Schmand, Torben Schürenberg, Martin Strehler
We investigate packet routing games in which network users selfishly route themselves through a network over discrete time, aiming to reach the destination as quickly as possible.…
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…
Linear Time LexDFS on Chordal Graphs
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1
Lexicographic Depth First Search (LexDFS) is a special variant of a Depth First Search (DFS), which was introduced by Corneil and Krueger in 2008. While this search has been used i…