1 citations · 1 across the 6 of their papers we have counts for
1 paper · 2 filters
Hans-Joachim Böckenhauer, Melvin Jahn, Dennis Komm +1
In the Online Delayed Connected H-Node-Deletion Problem, an unweighted graph is revealed vertex by vertex and it must remain free of any induced copies of a specific connected indu…