| Publication | Date of Publication | Type |
|---|
The undirected optical indices of trees
Journal of Combinatorial Optimization | 2025-03-03 | Paper |
Total colorings of some classes of four regular circulant graphs
AKCE International Journal of Graphs and Combinatorics | 2024-12-10 | Paper |
On total coloring of some classes of regular graphs
Taiwanese Journal of Mathematics | 2022-08-31 | Paper |
On total coloring of some classes of regular graphs
Taiwanese Journal of Mathematics | 2022-08-31 | Paper |
Adjacent vertex distinguishing total coloring in split graphs
Discrete Mathematics | 2022-08-24 | Paper |
On ascending subgraph decomposition of graphs
Journal of Discrete Mathematical Sciences and Cryptography | 2022-04-19 | Paper |
On m-cycle holey systems
Journal of Discrete Mathematical Sciences and Cryptography | 2022-04-19 | Paper |
Total colorings of circulant graphs
Discrete Mathematics, Algorithms and Applications | 2022-02-01 | Paper |
| Total Colorings of Some Classes of FourRegular Circulant Graphs | 2021-10-29 | Paper |
Quaternary splitting algorithm in group testing
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
The integer \(\{k\}\)-domination number of circulant graphs
Discrete Mathematics, Algorithms and Applications | 2021-04-09 | Paper |
Strongly separable matrices for nonadaptive combinatorial group testing
Discrete Applied Mathematics | 2021-03-25 | Paper |
Hamiltonicity in prime sum graphs
Graphs and Combinatorics | 2021-03-17 | Paper |
The undirected optical indices of complete \(m\)-ary trees
Discrete Applied Mathematics | 2020-08-31 | Paper |
| Beyond Hamiltonicity of Prime Difference Graphs | 2020-03-02 | Paper |
Transversals in \(m \times n\) arrays
Journal of Statistical Theory and Practice | 2019-08-27 | Paper |
Pack graphs with subgraphs of size three
Taiwanese Journal of Mathematics | 2018-10-25 | Paper |
| The Undirected Optical Indices of Trees | 2018-08-28 | Paper |
On the number of rainbow spanning trees in edge-colored complete graphs
Discrete Mathematics | 2018-06-07 | Paper |
| From a Consequence of Bertrand's Postulate to Hamilton Cycles | 2018-04-19 | Paper |
| scientific article; zbMATH DE number 6843283 (Why is no real title available?) | 2018-02-23 | Paper |
Learning a hidden uniform hypergraph
Optimization Letters | 2018-02-09 | Paper |
New bounds on the decycling number of generalized de Bruijn digraphs
Discrete Mathematics, Algorithms and Applications | 2017-11-29 | Paper |
The Global Packing Number of a Fat-Tree Network
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
Discrete Applied Mathematics | 2017-10-17 | Paper |
Optimal Conflict-Avoiding Codes of Even Length and Weight 3
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Errata to “Optimal Conflict-Avoiding Codes of Even Length and Weight 3” [Nov 10 5747-5756]
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Codes with the identifiable parent property for multimedia fingerprinting
Designs, Codes and Cryptography | 2017-03-23 | Paper |
Multicolored isomorphic spanning trees in complete graphs.
Ars Combinatoria | 2016-10-06 | Paper |
The absorbant number of generalized de Bruijn digraphs.
Ars Combinatoria | 2016-05-04 | Paper |
Partially user-irrepressible sequence sets and conflict-avoiding codes
Designs, Codes and Cryptography | 2016-03-09 | Paper |
The Hamilton-Waterloo problem for triangle-factors and heptagon-factors
Graphs and Combinatorics | 2016-03-02 | Paper |
Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
Designs, Codes and Cryptography | 2015-09-29 | Paper |
New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
Information Sciences | 2015-09-23 | Paper |
New bounds on \(\bar{2}\)-separable codes of length 2
Designs, Codes and Cryptography | 2015-01-23 | Paper |
On the decycling number of generalized Kautz digraphs
Information Processing Letters | 2014-12-09 | Paper |
Learning a hidden graph
Optimization Letters | 2014-12-05 | Paper |
The decycling number of P_m P^_n
Discrete Mathematics, Algorithms and Applications | 2014-09-29 | Paper |
The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
Designs, Codes and Cryptography | 2014-08-01 | Paper |
| A complete solution to the existence problem for cyclically 2-resolvable 4-cycle systems of the complete multipartite graph | 2014-07-25 | Paper |
Optimal conflict-avoiding codes of odd length and weight three
Designs, Codes and Cryptography | 2014-06-27 | Paper |
Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles
Utilitas Mathematica | 2013-09-26 | Paper |
On the diameter of the generalized undirected de Bruijn graphs.
Ars Combinatoria | 2013-09-09 | Paper |
A note on optimal pebbling of hypercubes
Journal of Combinatorial Optimization | 2013-06-13 | Paper |
The decycling number of outerplanar graphs
Journal of Combinatorial Optimization | 2013-06-13 | Paper |
Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
Journal of Combinatorial Designs | 2013-06-13 | Paper |
Group Testing with Multiple Mutually-Obscuring Positives
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Feedback vertex set on planar graphs
Taiwanese Journal of Mathematics | 2013-02-21 | Paper |
The Hamilton-Waterloo problem for Hamilton cycles and \(C_{4k}\)-factors.
(available as arXiv preprint) | 2012-10-12 | Paper |
\((4, 5)\)-cycle systems of complete multipartite graphs
Taiwanese Journal of Mathematics | 2012-08-01 | Paper |
Embeddings of maximum packings of triples.
Ars Combinatoria | 2012-04-03 | Paper |
Graphs with isomorphic neighbor-subgraphs
Taiwanese Journal of Mathematics | 2011-12-19 | Paper |
Reconstruction of hidden graphs and threshold group testing
Journal of Combinatorial Optimization | 2011-09-27 | Paper |
| Maximum packing of D_t-P and D_t P with Mendelsohn triples | 2011-06-29 | Paper |
Sparseness of 4-cycle systems
(available as arXiv preprint) | 2011-05-31 | Paper |
The Existence of $r\times4$ Grid-Block Designs with $r=3,4$
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
On near relative prime number in a sequence of positive integers
Taiwanese Journal of Mathematics | 2010-05-14 | Paper |
Linear 2-arboricity of the complete graph
Taiwanese Journal of Mathematics | 2010-05-14 | Paper |
Covering graphs with matchings of fixed size
Discrete Mathematics | 2010-03-29 | Paper |
The excessive [3]-index of all graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
The excessive [3]-index of all graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Minimizing SONET adms in unidirectional WDM rings with grooming ratio seven
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
On the largest eigenvalues of bipartite graphs which are nearly complete
Linear Algebra and its Applications | 2009-12-18 | Paper |
Excessive near 1-factorizations
Discrete Mathematics | 2009-12-15 | Paper |
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves
Discrete Mathematics | 2009-12-15 | Paper |
Multicolored parallelisms of Hamiltonian cycles
Discrete Mathematics | 2009-12-15 | Paper |
Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
Designs, Codes and Cryptography | 2009-10-14 | Paper |
The optimal pebbling number of the caterpillar
Taiwanese Journal of Mathematics | 2009-06-30 | Paper |
Nonadaptive algorithms for threshold group testing
Discrete Applied Mathematics | 2009-06-30 | Paper |
The IC-indices of complete bipartite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The IC-indices of complete bipartite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
| scientific article; zbMATH DE number 5492384 (Why is no real title available?) | 2009-01-15 | Paper |
On the diameter of the generalized undirected de Bruijn graphs<i>UG</i><sub><i>B</i></sub>(<i>n</i>,<i>m</i>),<i>n</i><sup>2</sup><<i>m</i>≤<i>n</i><sup>3</sup>
Networks | 2008-12-17 | Paper |
A new construction of \(\bar 3\)-separable matrices via an improved decoding of Macula's construction
Discrete Optimization | 2008-11-19 | Paper |
The Hamilton-Waterloo problem for two even cycles factors
Taiwanese Journal of Mathematics | 2008-09-29 | Paper |
On minimum sets of 1-factors covering a complete multipartite graph
Journal of Graph Theory | 2008-09-04 | Paper |
An upper bound of the number of tests in pooling designs for the error-tolerant complex model
Optimization Letters | 2008-09-04 | Paper |
| A study of total relative displacements of permutations in paths and cycles | 2008-07-21 | Paper |
The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
Discrete Mathematics | 2008-07-11 | Paper |
Maximal sets of Hamilton cycles in \(D_n\)
Discrete Mathematics | 2008-07-11 | Paper |
Maximal sets of Hamilton cycles in \(K_{2p}-F\)
Discrete Mathematics | 2008-05-29 | Paper |
All graphs with maximum degree three whose complements have 4-cycle decompositions
Discrete Mathematics | 2008-05-29 | Paper |
Maximum cyclic 4-cycle packings of the complete multipartite graph
Journal of Combinatorial Optimization | 2008-02-18 | Paper |
Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
Journal of Combinatorial Optimization | 2008-02-18 | Paper |
Near automorphisms of trees with small total relative displacements
Journal of Combinatorial Optimization | 2008-02-18 | Paper |
Wide diameters of de Bruijn graphs
Journal of Combinatorial Optimization | 2008-02-18 | Paper |
Near automorphisms of cycles
Discrete Mathematics | 2008-02-11 | Paper |
Multicolored Parallelisms of Isomorphic Spanning Trees
SIAM Journal on Discrete Mathematics | 2007-09-06 | Paper |
| Linear 3-arboricity of the balanced complete multipartite graphs | 2007-08-20 | Paper |
\(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\)
Graphs and Combinatorics | 2007-05-24 | Paper |
A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
Graphs and Combinatorics | 2007-01-05 | Paper |
\(\alpha\)-labeling number of trees
Discrete Mathematics | 2006-12-14 | Paper |
| All 2-regular leaves of partial 6-cycle systems. | 2006-10-16 | Paper |
A novel use of t-packings to construct d-disjunct matrices
Discrete Applied Mathematics | 2006-08-14 | Paper |
Partition of a set of integers into subsets with prescribed sums
Taiwanese Journal of Mathematics | 2006-06-26 | Paper |
Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
Journal of Combinatorial Designs | 2006-03-24 | Paper |
| scientific article; zbMATH DE number 2230287 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2230288 (Why is no real title available?) | 2005-11-18 | Paper |
On 3-stage Clos networks with different nonblocking requirements on two types of calls
Journal of Combinatorial Optimization | 2005-10-18 | Paper |
| scientific article; zbMATH DE number 2192081 (Why is no real title available?) | 2005-08-04 | Paper |
| scientific article; zbMATH DE number 2192155 (Why is no real title available?) | 2005-08-04 | Paper |
Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
Graphs and Combinatorics | 2005-07-28 | Paper |
| scientific article; zbMATH DE number 2188384 (Why is no real title available?) | 2005-07-26 | Paper |
