Matthew D. Williamson

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 13

Top Topics

Top Venues

Discret. Appl. Math.

J. Discrete Algorithms

Ann. Oper. Res.

Publications

Alvaro Velasquez, Piotr Wojciechowski, K. Subramani, Matthew D. Williamson
Arc-dependent networks: theoretical insights and a computational study. Ann. Oper. Res. 338 (2) (2024)
Piotr J. Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. CALDAM (2022)
Piotr Wojciechowski, Matthew D. Williamson, K. Subramani
On the analysis of optimization problems in arc-dependent networks. Discret. Optim. 45 (2022)
Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discret. Appl. Math. 305 (2021)
Piotr J. Wojciechowski, Matthew D. Williamson, K. Subramani
On Finding Shortest Paths in Arc-Dependent Networks. ISCO (2020)
Matthew Anderson, Matthew D. Williamson, K. Subramani
Empirical analysis of algorithms for the shortest negative cost cycle problem. Discret. Appl. Math. 253 (2019)
Bugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr J. Wojciechowski
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM (2018)
Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. FAW (2018)
Bugra Caskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36 (2) (2018)
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. J. Graph Algorithms Appl. 21 (2) (2017)
Matthew D. Williamson, Pavlos Eirinakis, K. Subramani
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. Algorithmica 74 (1) (2016)
Matthew D. Williamson, K. Subramani
Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50]. J. Discrete Algorithms (2016)
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. CoRR (2016)
Matthew D. Williamson, K. Subramani
A new algorithm for the minimum spanning tree verification problem. Comput. Optim. Appl. 61 (1) (2015)
Matthew D. Williamson, K. Subramani
On the negative cost girth problem in planar networks. J. Discrete Algorithms 35 (2015)
Matthew D. Williamson, K. Subramani
A Parallel Implementation for the Negative Cost Girth Problem. Int. J. Parallel Program. 43 (2) (2015)
K. Subramani, Matthew D. Williamson, Xiaofeng Gu
Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Aspects Comput. 25 (2) (2013)
James B. Orlin, Kamesh Madduri, K. Subramani, Matthew D. Williamson
A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms 8 (2) (2010)