| Publication | Date of Publication | Type |
|---|
| Building and Checking Suffix Array Simultaneously by Induced Sorting Method | 2022-08-05 | Paper |
| Notes on the combinatorial game: graph Nim | 2021-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4991638 | 2021-06-03 | Paper |
| Higher-Order Rogue Wave Pairs in the Coupled Cubic-Quintic Nonlinear Schrödinger Equations | 2021-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5206399 | 2019-12-18 | Paper |
| The edge coloring game on trees with the number of colors greater than the game chromatic index | 2019-06-25 | Paper |
| The game chromatic index of trees of maximum degree 4 with at most three degree-four vertices in a row | 2019-04-02 | Paper |
| Fast In-Place Suffix Sorting on a Multicore Computer | 2019-03-07 | Paper |
| Limited resource semiquantum secret sharing | 2018-11-01 | Paper |
| Measurement-device-independent semiquantum key distribution | 2018-09-03 | Paper |
| Application of blind quantum computation to two-party quantum computation | 2018-08-02 | Paper |
| The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices | 2018-07-26 | Paper |
| Checking Big Suffix and LCP Arrays by Probabilistic Methods | 2018-06-27 | Paper |
| A map of the \(P\)-positions in `NIM with a pass' played on heap sizes of at most four | 2018-05-24 | Paper |
| Two Efficient Algorithms for Linear Time Suffix Array Construction | 2017-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5279140 | 2017-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2975370 | 2017-04-11 | Paper |
| Complete forcing numbers of primitive coronoids | 2016-10-20 | Paper |
| Blowup of regular solutions for the relativistic Euler-Poisson equations | 2016-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5262051 | 2015-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2936714 | 2015-01-06 | Paper |
| Computing the inverse sort transform in linear time | 2014-09-09 | Paper |
| The game chromatic index of some trees of maximum degree 4 | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405478 | 2014-04-02 | Paper |
| On the existence of quantum signature for quantum messages | 2014-02-25 | Paper |
| Efficient arbitrated quantum signature and its proof of security | 2013-07-26 | Paper |
| Triangle-free graphs with large independent domination number | 2013-05-31 | Paper |
| Some results on matching and total domination in graphs | 2013-01-31 | Paper |
| On the security of arbitrated quantum signature schemes | 2013-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4903439 | 2013-01-21 | Paper |
| On the adjacent vertex-distinguishing acyclic edge coloring of some graphs | 2012-10-05 | Paper |
| On the impossibility of non-static quantum bit commitment between two parties | 2012-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2883286 | 2012-05-11 | Paper |
| Graphs whose critical groups have larger rank | 2011-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3094526 | 2011-10-25 | Paper |
| On the Laplacian spectral radii of bipartite graphs | 2011-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393534 | 2011-04-18 | Paper |
| Sharing a quantum secret without a trusted party | 2011-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581896 | 2010-09-02 | Paper |
| ENTANGLEMENT ENHANCES THE SECURITY OF ARBITRATED QUANTUM SIGNATURE | 2010-02-01 | Paper |
| On the spectral radius of graphs with connectivity at most \(k\) | 2009-09-02 | Paper |
| Linear Time Suffix Array Construction Using D-Critical Substrings | 2009-07-07 | Paper |
| The Laplacian spectral radius of some graphs | 2009-06-04 | Paper |
| Some results on the Laplacian eigenvalues of unicyclic graphs | 2009-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615949 | 2009-03-24 | Paper |
| Upper bounds on the paired-domination number | 2009-03-04 | Paper |
| Computing Inverse ST in Linear Complexity | 2008-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443193 | 2008-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2716531 | 2001-05-16 | Paper |
