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:

GOT: An Optimal Transport framework for Graph comparison
Hermina Petric Maretić, Mireille El Gheche, Giovanni Chierchia, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 41

Showing 1-25 of 41 citing articles:

Metrics for graph comparison: A practitioner’s guide
Peter R. Wills, François G. Meyer
PLoS ONE (2020) Vol. 15, Iss. 2, pp. e0228728-e0228728
Open Access | Times Cited: 149
FLOT: Scene Flow on Point Clouds Guided by Optimal Transport
Gilles Puy, Alexandre Boulch, Renaud Marlet
Lecture notes in computer science (2020), pp. 527-544
Open Access | Times Cited: 144
Hierarchical Multi-Marginal Optimal Transport for Network Alignment
Zhichen Zeng, Boxin Du, Si Zhang, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2024) Vol. 38, Iss. 15, pp. 16660-16668
Open Access | Times Cited: 6
Computing Approximate Graph Edit Distance via Optimal Transport
Qihao Cheng, Da Yan, Tianhao Wu, et al.
Proceedings of the ACM on Management of Data (2025) Vol. 3, Iss. 1, pp. 1-26
Open Access
Image-to-Image Retrieval by Learning Similarity between Scene Graphs
Sangwoong Yoon, Woo Young Kang, Sungwook Jeon, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2021) Vol. 35, Iss. 12, pp. 10718-10726
Open Access | Times Cited: 26
Unbalanced Optimal Transport, from theory to numerics
Thibault Séjourné, Gabriel Peyré, François-Xavier Vialard
Handbook of numerical analysis (2022), pp. 407-471
Open Access | Times Cited: 16
Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey
Abdelwahed Khamis, Russell Tsuchida, Mohamed Tarek, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence (2024), pp. 1-20
Open Access | Times Cited: 3
VistaScenario: Interaction Scenario Engineering for Vehicles with Intelligent Systems for Transport Automation
Cheng Chang, Jiawei Zhang, Jingwei Ge, et al.
IEEE Transactions on Intelligent Vehicles (2024), pp. 1-17
Closed Access | Times Cited: 3
fGOT: Graph Distances Based on Filters and Optimal Transport
Hermina Petric Maretić, Mireille El Gheche, Giovanni Chierchia, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2022) Vol. 36, Iss. 7, pp. 7710-7718
Open Access | Times Cited: 14
LCS graph kernel based on Wasserstein distance in longest common subsequence metric space
Jianming Huang, Zhongxi Fang, Hiroyuki Kasai
Signal Processing (2021) Vol. 189, pp. 108281-108281
Open Access | Times Cited: 18
Interpretable Graph Similarity Computation via Differentiable Optimal Alignment of Node Embeddings
Khoa D. Doan, Saurav Manchanda, Suchismit Mahapatra, et al.
Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (2021), pp. 665-674
Closed Access | Times Cited: 15
DELFlow: Dense Efficient Learning of Scene Flow for Large-Scale Point Clouds
Chensheng Peng, Guangming Wang, Xian Wan Lo, et al.
2021 IEEE/CVF International Conference on Computer Vision (ICCV) (2023), pp. 16855-16864
Open Access | Times Cited: 6
DGSD: Distributed graph representation via graph statistical properties
Anwar Said, Saeed‐Ul Hassan, Suppawong Tuarob, et al.
Future Generation Computer Systems (2021) Vol. 119, pp. 166-175
Open Access | Times Cited: 13
Deep Learning for Scene Flow Estimation on Point Clouds: A Survey and Prospective Trends
Zhiqi Li, Nan Xiang, Honghua Chen, et al.
Computer Graphics Forum (2023) Vol. 42, Iss. 6
Open Access | Times Cited: 5
Graph Diffusion Wasserstein Distances
Amélie Barbe, Marc Sebban, Paulo Gonçalvès, et al.
Lecture notes in computer science (2021), pp. 577-592
Open Access | Times Cited: 11
A Wasserstein Graph Distance Based on Distributions of Probabilistic Node Embeddings
Michael Scholkemper, Damin Kühn, Gerion Nabbefeld, et al.
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024), pp. 9751-9755
Open Access | Times Cited: 1
Optimal Transport Distances for Directed, Weighted Graphs: A Case Study With Cell-Cell Communication Networks
James S. Nagai, Ivan G. Costa, Michael T. Schaub
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2024), pp. 9856-9860
Open Access | Times Cited: 1
Accelerate rotation invariant sliced Gromov-Wasserstein distance by an alternative optimization method
Jinming Luo, Yuhao Bian, Xianjie Gao, et al.
Information Sciences (2024) Vol. 677, pp. 120925-120925
Closed Access | Times Cited: 1
Accelerating Unbalanced Optimal Transport Problem Using Dynamic Penalty Updating
Xun Su, Hiroyuki Kasai
2022 International Joint Conference on Neural Networks (IJCNN) (2024) Vol. 7, pp. 1-6
Closed Access | Times Cited: 1
Safe Screening for ℓ2-penalized Unbalanced Optimal Transport Problem
Xun Su, Zhongxi Fang, Hiroyuki Kasai
2022 International Joint Conference on Neural Networks (IJCNN) (2024) Vol. 21, pp. 1-8
Closed Access | Times Cited: 1
An Optimal Transport Approach for Network Regression
Alex G. Zalles, Kai M. Hung, Ann E. Finneran, et al.
2021 IEEE Conference on Control Technology and Applications (CCTA) (2024), pp. 73-78
Closed Access | Times Cited: 1
OST: Refining Text Knowledge with Optimal Spatio-Temporal Descriptor for General Video Recognition
Tongjia Chen, Hongshan Yu, Zhengeng Yang, et al.
2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2024), pp. 18888-18898
Closed Access | Times Cited: 1
Graph diffusion distance: Properties and efficient computation
Cory Braker Scott, Eric Mjolsness
PLoS ONE (2021) Vol. 16, Iss. 4, pp. e0249624-e0249624
Open Access | Times Cited: 10
NetKI: A kirchhoff index based statistical graph embedding in nearly linear time
Anwar Said, Saeed‐Ul Hassan, Waseem Abbas, et al.
Neurocomputing (2020) Vol. 433, pp. 108-118
Closed Access | Times Cited: 9
Forward-Backward Splitting for Optimal Transport Based Problems
Guillermo Ortiz-Jiménez, Mireille El Gheche, Effrosyni Simou, et al.
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2020), pp. 5405-5409
Open Access | Times Cited: 6
Page 1 - Next Page

Scroll to top