Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

A rough set method for the minimum vertex cover problem of graphs
Jinkun Chen, Yaojin Lin, Jinjin Li, et al.
Applied Soft Computing (2016) Vol. 42, pp. 360-367
Closed Access | Times Cited: 25

Showing 25 citing articles:

Rough neighborhood graph: A method for proximity modeling and data clustering
Tomasz Hachaj, Jarosław Wąs
Applied Soft Computing (2025), pp. 112789-112789
Closed Access | Times Cited: 1
A graph approach for fuzzy-rough feature selection
Jinkun Chen, Ju‐Sheng Mi, Yaojin Lin
Fuzzy Sets and Systems (2019) Vol. 391, pp. 96-116
Closed Access | Times Cited: 74
Symmetry-based granulation in networks associated with commutative rings: application in social network dynamics
Imran Javaid, Abeer Fatima, Muhammad Akram
Journal of Applied Mathematics and Computing (2025)
Closed Access
An efficient local search framework for the minimum weighted vertex cover problem
Ruizhi Li, Shuli Hu, Haochen Zhang, et al.
Information Sciences (2016) Vol. 372, pp. 428-445
Closed Access | Times Cited: 42
Attribute reduction in incomplete ordered information systems with fuzzy decision
Wenbin Qian, Wenhao Shu
Applied Soft Computing (2018) Vol. 73, pp. 242-253
Closed Access | Times Cited: 37
Game-Based Memetic Algorithm to the Vertex Cover of Networks
Jianshe Wu, Xing Shen, Kui Jiao
IEEE Transactions on Cybernetics (2018) Vol. 49, Iss. 3, pp. 974-988
Open Access | Times Cited: 26
Test-cost-sensitive rough set based approach for minimum weight vertex cover problem
Xiaojun Xie, Xiaolin Qin, Chunqiang Yu, et al.
Applied Soft Computing (2017) Vol. 64, pp. 423-435
Closed Access | Times Cited: 24
A graph approach for knowledge reduction in formal contexts
Jinkun Chen, Ju‐Sheng Mi, Yaojin Lin
Knowledge-Based Systems (2018) Vol. 148, pp. 177-188
Closed Access | Times Cited: 23
Finding strongly connected components of simple digraphs based on generalized rough sets theory
Taihua Xu, Guoyin Wang
Knowledge-Based Systems (2018) Vol. 149, pp. 88-98
Closed Access | Times Cited: 15
A heuristic approximation algorithm of minimum dominating set based on rough set theory
Lihe Guan, Hong Wang
Journal of Combinatorial Optimization (2022) Vol. 44, Iss. 1, pp. 752-769
Closed Access | Times Cited: 6
Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets
Qian Zhou, Xiaolin Qin, Xiaojun Xie
IEEE Access (2018) Vol. 6, pp. 50142-50153
Open Access | Times Cited: 5
A graph theoretical approach for node covering in tree based architectures and its application to bioinformatics
D. Angel
Network Modeling Analysis in Health Informatics and Bioinformatics (2019) Vol. 8, Iss. 1
Closed Access | Times Cited: 5
Matrix approach to spanning matroids of rough sets and its application to attribute reduction
Lirun Su, Fusheng Yu
Theoretical Computer Science (2021) Vol. 893, pp. 105-116
Closed Access | Times Cited: 5
On temperature soft sensor model of rotary kiln burning zone based on RS-LSSVM
Yukun Wang, Xuebo Chen
(2017) Vol. 12, pp. 9643-9646
Closed Access | Times Cited: 4
A novel rough set-based approach for minimum vertex cover of hypergraphs
Qian Zhou, Xiaojun Xie, Hua Dai, et al.
Neural Computing and Applications (2022) Vol. 34, Iss. 24, pp. 21793-21808
Closed Access | Times Cited: 3
A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
Shengyang Zhuang, Degang Chen
International Journal of Machine Learning and Cybernetics (2019) Vol. 10, Iss. 12, pp. 3467-3474
Closed Access | Times Cited: 3
Finding Optimal Rough Set Reduct with A* Search Algorithm
Abhimanyu Bar, Anil Kumar, P. S. V. S. Sai Prasad
Lecture notes in computer science (2019), pp. 317-327
Closed Access | Times Cited: 3
On Covering the Nodes of Circulant Networks and Its Applications
D. Angel, A. Amutha
Wireless Personal Communications (2016) Vol. 94, Iss. 4, pp. 2163-2172
Closed Access | Times Cited: 2
NEW CLASS OF SOFT LINEAR ALGEBRAIC CODES AND THEIR PROPERTIES USING SOFT SETS
Florentín Smarandache
(2016)
Closed Access | Times Cited: 1
Vertex Cover Optimization Using a Novel Graph Decomposition Approach
Abdul Manan, Shahida Bashir, Abdul Majid
Computers, materials & continua/Computers, materials & continua (Print) (2022) Vol. 73, Iss. 1, pp. 701-717
Open Access | Times Cited: 1
Mining subgraph coverage patterns from graph transactions
A. Srinivas Reddy, P. Krishna Reddy, Anirban Mondal, et al.
International Journal of Data Science and Analytics (2021) Vol. 13, Iss. 2, pp. 105-121
Open Access | Times Cited: 1
Rough-Set-Based Decision Model for Incomplete Information Systems
Safìye Turgay, Orhan Torkul, T. Turgay
IGI Global eBooks (2017), pp. 2200-2212
Closed Access
An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem
T. Jayanth Kumar, Purusotham Singamsetty
Trends in mathematics (2018), pp. 281-289
Closed Access
Rough-Set-Based Decision Model for Incomplete Information Systems
Safìye Turgay, Orhan Torkul, T. Turgay
Advances in logistics, operations, and management science book series (2018), pp. 748-763
Closed Access
Rough set analysis of graphs
Sha Qiao, Ping Zhu, Witold Pedrycz
Filomat (2022) Vol. 36, Iss. 10, pp. 3331-3354
Open Access
Page 1

Scroll to top