Tsai-Lien Wong

According to our database1, Tsai-Lien Wong authored at least 32 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Multiset Combinatorial Gray Codes with Application to Proximity Sensor Networks.
CoRR, 2024

Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes.
CoRR, 2024

Protocol Sequences for Age of Information Under Multiple-Packet Reception.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Mixed-Weight Conflict-Avoiding Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Deterministic Grant-Free Access Based on the Chinese Remainder Theorem.
Proceedings of the IEEE International Conference on Communications, 2023

2021
Total weight choosability for Halin graphs.
Electron. J. Graph Theory Appl., 2021

2-connected chordal graphs and line graphs are (1, 5)-choosable.
Eur. J. Comb., 2021

Colouring of S-labelled planar graphs.
Eur. J. Comb., 2021

2019
Graphs are (1, Δ+1)-choosable.
Discret. Math., 2019

2018
Graphs with maximum average degree less than 114 are (1, 3)-choosable.
Discret. Math., 2018

Total list weighting of graphs with bounded maximum average degree.
Discret. Math., 2018

2017
Total Weight Choosability of Trees.
SIAM J. Discret. Math., 2017

Permanent Index of Matrices Associated with Graphs.
Electron. J. Comb., 2017

On xD-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks.
Electron. J. Comb., 2017

2016
Total Weight Choosability of Cone Graphs.
Graphs Comb., 2016

Every graph is (2, 3)-choosable.
Comb., 2016

2015
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited.
J. Graph Theory, 2015

Circular chromatic indices of even degree regular graphs.
Discret. Math., 2015

The sorting index on colored permutations and even-signed permutations.
Adv. Appl. Math., 2015

2014
Circular Chromatic Indices of Regular Graphs.
J. Graph Theory, 2014

Erratum to "Application of polynomial method to on-line list colouring of graphs" [European J. Combin. 33(2012) 872-883].
Eur. J. Comb., 2014

Anti-magic labeling of trees.
Discret. Math., 2014

2013
Partial Online List Coloring of Graphs.
J. Graph Theory, 2013

2012
Antimagic labelling of vertex weighted graphs.
J. Graph Theory, 2012

Total weight choosability of Cartesian product of graphs.
Eur. J. Comb., 2012

Application of polynomial method to on-line list colouring of graphs.
Eur. J. Comb., 2012

Weighted-1-antimagic graphs of prime power order.
Discret. Math., 2012

2011
Total weight choosability of graphs.
J. Graph Theory, 2011

Distinguishing labeling of the actions of almost simple groups.
Comb., 2011

2009
Distinguishing labeling of group actions.
Discret. Math., 2009

Adaptable chromatic number of graph products.
Discret. Math., 2009

2008
Circular choosability via combinatorial Nullstellensatz.
J. Graph Theory, 2008


  Loading...