A faster algorithm for the single source shortest path problem with few distinct positive lengths. - James B. Orlin; Kamesh Madduri; K. Subramani 001; Matthew D. Williamson (J. Discrete Algorithms, 2010)

Improved algorithms for optimal length resolution refutation in difference constraint systems. - K. Subramani 001; Matthew D. Williamson; Xiaofeng Gu 002 (Formal Aspects Comput., 2013)

A new algorithm for the minimum spanning tree verification problem. - Matthew D. Williamson; K. Subramani 001 (Comput. Optim. Appl., 2015)

A Parallel Implementation for the Negative Cost Girth Problem. - Matthew D. Williamson; K. Subramani 001 (Int. J. Parallel Program., 2015)

On the negative cost girth problem in planar networks. - Matthew D. Williamson; K. Subramani 001 (J. Discrete Algorithms, 2015)

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. - Matthew D. Williamson; Pavlos Eirinakis; K. Subramani 001 (Algorithmica, 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 001 (J. Discrete Algorithms, 2016)

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. - Pavlos Eirinakis; Matthew D. Williamson; K. Subramani 001 (J. Graph Algorithms Appl., 2017)

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. - Bugra Çaskurlu; Matthew D. Williamson; K. Subramani 001; Vahan Mkrtchyan; Piotr Wojciechowski 002 (CALDAM, 2018)

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. - Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (FAW, 2018)

On approximating optimal weight "no"-certificates in weighted difference constraint systems. - Bugra Çaskurlu; Matthew D. Williamson; K. Subramani 001; Vahan Mkrtchyan (J. Comb. Optim., 2018)

Empirical analysis of algorithms for the shortest negative cost cycle problem. - Matthew Anderson; Matthew D. Williamson; K. Subramani 001 (Discret. Appl. Math., 2019)

On Finding Shortest Paths in Arc-Dependent Networks. - Piotr Wojciechowski 002; Matthew D. Williamson; K. Subramani 001 (ISCO, 2020)

Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. - Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (Discret. Appl. Math., 2021)

On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez; Matthew D. Williamson (CALDAM, 2022)

On the analysis of optimization problems in arc-dependent networks. - Piotr Wojciechowski 002; Matthew D. Williamson; K. Subramani 001 (Discret. Optim., 2022)

Arc-dependent networks: theoretical insights and a computational study. - Alvaro Velasquez; Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (Ann. Oper. Res., 2024)