PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Williamson, Matthew D."

Author of the publication

copydeleteadd this publication to your clipboard
A faster algorithm for the single source shortest path problem with few distinct positive lengths.

, , , and . J. Discrete Algorithms, 8 (2): 189-198 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

D. Marino

Matthew Joliffe University of Stuttgart

Ph. D. Matthew Millard University of Stuttgart

D. Roth

D. Inkermann

 

Other publications of authors with the same name

A faster algorithm for the single source shortest path problem with few distinct positive lengths., , , and . J. Discrete Algorithms, 8 (2): 189-198 (2010)On the Approximability of Path and Cycle Problems in Arc-Dependent Networks., , , and . CALDAM, volume 13179 of Lecture Notes in Computer Science, page 292-304. Springer, (2022)Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem., , and . Algorithmica, 74 (1): 270-325 (2016)A Parallel Implementation for the Negative Cost Girth Problem., and . International Journal of Parallel Programming, 43 (2): 240-259 (2015)Corrigendum to Ön the negative cost girth problem in planar networks" Journal of Discrete Algorithms 35 (2015) 40-50., and . J. Discrete Algorithms, (2016)A new algorithm for the minimum spanning tree verification problem., and . Comp. Opt. and Appl., 61 (1): 189-204 (2015)A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems., , , , and . CALDAM, volume 10743 of Lecture Notes in Computer Science, page 45-58. Springer, (2018)Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints., , and . FAW, volume 10823 of Lecture Notes in Computer Science, page 300-314. Springer, (2018)On the negative cost girth problem in planar networks., and . J. Discrete Algorithms, (2015)Improved algorithms for optimal length resolution refutation in difference constraint systems., , and . Formal Asp. Comput., 25 (2): 319-341 (2013)