Matthew D. Williamson

According to our database, Matthew D. Williamson authored at least 17 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Arc-dependent networks: theoretical insights and a computational study.

Alvaro Velasquez, Piotr Wojciechowski, K. Subramani, Matthew D. Williamson

Ann. Oper. Res., July, 2024

2022

On the analysis of optimization problems in arc-dependent networks.

Piotr Wojciechowski, Matthew D. Williamson, K. Subramani

Discret. Optim., 2022

On the Approximability of Path and Cycle Problems in Arc-Dependent Networks.

Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints.

Piotr Wojciechowski, K. Subramani, Matthew D. Williamson

Discret. Appl. Math., 2021

2020

On Finding Shortest Paths in Arc-Dependent Networks.

Piotr Wojciechowski, Matthew D. Williamson, K. Subramani

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Empirical analysis of algorithms for the shortest negative cost cycle problem.

Matthew Anderson, Matthew D. Williamson, K. Subramani

Discret. Appl. Math., 2019

2018

On approximating optimal weight "no"-certificates in weighted difference constraint systems.

Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan

J. Comb. Optim., 2018

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints.

Piotr Wojciechowski, K. Subramani, Matthew D. Williamson

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.

Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.

Pavlos Eirinakis, Matthew D. Williamson, K. Subramani

J. Graph Algorithms Appl., 2017

2016

Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50].

Matthew D. Williamson, K. Subramani

J. Discrete Algorithms, 2016

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem.

Matthew D. Williamson, Pavlos Eirinakis, K. Subramani

Algorithmica, 2016

2015

On the negative cost girth problem in planar networks.

Matthew D. Williamson, K. Subramani

J. Discrete Algorithms, 2015

A Parallel Implementation for the Negative Cost Girth Problem.

Matthew D. Williamson, K. Subramani

Int. J. Parallel Program., 2015

A new algorithm for the minimum spanning tree verification problem.

Matthew D. Williamson, K. Subramani

Comput. Optim. Appl., 2015

2013

Improved algorithms for optimal length resolution refutation in difference constraint systems.

K. Subramani, Matthew D. Williamson, Xiaofeng Gu

Formal Aspects Comput., 2013

2010

A faster algorithm for the single source shortest path problem with few distinct positive lengths.

James B. Orlin, Kamesh Madduri, K. Subramani, Matthew D. Williamson

J. Discrete Algorithms, 2010