{"total":31,"rows":[{"id":"2210.11695","title":"Global Counterfactual Explainer for Graph Neural Networks","created":"2022-10-21","cited_by_count":30,"area":null},{"id":"2306.01958","title":"A Survey on Explainability of Graph Neural Networks","created":"2023-06-02","cited_by_count":29,"area":null},{"id":"2310.01794","title":"GNNX-BENCH: Unravelling the Utility of Perturbation-based GNN Explainers through In-depth Benchmarking","created":"2023-10-03","cited_by_count":11,"area":null},{"id":"2409.17687","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","created":"2024-09-26","cited_by_count":11,"area":null},{"id":"2311.02356","title":"MATA*: Combining Learnable Node Matching with A* Algorithm for Approximate Graph Edit Distance Computation","created":"2023-11-04","cited_by_count":10,"area":null},{"id":"2306.03447","title":"GRAFENNE: Learning on Graphs with Heterogeneous and Dynamic Feature Sets","created":"2023-06-06","cited_by_count":7,"area":null},{"id":"2412.18857","title":"Computing Approximate Graph Edit Distance via Optimal Transport","created":"2024-12-25","cited_by_count":6,"area":null},{"id":"2502.12908","title":"Graph Neural Networks for Databases: A Survey","created":"2025-02-18","cited_by_count":6,"area":null},{"id":"2112.13267","title":"Task and Model Agnostic Adversarial Attack on Graph Neural Networks","created":"2021-12-25","cited_by_count":5,"area":null},{"id":"2210.09082","title":"A Solver-Free Framework for Scalable Learning in Neural ILP Architectures","created":"2022-10-17","cited_by_count":5,"area":null},{"id":"2310.11787","title":"NeuroCUT: A Neural Approach for Robust Graph Partitioning","created":"2023-10-18","cited_by_count":4,"area":null},{"id":"2208.12226","title":"Lifelong Learning for Neural powered Mixed Integer Programming","created":"2022-08-24","cited_by_count":2,"area":null},{"id":"2510.22538","title":"Iteratively Refined Early Interaction Alignment for Subgraph Matching based Graph Retrieval","created":"2025-10-26","cited_by_count":2,"area":null},{"id":"2201.01603","title":"Deep Probabilistic Graph Matching","created":"2022-01-05","cited_by_count":1,"area":null},{"id":"2308.13871","title":"Graph Edit Distance Learning via Different Attention","created":"2023-08-26","cited_by_count":1,"area":null},{"id":"2504.06533","title":"Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance","created":"2025-04-09","cited_by_count":1,"area":null},{"id":"2508.03111","title":"GEDAN: Learning the Edit Costs for Graph Edit Distance","created":"2025-08-05","cited_by_count":1,"area":null},{"id":"2510.00394","title":"Graph2Region: Efficient Graph Similarity Learning with Structure and Scale Restoration","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2510.00402","title":"Hierarchy-Aware Neural Subgraph Matching with Enhanced Similarity Measure","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2602.10386","title":"Colorful Talks with Graphs: Human-Interpretable Graph Encodings for Large Language Models","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2602.12740","title":"SPRig: Self-Supervised Pose-Invariant Rigging from Mesh Sequences","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2402.05885","title":"EUGENE: Explainable Structure-aware Graph Edit Distance Estimation with Generalized Edit Costs","created":"2024-02-08","cited_by_count":0,"area":null},{"id":"2404.09812","title":"Solving the Tree Containment Problem Using Graph Neural Networks","created":"2024-04-15","cited_by_count":0,"area":null},{"id":"2405.06917","title":"Design Requirements for Human-Centered Graph Neural Network Explanations","created":"2024-05-11","cited_by_count":0,"area":null},{"id":"2510.22479","title":"Contextual Tokenization for Graph Inverted Indices","created":"2025-10-26","cited_by_count":0,"area":null},{"id":"2510.22897","title":"Charting the Design Space of Neural Graph Representations for Subgraph Matching","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2604.08295","title":"U-CECE: A Universal Multi-Resolution Framework for Conceptual Counterfactual Explanations","created":"2026-04-09","cited_by_count":0,"area":null},{"id":"2605.06588","title":"Towards Metric-Faithful Neural Graph Matching","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.17746","title":"Agents for Experiments, Experiments for Agents: A Design Grammar for AI-Enabled Experimental Science","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2607.03049","title":"Alignment-Guided Largest Table Overlap Size Estimation","created":"2026-07-03","cited_by_count":0,"area":null},{"id":"2610.04644","title":"Revisiting the Generalization of Neural Graph Edit Distance Models","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}