{"total":13,"rows":[{"id":"2305.04963","title":"From Relational Pooling to Subgraph GNNs: A Universal Framework for More Expressive Graph Neural Networks","created":"2023-05-08","cited_by_count":17,"area":null},{"id":"2310.20082","title":"Efficient Subgraph GNNs by Learning Effective Selection Policies","created":"2023-10-30","cited_by_count":17,"area":null},{"id":"2501.18739","title":"Beyond Message Passing: Neural Graph Pattern Machine","created":"2025-01-30","cited_by_count":17,"area":null},{"id":"2306.03266","title":"Extending the Design Space of Graph Neural Networks by Rethinking Folklore Weisfeiler-Lehman","created":"2023-06-05","cited_by_count":13,"area":null},{"id":"2311.14333","title":"Cycle Invariant Positional Encoding for Graph Representation Learning","created":"2023-11-24","cited_by_count":8,"area":null},{"id":"2501.09178","title":"Enhancing Graph Representation Learning with Localized Topological Features","created":"2025-01-15","cited_by_count":6,"area":null},{"id":"2505.08266","title":"Open Your Eyes: Vision Enhances Message Passing Neural Networks in Link Prediction","created":"2025-05-13","cited_by_count":2,"area":null},{"id":"2412.18125","title":"Exact Acceleration of Subgraph Graph Neural Networks by Eliminating Computation Redundancy","created":"2024-12-24","cited_by_count":0,"area":null},{"id":"2501.00773","title":"OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks","created":"2025-01-01","cited_by_count":0,"area":null},{"id":"2504.10948","title":"BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs","created":"2025-04-15","cited_by_count":0,"area":null},{"id":"2509.21699","title":"Exact Subgraph Isomorphism Network with Mixed $L_{0,2}$ Norm Constraint for Predictive Graph Mining","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2510.02565","title":"On The Expressive Power of GNN Derivatives","created":"2025-10-02","cited_by_count":0,"area":null},{"id":"2605.25750","title":"Invariant-Based Weight Sharing for Message Passing","created":"2026-05-25","cited_by_count":0,"area":null}],"next_cursor":null}