The following pages link to Klaus-Tycho Foerster (Q343922):
Displaying 13 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
- Conic formation in presence of faulty robots (Q2037836) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
- Local Fast Segment Rerouting on Hypercubes (Q5091084) (← links)
- Does Preprocessing Help under Congestion? (Q5145217) (← links)
- Approximating Fault-Tolerant Domination in General Graphs (Q5194735) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5916001) (← links)
- Walking through waypoints (Q5918830) (← links)
- Walking through waypoints (Q5919407) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Brief announcement: What can(not) be perfectly rerouted locally (Q6535045) (← links)
