1 citations · 1 across the 1 of their papers we have counts for
4 papers
On digraphs with polygonal restricted numerical range
Thomas R. Cameron, H. Tracy Hall, Ben Small +1
In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In…
On the Linear Ordering Problem and the Rankability of Data
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
In 2019, Anderson et al. proposed the concept of rankability, which refers to a dataset's inherent ability to be meaningfully ranked. In this article, we give an expository review…
Diameter Polytopes of Feasible Binary Programs
Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj
Feasible binary programs often have multiple optimal solutions, which is of interest in applications as they allow the user to choose between alternative optima without deteriorati…
On the Graph Laplacian and the Rankability of Data
Thomas R. Cameron, Amy N. Langville, Heather C. Smith
Recently, Anderson et al. (2019) proposed the concept of rankability, which refers to a dataset's inherent ability to produce a meaningful ranking of its items. In the same paper,…