Matthew D. Williamson

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