Jan M. Hochstein

According to our database, Jan M. Hochstein authored at least 3 papers between 2004 and 2007.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2007

Maximale Flüsse in fast-planaren Graphen

Jan M. Hochstein

PhD thesis, 2007

Maximum <i>s-t</i>-flow with <i>k</i> crossings in <i>O</i>(<i>k</i>³<i>n</i> log <i>n</i>) time.

Jan M. Hochstein, Karsten Weihe

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2004

Edge-disjoint routing in plane switch graphs in linear time.

Jan M. Hochstein, Karsten Weihe

J. ACM, 2004