Alex Newcombe

Orcid: 0000-0002-4401-0951

According to our database1, Alex Newcombe authored at least 11 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Best Agent Identification for General Game Playing.
IEEE Access, 2026

2025
Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games.
CoRR, January, 2025

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths.
Proceedings of the 33rd International Symposium on Graph Drawing and Network Visualization, 2025

2024
A Cross-Entropy Approach to the Domination Problem and Its Variants.
Entropy, 2024

Variants of the domination number for flower snarks.
Ars Math. Contemp., 2024

2023
Binary programming formulations for the upper domination problem.
Math. Methods Oper. Res., October, 2023

2022
The secure domination number of Cartesian products of small graphs with paths and cycles.
Discret. Appl. Math., 2022

2020
There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11.
Graphs Comb., 2020

Constructing families of cospectral regular graphs.
Comb. Probab. Comput., 2020

A survey of graphs with known or bounded crossing numbers.
Australas. J Comb., 2020

2019
An effective crossing minimisation heuristic based on star insertion.
J. Graph Algorithms Appl., 2019


  Loading...