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 Theory Applied to Simple Undirected Graphs
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Lecture notes in computer science (2015), pp. 423-434
Open Access | Times Cited: 17

Showing 17 citing articles:

Simple graphs in granular computing
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile
Information Sciences (2016) Vol. 340-341, pp. 279-304
Open Access | Times Cited: 49

The adjacency matrix of a graph as a data table: a geometric perspective
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino, et al.
Annali di Matematica Pura ed Applicata (1923 -) (2016) Vol. 196, Iss. 3, pp. 1073-1112
Closed Access | Times Cited: 31

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

Generalizations of Rough Set Tools Inspired by Graph Theory
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Fundamenta Informaticae (2016) Vol. 148, Iss. 1-2, pp. 207-227
Closed Access | Times Cited: 20

Knowledge pairing systems in granular computing
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
Knowledge-Based Systems (2017) Vol. 124, pp. 144-163
Closed Access | Times Cited: 20

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

Finding strongly connected components of simple digraphs based on granulation strategy
Taihua Xu, Guoyin Wang, Jie Yang
International Journal of Approximate Reasoning (2019) Vol. 118, pp. 64-78
Open Access | Times Cited: 16

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

Determining the membership degree by fuzzy hypergraphs
Abdolreza Zarandi Baghini, Hojat Babaei, R. Tabatabaei
Mathematical Foundations of Computing (2024)
Open Access | Times Cited: 1

Dependency structures for decision tables
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
International Journal of Approximate Reasoning (2017) Vol. 88, pp. 333-370
Open Access | Times Cited: 13

Rough Sets for n-Cycles and n-Paths
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino, et al.
Applied Mathematics & Information Sciences (2016) Vol. 10, Iss. 1, pp. 117-124
Closed Access | Times Cited: 12

Preclusivity and Simple Graphs
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Lecture notes in computer science (2015), pp. 127-137
Open Access | Times Cited: 12

Dependency and accuracy measures for directed graphs
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino, et al.
Applied Mathematics and Computation (2017) Vol. 320, pp. 781-794
Closed Access | Times Cited: 8

New Approach Based on Fuzzy Hypergraphs in Granular Computing (An Application to the Urban Vulnerability Assessment)
Abdolreza Zarandi Baghini, Hojjat Babaei, R. Tabatabaei
Research Square (Research Square) (2022)
Open Access | Times Cited: 2

Rough sets in graphs using similarity relations
Imran Javaid, Shahroz Ali, Shahid ur Rehman, et al.
AIMS Mathematics (2022) Vol. 7, Iss. 4, pp. 5790-5807
Open Access | Times Cited: 1

Rough Sets in Graphs Using Similarity Relations.
Imran Javaid, Shahroz Ali, Shahid ur Rehman, et al.
arXiv (Cornell University) (2021)
Closed Access

Page 1

Scroll to top