{"total":55,"rows":[{"id":"2110.07580","title":"Graph Condensation for Graph Neural Networks","created":"2021-10-14","cited_by_count":150,"area":null},{"id":"2202.08235","title":"Data Augmentation for Deep Graph Learning: A Survey","created":"2022-02-16","cited_by_count":133,"area":null},{"id":"2306.02664","title":"Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data","created":"2023-06-05","cited_by_count":71,"area":null},{"id":"2110.05292","title":"Understanding Pooling in Graph Neural Networks","created":"2021-10-11","cited_by_count":69,"area":null},{"id":"2402.03358","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","created":"2024-01-29","cited_by_count":57,"area":null},{"id":"2310.09192","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","created":"2023-10-13","cited_by_count":45,"area":null},{"id":"2212.09034","title":"Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPs","created":"2022-12-18","cited_by_count":42,"area":null},{"id":"2207.07888","title":"SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networks","created":"2022-07-16","cited_by_count":37,"area":null},{"id":"2202.10720","title":"EIGNN: Efficient Infinite-Depth Graph Neural Networks","created":"2022-02-22","cited_by_count":32,"area":null},{"id":"2210.00102","title":"MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization","created":"2022-09-30","cited_by_count":31,"area":null},{"id":"2204.10037","title":"DropMessage: Unifying Random Dropping for Graph Neural Networks","created":"2022-04-21","cited_by_count":29,"area":null},{"id":"2211.00713","title":"MAgNET: A Graph U-Net Architecture for Mesh-Based Simulations","created":"2022-11-01","cited_by_count":26,"area":null},{"id":"2405.13707","title":"Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition","created":"2024-05-22","cited_by_count":23,"area":null},{"id":"2310.04987","title":"Data-centric Graph Learning: A Survey","created":"2023-10-08","cited_by_count":22,"area":null},{"id":"2201.12176","title":"Generative Coarse-Graining of Molecular Conformations","created":"2022-01-28","cited_by_count":21,"area":null},{"id":"2207.08629","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","created":"2022-07-18","cited_by_count":18,"area":null},{"id":"2306.14052","title":"A Survey on Graph Neural Network Acceleration: Algorithms, Systems, and Customized Hardware","created":"2023-06-24","cited_by_count":18,"area":null},{"id":"2403.07294","title":"Graph Data Condensation via Self-expressive Graph Structure Reconstruction","created":"2024-03-12","cited_by_count":18,"area":null},{"id":"2306.08854","title":"A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening","created":"2023-06-15","cited_by_count":15,"area":null},{"id":"2309.10979","title":"Towards Data-centric Graph Machine Learning: Review and Outlook","created":"2023-09-20","cited_by_count":15,"area":null},{"id":"2310.09486","title":"Mirage: Model-Agnostic Graph Distillation for Graph Classification","created":"2023-10-14","cited_by_count":13,"area":null},{"id":"2206.00118","title":"Principle of Relevant Information for Graph Sparsification","created":"2022-05-31","cited_by_count":9,"area":null},{"id":"2210.00437","title":"A Unified Framework for Optimization-Based Graph Coarsening","created":"2022-10-02","cited_by_count":9,"area":null},{"id":"2405.18127","title":"Graph Coarsening with Message-Passing Guarantees","created":"2024-05-28","cited_by_count":9,"area":null},{"id":"2407.19311","title":"Can Modifying Data Address Graph Domain Adaptation?","created":"2024-07-27","cited_by_count":9,"area":null},{"id":"2402.04924","title":"Two Trades is not Baffled: Condensing Graph via Crafting Rational Gradient Matching","created":"2024-02-07","cited_by_count":8,"area":null},{"id":"2403.08147","title":"Representing Molecules as Random Walks Over Interpretable Grammars","created":"2024-03-13","cited_by_count":7,"area":null},{"id":"2405.17535","title":"Calibrated Dataset Condensation for Faster Hyperparameter Search","created":"2024-05-27","cited_by_count":5,"area":null},{"id":"2406.13125","title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2307.04514","title":"Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold","created":"2023-07-10","cited_by_count":4,"area":null},{"id":"2402.01261","title":"TEDDY: Trimming Edges with Degree-based Discrimination strategY","created":"2024-02-02","cited_by_count":4,"area":null},{"id":"2503.19666","title":"Towards Efficient Training of Graph Neural Networks: A Multiscale Approach","created":"2025-03-25","cited_by_count":4,"area":null},{"id":"2405.17404","title":"Spectral Greedy Coresets for Graph Neural Networks","created":"2024-05-27","cited_by_count":3,"area":null},{"id":"2506.11743","title":"Taxonomy of reduction matrices for Graph Coarsening","created":"2025-06-13","cited_by_count":3,"area":null},{"id":"2511.13010","title":"Are Graph Transformers Necessary? Efficient Long-Range Message Passing with Fractal Nodes in MPNNs","created":"2025-11-17","cited_by_count":3,"area":null},{"id":"2207.08597","title":"FunQG: Molecular Representation Learning Via Quotient Graphs","created":"2022-07-18","cited_by_count":2,"area":null},{"id":"2403.13268","title":"Unifews: You Need Fewer Operations for Efficient Graph Neural Networks","created":"2024-03-20","cited_by_count":2,"area":null},{"id":"2410.04022","title":"Efficient Large-Scale Urban Parking Prediction: Graph Coarsening Based on Real-Time Parking Service Capability","created":"2024-10-05","cited_by_count":2,"area":null},{"id":"2506.19224","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","created":"2025-06-24","cited_by_count":2,"area":null},{"id":"2510.02472","title":"Heterogeneous Graph Representation of Stiffened Panels with Non-Uniform Boundary Conditions and Loads","created":"2025-10-02","cited_by_count":2,"area":null},{"id":"2201.12670","title":"SMGRL: Scalable Multi-resolution Graph Representation Learning","created":"2022-01-29","cited_by_count":1,"area":null},{"id":"2305.16391","title":"Graph-Based Model-Agnostic Data Subsampling for Recommendation Systems","created":"2023-05-25","cited_by_count":1,"area":null},{"id":"2305.19726","title":"Learning Representations without Compositional Assumptions","created":"2023-05-31","cited_by_count":1,"area":null},{"id":"2311.06557","title":"Identification of vortex in unstructured mesh with graph neural networks","created":"2023-11-11","cited_by_count":1,"area":null},{"id":"2504.08766","title":"Towards scientific machine learning for granular material simulations -- challenges and opportunities","created":"2025-04-01","cited_by_count":1,"area":null},{"id":"2507.07595","title":"Context Pooling: Query-specific Graph Pooling for Generic Inductive Link Prediction in Knowledge Graphs","created":"2025-07-10","cited_by_count":1,"area":null},{"id":"2310.00183","title":"On the Equivalence of Graph Convolution and Mixup","created":"2023-09-29","cited_by_count":0,"area":null},{"id":"2406.02979","title":"Efficient User Sequence Learning for Online Services via Compressed Graph Neural Networks","created":"2024-06-05","cited_by_count":0,"area":null},{"id":"2406.12435","title":"Federated Learning with Limited Node Labels","created":"2024-06-18","cited_by_count":0,"area":null},{"id":"2510.00958","title":"Test-Time Search in Neural Graph Coarsening Procedures for the Capacitated Vehicle Routing Problem","created":"2025-10-01","cited_by_count":0,"area":null},{"id":"2510.22643","title":"Enhancing Graph Classification Robustness with Singular Pooling","created":"2025-10-26","cited_by_count":0,"area":null},{"id":"2601.22943","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2603.29148","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2607.22287","title":"Efficient Recommendations via Graph Coarsening and Label Propagation","created":"2026-07-24","cited_by_count":0,"area":null},{"id":"2609.25149","title":"Dual-GNN Multilevel Coarsening for Maximum Independent Set","created":"2026-09-21","cited_by_count":0,"area":null}],"next_cursor":null}