Volker Priebe

According to our database¹, Volker Priebe authored at least 4 papers between 1997 and 2002.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2002

All-pairs shortest-paths computation in the presence of negative cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

Average-case complexity of shortest-paths problems.

[BibT_eX]

[DOI]

Volker Priebe

PhD thesis, 2001

2000

Average-case complexity of shortest-paths problems in the vertex-potential model.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

1997

On the all-pairs shortest-path algorithm of Moffat and Takaoka.

[BibT_eX]

[DOI]

Kurt Mehlhorn

Volker Priebe

Random Struct. Algorithms, 1997

Volker Priebe

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...