default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAustin Buchanan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Jack Zhang, Hamidreza Validi, Austin Buchanan
, Illya V. Hicks:
Linear-size formulations for connected planar graph partitioning and political districting. Optim. Lett. 18(1): 19-31 (2024)- 2022
- [j19]Hosseinali Salemi, Austin Buchanan:
Solving the Distance-Based Critical Node Problem. INFORMS J. Comput. 34(3): 1309-1326 (2022) - [j18]Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram, Austin Buchanan:
On Fault-Tolerant Low-Diameter Clusters in Graphs. INFORMS J. Comput. 34(6): 3181-3199 (2022) - [j17]Hamidreza Validi, Austin Buchanan, Eugene Lykhovyd:
Imposing Contiguity Constraints in Political Districting Models. Oper. Res. 70(2): 867-892 (2022) - [j16]Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros:
Worst-case analysis of clique MIPs. Math. Program. 195(1): 517-551 (2022) - [j15]Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, Vladimir Boginski:
Continuous cubic formulations for cluster detection problems in networks. Math. Program. 196(1): 279-307 (2022) - [j14]Hamidreza Validi, Austin Buchanan:
Political districting to minimize cut edges. Math. Program. Comput. 14(4): 623-672 (2022) - 2021
- [j13]Babak Farmanesh, Arash Pourhabib, Balabhaskar Balasundaram, Austin Buchanan:
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching. IISE Trans. 53(3): 352-364 (2021) - 2020
- [j12]Hamidreza Validi, Austin Buchanan:
The Optimal Design of Low-Latency Virtual Backbones. INFORMS J. Comput. 32(4): 952-967 (2020) - [j11]Jose L. Walteros, Austin Buchanan:
Why Is Maximum Clique Often Easy in Practice? Oper. Res. 68(6): 1866-1895 (2020) - [j10]Hosseinali Salemi, Austin Buchanan:
Parsimonious formulations for low-diameter clusters. Math. Program. Comput. 12(3): 493-528 (2020)
2010 – 2019
- 2019
- [j9]Hamidreza Validi, Austin Buchanan:
A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs". Networks 73(1): 135-142 (2019) - 2018
- [j8]Austin Buchanan, Yiming Wang, Sergiy Butenko:
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph. Networks 72(2): 238-248 (2018) - 2017
- [j7]Yiming Wang, Austin Buchanan, Sergiy Butenko:
On imposing connectivity constraints in integer programs. Math. Program. 166(1-2): 241-271 (2017) - 2016
- [j6]Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev:
On provably best construction heuristics for hard combinatorial optimization problems. Networks 67(3): 238-245 (2016) - [j5]Austin Buchanan:
Extended formulations for vertex cover. Oper. Res. Lett. 44(3): 374-378 (2016) - 2015
- [j4]Anurag Verma, Austin Buchanan, Sergiy Butenko:
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks. INFORMS J. Comput. 27(1): 164-177 (2015) - [j3]Austin Buchanan, Je Sang Sung, Sergiy Butenko, Eduardo L. Pasiliao:
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets. INFORMS J. Comput. 27(1): 178-188 (2015) - 2014
- [j2]Austin Buchanan, Je Sang Sung, Vladimir Boginski, Sergiy Butenko:
On connected dominating sets of restricted diameter. Eur. J. Oper. Res. 236(2): 410-418 (2014) - [j1]Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos:
Solving maximum clique in sparse graphs: an O(nm+n2d/4 algorithm for d-degenerate graphs. Optim. Lett. 8(5): 1611-1617 (2014) - [p1]Austin Buchanan, Nannan Chen, Xin Ma:
Using GRASP for the Cover by s-Defective Independent Sets Problem. Examining Robustness and Vulnerability of Networked Systems 2014: 17-25
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-07-08 21:30 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:
