On the roots of the node reliability polynomial. - Jason I. Brown; Lucas Mol (Networks, 2016)

On the roots of all-terminal reliability polynomials. - Jason I. Brown; Lucas Mol (Discret. Math., 2017)

A family of formulas with reversal of high avoidability index. - James D. Currie; Lucas Mol; Narad Rampersad (Int. J. Algebra Comput., 2017)

On avoidability of formulas with reversal. - James D. Currie; Lucas Mol; Narad Rampersad (RAIRO Theor. Informatics Appl., 2017)

On the mean connected induced subgraph order of cographs. - Matthew E. Kroeker; Lucas Mol; Ortrud R. Oellermann (Australas. J Comb., 2018)

The shape of node reliability. - Jason I. Brown; Lucas Mol (Discret. Appl. Math., 2018)

On the roots of Wiener polynomials of graphs. - Jason I. Brown; Lucas Mol; Ortrud R. Oellermann (Discret. Math., 2018)

Avoidance bases for formulas with reversal. - James D. Currie; Lucas Mol; Narad Rampersad (Theor. Comput. Sci., 2018)

The Undirected Repetition Threshold. - James D. Currie; Lucas Mol (WORDS, 2019)

Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. - James D. Currie; Lucas Mol; Narad Rampersad (Electron. J. Comb., 2019)

Cobham's Theorem and Automaticity. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit; Manon Stipulanti (Int. J. Found. Comput. Sci., 2019)

Maximizing the mean subtree order. - Lucas Mol; Ortrud R. Oellermann (J. Graph Theory, 2019)

On the mean order of connected induced subgraphs of block graphs. - Kristaps J. Balodis; Lucas Mol; Ortrud R. Oellermann; Matthew E. Kroeker (Australas. J Comb., 2020)

Extremal Overlap-Free and Extremal $ beta$-Free Binary Words. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (Electron. J. Comb., 2020)

Extremal overlap-free and extremal β-free binary words. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (CoRR, 2020)

The threshold dimension of a graph. - Lucas Mol; Matthew J. H. Murphy; Ortrud R. Oellermann (Discret. Appl. Math., 2020)

The repetition threshold for binary rich words. - James D. Currie; Lucas Mol; Narad Rampersad (Discret. Math. Theor. Comput. Sci., 2020)

On the roots of the subtree polynomial. - Jason I. Brown; Lucas Mol (Eur. J. Comb., 2020)

The weak circular repetition threshold over large alphabets. - Lucas Mol; Narad Rampersad (RAIRO Theor. Informatics Appl., 2020)

The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. - James D. Currie; Lucas Mol; Narad Rampersad (J. Integer Seq., 2020)

Lengths of extremal square-free ternary words. - Lucas Mol; Narad Rampersad (Contributions Discret. Math., 2021)

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. - Rocío M. Casablanca; Lucas Mol; Ortrud R. Oellermann (Discret. Appl. Math., 2021)

On the mean subtree order of graphs under edge addition. - Ben Cameron; Lucas Mol (J. Graph Theory, 2021)

Network reliability: Heading out on the highway. - Jason I. Brown; Charles J. Colbourn; Danielle Cox; Christina Graves 001; Lucas Mol (Networks, 2021)

The undirected repetition threshold and undirected pattern avoidance. - James D. Currie; Lucas Mol (Theor. Comput. Sci., 2021)

On the average (edge-)connectivity of minimally k-(edge-)connected graphs. - Lucas Mol; Ortrud R. Oellermann; Vibhav Oswal (Bull. ICA, 2022)

The maximum average connectivity among all orientations of a graph. - Rocío M. Casablanca; Peter Dankelmann; Wayne Goddard; Lucas Mol; Ortrud Oellermann (J. Comb. Optim., 2022)

Dyck Words, Pattern Avoidance, and Automatic Sequences. - Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (WORDS, 2023)

The threshold dimension and irreducible graphs. - Lucas Mol; Matthew J. H. Murphy; Ortrud R. Oellermann (Discuss. Math. Graph Theory, 2023)

Antisquares and Critical Exponents. - Aseem R. Baranwal; James D. Currie; Lucas Mol; Pascal Ochem; Narad Rampersad; Jeffrey O. Shallit (Discret. Math. Theor. Comput. Sci., 2023)

Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers. - James D. Currie; Lucas Mol; Narad Rampersad; Jeffrey O. Shallit (SIAM J. Discret. Math., 2024)

Avoiding Abelian and Additive Powers in Rich Words. - Jonathan Andrade; Lucas Mol (WORDS, 2025)

The Repetition Threshold for Ternary Rich Words. - James D. Currie; Lucas Mol; Jarkko Peltomäki (Electron. J. Comb., 2025)