Mike Newman

University of Ottawa — Canada

Computer Science · Physical Sciences

7h-index206citations19works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(15), graph theory and CDMA systems(7), Limits and Structures in Graph Theory(4), semigroups and automata theory(4), Graph Labeling and Dimension Problems(3)

Publications19 total

Tree Automata and Pigeonhole Classes of Matroids: II
The Electronic Journal of Combinatorics·2023· 3 citedOpen Access
Tree Automata and Pigeonhole Classes of Matroids: I
Algorithmica·2022· 3 citedOpen Access
Defining Bicircular Matroids in Monadic Logic
The Quarterly Journal of Mathematics·2021· 1 citedOpen Access
Fractal classes of matroids
Advances in Applied Mathematics·2020Open Access
Binary Covering Arrays on Tournaments
The Electronic Journal of Combinatorics·2018· 1 citedOpen Access
Yes, the “missing axiom” of matroid theory is lost forever
Transactions of the American Mathematical Society·2018· 5 citedOpen Access
On the b-chromatic number of cartesian products
Discrete Applied Mathematics·2018· 7 cited
Extending Factorizations of Complete Uniform Hypergraphs
COMBINATORICA·2017· 12 cited
Graph-intersecting set systems and LYM inequalities
Discrete Mathematics·2016
Embedding Factorizations for 3-Uniform Hypergraphs II: $r$-Factorizations into $s$-Factorizations
The Electronic Journal of Combinatorics·2016· 11 citedOpen Access
Bounds on polygons of higher rank numerical ranges
Linear Algebra and its Applications·2015· 1 cited
Obstacles to Decomposition Theorems for Sixth-Root-of-Unity Matroids
Annals of Combinatorics·2015· 1 cited
A note on packing spanning trees in graphs and bases in matroids
arXiv (Cornell University)·2012· 1 citedOpen Access
On packing spanning trees in graphs and bases in matroids
arXiv (Cornell University)·2012Open Access
Vertex-colouring edge-weightings with two edge weights
Discrete Mathematics & Theoretical Computer Science·2012· 21 citedOpen Access
On the asymptotic proportion of connected matroids
European Journal of Combinatorics·2011· 90 cited
Digraphs are $2$-Weight Choosable
The Electronic Journal of Combinatorics·2011· 19 citedOpen Access
On excluded minors for real-representability
Journal of Combinatorial Theory Series B·2009· 30 cited
On the Lovasz O-number of Almost Regular Graphs with Application to Erdos-Renyi Graphs
SSRN Electronic Journal·2006Open Access

Frequent Co-authors

Dillon Mayhew(8), Geoff Whittle(4), Brett Stevens(4), Daryl Funk(3), Mahdad Khatirinejad(2), Reza Naserasr(2), Ben Seamone(2), Amin Bahmanian(2), R. A. Bailey(2), Elizabeth Maltais(2), Lucia Moura(2), Dominic Welsh(1), Chuan Guo(1), Carolyn Chun(1), John Holbrook(1), Nishan Mudalige(1), Rajesh Pereira(1), Etienne de Klerk(1), Dmitrii V. Ṗasechnik(1), Renata Sotirov(1)