| Double Roman domination in trees |
17 |
| Low rate cloud DDoS attack defense method based on power spectral density analysis |
10 |
| Degree conditions for fractional (a, b, k)-critical covered graphs |
9 |
| Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection |
8 |
| Leakage-resilient CCA2-secure certificateless public-key encryption scheme without bilinear pairing |
7 |
| The imprecisions of precision measures in process mining |
6 |
| Feature weighting as a tool for unsupervised feature selection |
6 |
| STREAM VBYTE: Faster byte-oriented integer compression |
5 |
| Translation and scale invariants of Krawtchouk moments |
5 |
| Revisiting AES related-key differential attacks with constraint programming |
5 |
| Single machine lot scheduling to minimize the total weighted (discounted) completion time |
5 |
| Improved Zhang neural network with finite-time convergence for time-varying linear system of equations solving |
5 |
| A generalization of orthogonal factorizations in digraphs |
4 |
| rDAN: Toward robust demand-aware network designs |
4 |
| Thorup-Zwick emulators are universally optimal hopsets |
4 |
| Nonlinear gradient neural network for solving system of linear equations |
4 |
| An improved FPT algorithm for Almost Forest Deletion problem |
4 |
| Dynamic threshold based information leaker identification scheme |
4 |
| On the analysis of Bloom filters |
4 |
| Some results on the inverse sum indeg index of a graph |
4 |
| Extremal problems on weak Roman domination number |
4 |
| A degree condition for fractional [a, b]-covered graphs |
4 |
| Greedy can beat pure dynamic programming |
3 |
| Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes |
3 |
| A novel disparity transformation algorithm for road segmentation |
3 |
| A scalable model for building context-aware applications for noncommunicable diseases prevention |
3 |
| Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2) |
3 |
| Fast intra prediction method by adaptive number of candidate modes for RDO in HEVC |
3 |
| Independent feedback vertex sets for graphs of bounded diameter |
2 |
| A note on monotone real circuits |
2 |
| An improved algorithm for computing a shortest watchman route for lines |
2 |
| A risk-reward model with compound interest rate for non-additive two-option ski rental |
2 |
| On the hardness of finding the geodetic number of a subcubic graph |
2 |
| Unifying theories of time with generalised reactive processes |
2 |
| Approximation algorithms for color spanning diameter |
2 |
| Differential-linear and related key cryptanalysis of round-reduced scream |
2 |
| The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes |
2 |
| Edge-disjoint Hamiltonian cycles of balanced hypercubes |
2 |
| Paths between colourings of graphs with bounded tree-width |
2 |
| Notes on complexity of packing coloring |
2 |
| A hardness result and new algorithm for the longest common palindromic subsequence problem |
2 |
| Line segment covering of cells in arrangements |
2 |
| Use of logical models for proving infeasibility in term rewriting |
2 |
| Long directed (s, t)-path: FPT algorithm |
2 |
| New quantum codes constructed from some self-dual additive F-4-codes |
2 |
| Classification between natural and graphics images based on generalized Gaussian distributions |
2 |
| Improving the diameters of completely independent spanning trees in locally twisted cubes |
2 |
| A fast algorithm for all-pairs Hamming distances |
1 |
| Pairs of majority-decomposing functions |
1 |
| On fan-crossing and fan-crossing free graphs |
1 |
