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:

Rough Set Characterization for 2-circuit Matroid
Shiping Wang, Qingxin Zhu, William Zhu, et al.
Fundamenta Informaticae (2014) Vol. 129, Iss. 4, pp. 377-393
Closed Access | Times Cited: 11

Showing 11 citing articles:

Rough sets and matroids from a lattice-theoretic viewpoint
Xiaonan Li, Huangjian Yi, Sanyang Liu
Information Sciences (2016) Vol. 342, pp. 37-52
Closed Access | Times Cited: 47

Nullity-based matroid of rough sets and its application to attribute reduction
Aiping Huang, Hong Zhao, William Zhu
Information Sciences (2013) Vol. 263, pp. 153-165
Closed Access | Times Cited: 28

Micro and macro models of granular computing induced by the indiscernibility relation
Cinzia Bisi, Giampiero Chiaselotti, Davide Ciucci, et al.
Information Sciences (2017) Vol. 388-389, pp. 247-273
Open Access | Times Cited: 26

The granular partition lattice of an information table
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Information Sciences (2016) Vol. 373, pp. 57-78
Closed Access | Times Cited: 22

Rough Set Theory and Digraphs
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Fundamenta Informaticae (2017) Vol. 153, Iss. 4, pp. 291-325
Closed Access | Times Cited: 19

Back to the Beginnings: Pawlak’s Definitions of the Terms Information System and Rough Set
Davide Ciucci
Studies in computational intelligence (2017), pp. 225-235
Closed Access | Times Cited: 12

Approximation via a double-matroid structure
Xiaonan Li, Huangjian Yi, Zhaohao Wang
Soft Computing (2019) Vol. 23, Iss. 17, pp. 7557-7568
Closed Access | Times Cited: 11

Approximation of simplicial complexes using matroids and rough sets
Abd El Fattah El Atik
Soft Computing (2023) Vol. 27, Iss. 5, pp. 2217-2229
Open Access | Times Cited: 3

Rough action on topological rough groups
Alaa Altassan, Nof Alharbi, Hassen Aydi, et al.
Applied General Topology (2020) Vol. 21, Iss. 2, pp. 295-295
Open Access | Times Cited: 6

Indiscernibility structures induced from function sets : Graph and digraph case
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino, et al.
Journal of Discrete Mathematical Sciences and Cryptography (2018) Vol. 21, Iss. 5, pp. 1069-1096
Closed Access | Times Cited: 1

Granular computing on basic digraphs
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
Applicable Analysis and Discrete Mathematics (2022) Vol. 16, Iss. 1, pp. 23-54
Open Access

Page 1

Scroll to top