{"total":24,"rows":[{"id":"2112.13143","title":"GREED: A Neural Framework for Learning Graph Distance Functions","created":"2021-12-24","cited_by_count":32,"area":null},{"id":"2106.04927","title":"A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs","created":"2021-06-09","cited_by_count":26,"area":null},{"id":"2406.14929","title":"Efficient Graph Similarity Computation with Alignment Regularization","created":"2024-06-21","cited_by_count":26,"area":null},{"id":"2407.13917","title":"LinSATNet: The Positive Linear Satisfiability Neural Networks","created":"2024-07-18","cited_by_count":16,"area":null},{"id":"2302.03266","title":"Learning to Count Isomorphisms with Graph Neural Networks","created":"2023-02-07","cited_by_count":13,"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":"2205.15083","title":"CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning","created":"2022-05-30","cited_by_count":8,"area":null},{"id":"2505.22109","title":"The quest for the GRAph Level autoEncoder (GRALE)","created":"2025-05-28","cited_by_count":8,"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":"2306.01310","title":"EPIC: Graph Augmentation with Edit Path Interpolation via Learnable Cost","created":"2023-06-02","cited_by_count":3,"area":null},{"id":"2501.12898","title":"DocTTT: Test-Time Training for Handwritten Document Recognition Using Meta-Auxiliary Learning","created":"2025-01-22","cited_by_count":3,"area":null},{"id":"2506.01977","title":"Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN","created":"2025-05-16","cited_by_count":3,"area":null},{"id":"2204.13429","title":"DOTIN: Dropping Task-Irrelevant Nodes for GNNs","created":"2022-04-28","cited_by_count":2,"area":null},{"id":"2409.04495","title":"Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks","created":"2024-09-06","cited_by_count":2,"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":"2307.15377","title":"Co-attention Graph Pooling for Efficient Pairwise Graph Interaction Learning","created":"2023-07-28","cited_by_count":0,"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":"2411.03624","title":"SEGMN: A Structure-Enhanced Graph Matching Network for Graph Similarity Learning","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2511.19837","title":"GED-Consistent Disentanglement of Aligned and Unaligned Substructures for Graph Similarity Learning","created":"2025-11-25","cited_by_count":0,"area":null},{"id":"2605.19721","title":"Projecting Latent RL Actions: Towards Generalizable and Scalable Graph Combinatorial Optimization","created":"2026-05-19","cited_by_count":0,"area":null},{"id":"2606.29161","title":"GLACIER: Rethinking Mass Spectrum Prediction as an Object Detection Problem","created":"2026-06-28","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}