( en | de | ru )

 

Disambiguation of "Williamson, Matthew D."

Author of the publication

copydeleteadd this publication to your clipboard
A new algorithm for the minimum spanning tree verification problem.

, and . Comput. Optim. Appl., 61 (1): 189-204 (2015)

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.

Matthew D Hockenos

Daniel Williamson

Elke Williamson

Adam Williamson

Adam Williamson

 

Other publications of authors with the same name

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem., , and . J. Graph Algorithms Appl., 21 (2): 177-181 (2017)A Parallel Implementation for the Negative Cost Girth Problem., and . Int. J. Parallel Program., 43 (2): 240-259 (2015)Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem., , and . Algorithmica, 74 (1): 270-325 (2016)Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints., , and . Discret. Appl. Math., (2021)On the analysis of optimization problems in arc-dependent networks., , and . Discret. Optim., (2022)Corrigendum to Ön the negative cost girth problem in planar networks" Journal of Discrete Algorithms 35 (2015) 40-50., and . J. Discrete Algorithms, (2016)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)A new algorithm for the minimum spanning tree verification problem., and . Comput. Optim. Appl., 61 (1): 189-204 (2015)On approximating optimal weight "no"-certificates in weighted difference constraint systems., , , and . J. Comb. Optim., 36 (2): 329-345 (2018)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)