default search action
Lucas Mol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i16]Jonathan Andrade, Lucas Mol:
Avoiding abelian and additive powers in rich words. CoRR abs/2408.15390 (2024) - [i15]James D. Currie, Lucas Mol, Jarkko Peltomäki:
The repetition threshold for ternary rich words. CoRR abs/2409.12068 (2024) - 2023
- [j26]Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
:
The threshold dimension and irreducible graphs. Discuss. Math. Graph Theory 43(1): 195-210 (2023) - [c2]Lucas Mol
Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS 2023: 220-232 - [i14]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR abs/2301.06145 (2023) - 2022
- [j25]Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal:
On the average (edge-)connectivity of minimally k-(edge-)connected graphs. Bull. ICA 94: 95-110 (2022) - [j24]Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol
The maximum average connectivity among all orientations of a graph. J. Comb. Optim. 43(3): 543-570 (2022) - [i13]Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit:
Antisquares and Critical Exponents. CoRR abs/2209.09223 (2022) - 2021
- [j23]Lucas Mol, Narad Rampersad:
Lengths of extremal square-free ternary words. Contributions Discret. Math. 16(1): 8-19 (2021) - [j22]Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann:
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. Discret. Appl. Math. 289: 233-247 (2021) - [j21]Ben Cameron
On the mean subtree order of graphs under edge addition. J. Graph Theory 96(3): 403-413 (2021) - [j20]Jason I. Brown
Network reliability: Heading out on the highway. Networks 77(1): 146-160 (2021) - [j19]James D. Currie, Lucas Mol
The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866: 56-69 (2021) - [i12]Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal:
On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs. CoRR abs/2106.04083 (2021) - [i11]James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR abs/2111.07857 (2021) - 2020
- [j18]Kristaps J. Balodis, Lucas Mol, Ortrud R. Oellermann, Matthew E. Kroeker:
On the mean order of connected induced subgraphs of block graphs. Australas. J Comb. 76: 128-148 (2020) - [j17]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. 27(4): 4 (2020) - [j16]Lucas Mol
The threshold dimension of a graph. Discret. Appl. Math. 287: 118-133 (2020) - [j15]James D. Currie, Lucas Mol, Narad Rampersad:
The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [j14]Jason I. Brown
On the roots of the subtree polynomial. Eur. J. Comb. 89: 103181 (2020) - [j13]Lucas Mol, Narad Rampersad:
The weak circular repetition threshold over large alphabets. RAIRO Theor. Informatics Appl. 54: 6 (2020) - [j12]James D. Currie, Lucas Mol, Narad Rampersad:
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. J. Integer Seq. 23(3): 20.3.1 (2020) - [i10]Lucas Mol, Narad Rampersad:
Lengths of extremal square-free ternary words. CoRR abs/2001.11763 (2020) - [i9]Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann:
The Threshold Dimension and Irreducible Graphs. CoRR abs/2002.11048 (2020) - [i8]James D. Currie, Lucas Mol:
The undirected repetition threshold and undirected pattern avoidance. CoRR abs/2006.07474 (2020) - [i7]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit:
Extremal overlap-free and extremal β-free binary words. CoRR abs/2006.10152 (2020)
2010 – 2019
- 2019
- [j11]James D. Currie, Lucas Mol, Narad Rampersad:
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. Electron. J. Comb. 26(2): 2 (2019) - [j10]Lucas Mol
Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. 30(8): 1363-1379 (2019) - [j9]Lucas Mol
Maximizing the mean subtree order. J. Graph Theory 91(4): 326-352 (2019) - [c1]James D. Currie
The Undirected Repetition Threshold. WORDS 2019: 145-158 - [i6]James D. Currie, Lucas Mol:
The undirected repetition threshold. CoRR abs/1904.10029 (2019) - [i5]James D. Currie, Lucas Mol, Narad Rampersad:
The repetition threshold for binary rich words. CoRR abs/1908.03169 (2019) - [i4]James D. Currie, Lucas Mol, Narad Rampersad:
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. CoRR abs/1911.05779 (2019) - [i3]Lucas Mol, Narad Rampersad:
The Weak Circular Repetition Threshold Over Large Alphabets. CoRR abs/1912.11388 (2019) - 2018
- [j8]Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann:
On the mean connected induced subgraph order of cographs. Australas. J Comb. 71: 161- (2018) - [j7]Jason I. Brown
The shape of node reliability. Discret. Appl. Math. 238: 41-55 (2018) - [j6]Jason I. Brown
On the roots of Wiener polynomials of graphs. Discret. Math. 341(9): 2398-2408 (2018) - [j5]James D. Currie, Lucas Mol
Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738: 25-41 (2018) - [i2]James D. Currie, Lucas Mol, Narad Rampersad:
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture. CoRR abs/1803.08145 (2018) - [i1]Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti:
Cobham's Theorem and Automaticity. CoRR abs/1809.00679 (2018) - 2017
- [j4]Jason I. Brown
On the roots of all-terminal reliability polynomials. Discret. Math. 340(6): 1287-1299 (2017) - [j3]James D. Currie, Lucas Mol
A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27(5): 477-493 (2017) - [j2]James D. Currie, Lucas Mol
On avoidability of formulas with reversal. RAIRO Theor. Informatics Appl. 51(4): 181-189 (2017) - 2016
- [j1]Jason I. Brown
On the roots of the node reliability polynomial. Networks 68(3): 238-246 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: