| An improved linear kernel for complementary maximal strip recovery: Simpler and smaller |
21 |
| Analyzing randomized search heuristics via stochastic domination |
10 |
| Reliability analysis of twisted cubes |
9 |
| Flexible representation representation and manipulation of audio signals on quantum computers |
9 |
| Structure fault tolerance of hypercubes and folded hypercubes |
9 |
| Reliability of (n, k)-star network based on g-extra conditional fault |
9 |
| The g-good-neighbor and g-extra diagnosability of networks |
8 |
| A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks |
8 |
| Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes |
8 |
| A 2k-kernelization algorithm for vertex cover based on crown decomposition |
7 |
| Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes |
6 |
| Provably secure certificate-based encryption with leakage resilience |
6 |
| The extra connectivity, extra conditional diagnosability and t/k-diagnosability of the data center network DCell |
6 |
| The generic construction of continuous leakage-resilient identity-based cryptosystems |
5 |
| A quantum-inspired multimodal sentiment analysis framework |
5 |
| The 4-component connectivity of alternating group networks |
5 |
| Algorand: A secure and efficient distributed ledger |
5 |
| On generalized Lyndon words |
5 |
| Efficient public key encryption with equality test in the standard model |
5 |
| The g-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model |
5 |
| Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks |
5 |
| Evacuating two robots from multiple unknown exits in a circle |
4 |
| On the reliability of alternating group graph-based networks |
4 |
| On the benefits and risks of using fitness sharing for multimodal optimisation |
4 |
| An efficient design for reversible Wallace unsigned multiplier |
4 |
| Tree shift topological entropy |
4 |
| Order of weak M-relation and Parikh matrices |
4 |
| A lattice-based group signature scheme with verifier-local revocation |
4 |
| Super spanning connectivity on WK-recursive networks |
4 |
| FM-index of alignment with gaps |
4 |
| Bounds on the burning numbers of spiders and path-forests |
4 |
| Inverse obnoxious p-median location problems on trees with edge length modifications under different norms |
4 |
| Optimal algorithms for inverse vertex obnoxious center location problems on graphs |
4 |
| Algorithmic aspects of semitotal domination in graphs |
4 |
| On strongly M-unambiguous prints and Serbanuta's conjecture for Parikh matrices |
4 |
| A new technique for compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption |
3 |
| Search for an immobile Hider in a known subset of a network |
3 |
| Identical parallel machine scheduling with time-dependent processing times |
3 |
| Strongly Menger connectedness of data center network and (n, k)-star graph |
3 |
| Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers |
3 |
| Geometric inhomogeneous random graphs |
3 |
| Time-space trade-offs for Lempel-Ziv compressed indexing |
3 |
| Strong matching preclusion number of graphs |
3 |
| The h-extra connectivity of k-ary n-cubes |
3 |
| On scheduling inclined jobs on multiple two-stage flowshops |
3 |
| Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem |
3 |
| When an optimal dominating set with given constraints exists |
3 |
| Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity |
3 |
| Verifying chemical reaction network implementations: A bisimulation approach |
3 |
| Recommending links through influence maximization |
3 |
