Austin Buchanan

Available identifiers

zbMath Open buchanan.austinMaRDI QIDQ479212

List of research outcomes

Publication	Date of Publication	Type
Linear-size formulations for connected planar graph partitioning and political districting	2024-01-22	Paper
On Fault-Tolerant Low-Diameter Clusters in Graphs	2023-01-11	Paper
Political districting to minimize cut edges	2022-11-24	Paper
Continuous cubic formulations for cluster detection problems in networks	2022-11-14	Paper
Worst-case analysis of clique MIPs	2022-10-24	Paper
Solving the Distance-Based Critical Node Problem	2022-07-01	Paper
Imposing Contiguity Constraints in Political Districting Models	2022-05-31	Paper
The Optimal Design of Low-Latency Virtual Backbones	2021-02-01	Paper
Parsimonious formulations for low-diameter clusters	2021-01-25	Paper
Why Is Maximum Clique Often Easy in Practice?	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5379093	2019-05-28	Paper
A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”	2019-03-06	Paper
Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph	2018-10-04	Paper
Extended formulations for vertex cover	2018-10-02	Paper
On provably best construction heuristics for hard combinatorial optimization problems	2018-05-11	Paper
On imposing connectivity constraints in integer programs	2017-12-01	Paper
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks	2015-09-11	Paper
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets	2015-09-11	Paper
On connected dominating sets of restricted diameter	2015-07-29	Paper
Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs	2014-12-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Austin Buchanan