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:

Heuristics for Spreading Alarm throughout a Network
Marek Šimon, Ladislav Huraj, Iveta Dirgová Ľuptáková, et al.
Applied Sciences (2019) Vol. 9, Iss. 16, pp. 3269-3269
Open Access | Times Cited: 23

Showing 23 citing articles:

A greedy heuristic for graph burning
Jesús García-Díaz, José Alejandro Cornejo-Acosta, Joel Antonio Trejo-Sánchez
Computing (2025) Vol. 107, Iss. 3
Open Access
Burning Graphs Through Farthest-First Traversal
Jesús García-Díaz, Julio César Pérez-Sansalvador, Lil María Rodríguez-Henríquez, et al.
IEEE Access (2022) Vol. 10, pp. 30395-30404
Open Access | Times Cited: 11
A centrality based genetic algorithm for the graph burning problem
Mahdi Nazeri, Ali Mollahosseini, Iman Izadi
Applied Soft Computing (2023) Vol. 144, pp. 110493-110493
Closed Access | Times Cited: 6
Centrality Measures Based Heuristics for Perfect Awareness Problem in Social Networks
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Lecture notes in computer science (2023), pp. 91-100
Closed Access | Times Cited: 5
Burning Two Worlds: Algorithms for Burning Dense and Tree-like Graphs
Shahin Kamali, Avery Miller, Kenny Zhang
arXiv (Cornell University) (2019)
Open Access | Times Cited: 12
Burning Two Worlds
Shahin Kamali, Avery Miller, Kenny Zhang
Lecture notes in computer science (2020), pp. 113-124
Closed Access | Times Cited: 11
Faster heuristics for graph burning
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Applied Intelligence (2021) Vol. 52, Iss. 2, pp. 1351-1361
Open Access | Times Cited: 10
APX-hardness and approximation for the k-burning number problem
Debajyoti Mondal, Angelin Jemima Rajasingh, N. Parthiban, et al.
Theoretical Computer Science (2022) Vol. 932, pp. 21-30
Open Access | Times Cited: 7
Burning Grids and Intervals
Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal
Lecture notes in computer science (2021), pp. 66-79
Closed Access | Times Cited: 9
Graph Burning: Mathematical Formulations and Optimal Solutions
Jesús García-Díaz, Lil María Rodríguez-Henríquez, Julio César Pérez-Sansalvador, et al.
Mathematics (2022) Vol. 10, Iss. 15, pp. 2777-2777
Open Access | Times Cited: 5
Evaluation of the Level of Reliability in Hazardous Technological Processes
Darja Gabriska
Applied Sciences (2020) Vol. 11, Iss. 1, pp. 134-134
Open Access | Times Cited: 7
Heuristics for Influence Maximization with Tiered Influence and Activation Thresholds
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Communications in computer and information science (2024), pp. 134-148
Closed Access
DASH: A novel method for dynamically selecting key nodes to spread information rapidly under the graph burning model
Qinghan Xue, Jiaqi Song, Xingqin Qi
Physics Letters A (2024) Vol. 528, pp. 130058-130058
Closed Access
How to Burn a Network or Spread Alarm
Marek Šimon, Ladislav Huraj, Iveta Dirgová Ľuptáková, et al.
MENDEL (2019) Vol. 25, Iss. 2, pp. 11-18
Open Access | Times Cited: 3
Self-adaptive coordination for fuel-constrained robot teams with periodic and aperiodic communications
Maksim Kenzin, Igor Bychkov, Nikolai Maksimkin
Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science (2022) Vol. 236, Iss. 17, pp. 9730-9742
Closed Access | Times Cited: 2
Situational awareness for distributed mobile robot teams under limited communication
Maksim Kenzin, Igor Bychkov, Nikolay Maksimkin
(2020)
Open Access | Times Cited: 2
Faster Heuristics for Graph Burning
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 2
Emergency broadcasting strategies for distributed robotic groups under limited communication
Maksim Kenzin, Igor Bychkov, Nikolai Maksimkin
Journal of Physics Conference Series (2021) Vol. 1864, Iss. 1, pp. 012043-012043
Open Access | Times Cited: 1
The contagion number: How fast can a disease spread?
Misty Blessley, Randy Davila, Trevor S. Hale, et al.
Decision Making Applications in Management and Engineering (2023) Vol. 6, Iss. 1, pp. 219-239
Open Access
Burning and w-burning of geometric graphs
Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, et al.
Discrete Applied Mathematics (2023) Vol. 336, pp. 83-98
Closed Access
Selection of activators in finding the burning number
S. Sumathi, G. Hannah Grace
AKCE International Journal of Graphs and Combinatorics (2023) Vol. 20, Iss. 2, pp. 115-119
Open Access
An Independent Cascade Model of Graph Burning
Jiaqi Song, Xingqin Qi, Zhulou Cao
Symmetry (2023) Vol. 15, Iss. 8, pp. 1527-1527
Open Access
Approximation algorithms for the graph burning on cactus and directed trees
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Discrete Mathematics Algorithms and Applications (2023) Vol. 16, Iss. 07
Open Access
Page 1

Scroll to top