文章引用情况
1
Geometric inhomogeneous random graphs2
Time-space trade-offs for Lempel-Ziv compressed indexing3
Strong matching preclusion number of graphs4
The h-extra connectivity of k-ary n-cubes5
On scheduling inclined jobs on multiple two-stage flowshops6
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem7
When an optimal dominating set with given constraints exists8
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity9
Verifying chemical reaction network implementations: A bisimulation approach10
Recommending links through influence maximization