The following pages link to Martin Strehler (Q2110613):
Displaying 13 items.
- Edge elimination and weighted graph classes (Q2110614) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Equilibria in routing games with edge priorities (Q2190414) (← links)
- Polynomial-time algorithms for special cases of the maximum confluent flow problem (Q2434729) (← links)
- Capacitated Confluent Flows: Complexity and Algorithms (Q3563015) (← links)
- (Q4605947) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- (Q5226833) (← links)
- (Q5240194) (← links)
- The Maximum Flow Problem for Oriented Flows (Q5240225) (← links)
- Optimizing Traffic Signal Timings for Mega Events. (Q5240226) (← links)
- (Q5874479) (← links)
- Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs (Q6174822) (← links)
