default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew D. Williamson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Alvaro Velasquez, Piotr Wojciechowski, K. Subramani
, Matthew D. Williamson:
Arc-dependent networks: theoretical insights and a computational study. Ann. Oper. Res. 338(2): 1101-1126 (2024)- 2022
- [j12]Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On the analysis of optimization problems in arc-dependent networks. Discret. Optim. 45: 100729 (2022) - [c4]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson:
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. CALDAM 2022: 292-304 - 2021
- [j11]Piotr 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: 272-294 (2021) - 2020
- [c3]Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On Finding Shortest Paths in Arc-Dependent Networks. ISCO 2020: 249-260
2010 – 2019
- 2019
- [j10]Matthew Anderson, Matthew D. Williamson, K. Subramani:
Empirical analysis of algorithms for the shortest negative cost cycle problem. Discret. Appl. Math. 253: 167-184 (2019) - 2018
- [j9]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan:
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36(2): 329-345 (2018) - [c2]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski:
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM 2018: 45-58 - [c1]Piotr Wojciechowski, K. Subramani, Matthew D. Williamson:
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. FAW 2018: 300-314 - 2017
- [j8]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): 177-181 (2017) - 2016
- [j7]Matthew D. Williamson, Pavlos Eirinakis, K. Subramani:
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. Algorithmica 74(1): 270-325 (2016) - [j6]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 38-41: 52-53 (2016) - [i1]Pavlos Eirinakis, Matthew D. Williamson, K. Subramani:
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. CoRR abs/1603.08627 (2016) - 2015
- [j5]Matthew D. Williamson, K. Subramani:
A new algorithm for the minimum spanning tree verification problem. Comput. Optim. Appl. 61(1): 189-204 (2015) - [j4]Matthew D. Williamson, K. Subramani:
A Parallel Implementation for the Negative Cost Girth Problem. Int. J. Parallel Program. 43(2): 240-259 (2015) - [j3]Matthew D. Williamson, K. Subramani:
On the negative cost girth problem in planar networks. J. Discrete Algorithms 35: 40-50 (2015) - 2013
- [j2]K. Subramani, Matthew D. Williamson, Xiaofeng Gu:
Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Aspects Comput. 25(2): 319-341 (2013) - 2010
- [j1]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): 189-198 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
