Austin Buchanan

Orcid: 0000-0003-2999-9666

According to our database1, Austin Buchanan authored at least 21 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Linear-size formulations for connected planar graph partitioning and political districting.
Optim. Lett., January, 2024

2022
Political districting to minimize cut edges.
Math. Program. Comput., 2022

Continuous cubic formulations for cluster detection problems in networks.
Math. Program., 2022

Worst-case analysis of clique MIPs.
Math. Program., 2022

Imposing Contiguity Constraints in Political Districting Models.
Oper. Res., 2022

Solving the Distance-Based Critical Node Problem.
INFORMS J. Comput., 2022

On Fault-Tolerant Low-Diameter Clusters in Graphs.
INFORMS J. Comput., 2022

2021
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching.
IISE Trans., 2021

2020
Parsimonious formulations for low-diameter clusters.
Math. Program. Comput., 2020

Why Is Maximum Clique Often Easy in Practice?
Oper. Res., 2020

The Optimal Design of Low-Latency Virtual Backbones.
INFORMS J. Comput., 2020

2019
A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs".
Networks, 2019

2018
Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph.
Networks, 2018

2017
On imposing connectivity constraints in integer programs.
Math. Program., 2017

2016
Extended formulations for vertex cover.
Oper. Res. Lett., 2016

On provably best construction heuristics for hard combinatorial optimization problems.
Networks, 2016

2015
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks.
INFORMS J. Comput., 2015

An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets.
INFORMS J. Comput., 2015

2014
Using GRASP for the Cover by s-Defective Independent Sets Problem.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

Solving maximum clique in sparse graphs: an O(nm+n2<sup>d/4</sup> algorithm for d-degenerate graphs.
Optim. Lett., 2014

On connected dominating sets of restricted diameter.
Eur. J. Oper. Res., 2014


  Loading...