Wen Chean Teh

From MaRDI portal
Person:266263

Available identifiers

zbMath Open teh.wen-cheanMaRDI QIDQ266263

List of research outcomes





PublicationDate of PublicationType
Properties of locally semi-compact Ir-topological groups2024-09-26Paper
Ranks of compositionally closed minimal reaction systems2024-07-15Paper
Very short note on burning trees with sufficiently long arms2024-06-17Paper
Counting subwords in circular words and their Parikh matrices2024-01-08Paper
The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction2023-05-08Paper
https://portal.mardi4nfdi.de/entity/Q58836422023-03-22Paper
Burnability of double spiders and path forests2022-11-16Paper
https://portal.mardi4nfdi.de/entity/Q50419562022-10-18Paper
Burnability of Double Spiders and Path Forests2022-07-27Paper
A linear time algorithm for connected \(p\)-centdian problem on block graphs2022-06-13Paper
Evolvability of reaction systems and the invisibility theorem2022-06-13Paper
The connected p-median problem on complete multi-layered graphs2022-06-10Paper
Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles2022-02-21Paper
Erasure and error correcting ability of Parikh matrices2021-12-14Paper
Freeness Problem for Matrix Semigroups of Parikh Matrices2021-11-15Paper
Simulation of reaction systems by the strictly minimal ones2021-09-14Paper
Parikh Motivated Study on Repetitions in Words2021-09-03Paper
Ranks of strictly minimal reaction systems induced by permutations2021-06-23Paper
An exponential Diophantine equation related to powers of three consecutive Fibonacci numbers2021-04-27Paper
A New Study of Parikh Matrices Restricted to Terms2021-04-19Paper
Graph burning: tight bounds on the burning numbers of path forests and spiders2021-03-12Paper
A Ramsey Algebraic Study of Matrices2020-10-28Paper
\(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited2020-06-09Paper
Parikh word representability of bipartite permutation graphs2020-06-05Paper
https://portal.mardi4nfdi.de/entity/Q51090612020-05-07Paper
https://portal.mardi4nfdi.de/entity/Q52085812020-01-08Paper
Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence2019-12-10Paper
https://portal.mardi4nfdi.de/entity/Q52441012019-11-20Paper
Parikh determinants2019-11-06Paper
Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders2019-10-10Paper
Parikh matrices for powers of words2019-08-13Paper
Compositions of Functions and Permutations Specified by Minimal Reaction Systems2019-06-24Paper
Elementary matrix equivalence and core transformation graphs for Parikh matrices2018-12-03Paper
Order of weak \(M\)-relation and Parikh matrices2018-08-23Paper
Ramsey Orderly Algebras as a New Approach to Ramsey Algebras2018-06-14Paper
On M-Equivalence and Strong M-Equivalence for Parikh Matrices2018-05-14Paper
Heterogeneous Ramsey algebras and classification of Ramsey vector spaces2018-04-25Paper
On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices2018-03-12Paper
Role of associativity in Ramsey algebras2018-01-31Paper
Parikh Matrices and Parikh Rewriting Systems2017-07-28Paper
Minimal Reaction Systems Revisited and Reaction System Rank2017-06-20Paper
Are Ramsey Algebras Essentially Semigroups2017-03-28Paper
Ramsey algebras and formal orderly terms2017-02-17Paper
Irreducible reaction systems and reaction system rank2017-02-14Paper
Ramsey algebras and strongly reductible ultrafilters2017-01-10Paper
A New Operator over Parikh Languages2016-12-14Paper
Parikh matrices and strong \(M\)-equivalence2016-11-18Paper
Separability of \(M\)-equivalent words by morphisms2016-05-18Paper
Ramsey algebras and the existence of idempotent ultrafilters2016-05-13Paper
On a conjecture about Parikh matrices2016-04-13Paper
On Core Words and the Parikh Matrix Mapping2015-05-19Paper
Core words and Parikh matrices2015-04-29Paper
Ramsey algebras and strongly reductible ultrafilters2014-11-19Paper
A Note on Graph Burning of Path ForestsN/APaper

Research outcomes over time

This page was built for person: Wen Chean Teh