Thomas R. Cameron

According to our database, Thomas R. Cameron authored at least 6 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters.

Thomas R. Cameron, Jonad Pulaj

CoRR, August, 2025

On the Number of Minimal Forts of a Graph.

Paul Becker, Thomas R. Cameron, Derek Hanely, Boon Ong, Joseph P. Previte

Graphs Comb., February, 2025

2021

On the Linear Ordering Problem and the Rankability of Data.

Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj

CoRR, 2021

2020

Diameter Polytopes of Feasible Binary Programs.

Thomas R. Cameron, Sebastian Charmot, Jonad Pulaj

CoRR, 2020

2019

The Determinant from Signed Volume to the Laplace Expansion.

Thomas R. Cameron

Am. Math. Mon., 2019

An effective implementation of a modified Laguerre method for the roots of a polynomial.

Thomas R. Cameron

Numer. Algorithms, 2019