{"total":52,"rows":[{"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":"2402.05011","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching","created":"2024-02-07","cited_by_count":28,"area":null},{"id":"2401.11720","title":"Graph Condensation: A Survey","created":"2024-01-22","cited_by_count":23,"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":"2402.11565","title":"Continual Learning on Graphs: Challenges, Solutions, and Opportunities","created":"2024-02-18","cited_by_count":21,"area":null},{"id":"2401.13200","title":"Topology-aware Embedding Memory for Continual Learning on Expanding Networks","created":"2024-01-24","cited_by_count":14,"area":null},{"id":"2410.10341","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","created":"2024-10-14","cited_by_count":12,"area":null},{"id":"2411.06659","title":"An Efficient Memory Module for Graph Few-Shot Class-Incremental Learning","created":"2024-11-11","cited_by_count":10,"area":null},{"id":"2312.14439","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation","created":"2023-12-22","cited_by_count":9,"area":null},{"id":"2402.02000","title":"A Survey on Graph Condensation","created":"2024-02-03","cited_by_count":9,"area":null},{"id":"2404.10984","title":"Graph Continual Learning with Debiased Lossless Memory Replay","created":"2024-04-17","cited_by_count":9,"area":null},{"id":"2405.17003","title":"Graph Condensation for Open-World Graph Learning","created":"2024-05-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":"2406.13200","title":"RobGC: Towards Robust Graph Condensation","created":"2024-06-19","cited_by_count":8,"area":null},{"id":"2505.16860","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","created":"2025-05-22","cited_by_count":8,"area":null},{"id":"2402.13007","title":"Improve Cross-Architecture Generalization on Dataset Distillation","created":"2024-02-20","cited_by_count":7,"area":null},{"id":"2406.07413","title":"Towards Continuous Reuse of Graph Models via Holistic Memory Diversification","created":"2024-06-11","cited_by_count":7,"area":null},{"id":"2406.16715","title":"GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights","created":"2024-06-24","cited_by_count":7,"area":null},{"id":"2502.10556","title":"Recent Advances in Malware Detection: Graph Learning and Explainability","created":"2025-02-14","cited_by_count":7,"area":null},{"id":"2406.02131","title":"CondTSF: One-line Plugin of Dataset Condensation for Time Series Forecasting","created":"2024-06-04","cited_by_count":6,"area":null},{"id":"2406.09860","title":"Dataset Condensation with Latent Quantile Matching","created":"2024-06-14","cited_by_count":6,"area":null},{"id":"2411.17063","title":"Contrastive Graph Condensation: Advancing Data Versatility through Self-Supervised Learning","created":"2024-11-26","cited_by_count":6,"area":null},{"id":"2502.17614","title":"Scalable Graph Condensation with Evolving Capabilities","created":"2025-02-24","cited_by_count":6,"area":null},{"id":"2405.14246","title":"GCondenser: Benchmarking Graph Condensation","created":"2024-05-23","cited_by_count":5,"area":null},{"id":"2407.11025","title":"Backdoor Graph Condensation","created":"2024-07-03","cited_by_count":5,"area":null},{"id":"2411.18919","title":"Federated Continual Graph Learning","created":"2024-11-28","cited_by_count":5,"area":null},{"id":"2505.20807","title":"Simple yet Effective Graph Distillation via Clustering","created":"2025-05-27","cited_by_count":4,"area":null},{"id":"2411.06634","title":"Inductive Graph Few-shot Class Incremental Learning","created":"2024-11-11","cited_by_count":3,"area":null},{"id":"2411.11668","title":"Efficient and Robust Continual Graph Learning for Graph Classification in Biology","created":"2024-11-18","cited_by_count":3,"area":null},{"id":"2508.03283","title":"Online Continual Graph Learning","created":"2025-08-05","cited_by_count":3,"area":null},{"id":"2508.17690","title":"Text Meets Topology: Rethinking Out-of-distribution Detection in Text-Rich Networks","created":"2025-08-25","cited_by_count":3,"area":null},{"id":"2502.06327","title":"Prompt-Driven Continual Graph Learning","created":"2025-02-10","cited_by_count":1,"area":null},{"id":"2503.24259","title":"Advances in Continual Graph Learning for Anti-Money Laundering Systems: A Comprehensive Review","created":"2025-03-31","cited_by_count":1,"area":null},{"id":"2510.06819","title":"The Unreasonable Effectiveness of Randomized Representations in Online Continual Graph Learning","created":"2025-10-08","cited_by_count":1,"area":null},{"id":"2510.22289","title":"Does Homophily Help in Robust Test-time Node Classification?","created":"2025-10-25","cited_by_count":1,"area":null},{"id":"2512.18295","title":"AL-GNN: Privacy-Preserving and Replay-Free Continual Graph Learning via Analytic Learning","created":"2025-12-20","cited_by_count":1,"area":null},{"id":"2602.08036","title":"TAAM:Inductive Graph-Class Incremental Learning with Task-Aware Adaptive Modulation","created":"2026-02-08","cited_by_count":1,"area":null},{"id":"2604.02633","title":"Analytic Drift Resister for Non-Exemplar Continual Graph Learning","created":"2026-04-03","cited_by_count":1,"area":null},{"id":"2605.18893","title":"Position: Graph Condensation Needs a Reset -- Move Beyond Full-dataset Training and Model-Dependence","created":"2026-05-17","cited_by_count":1,"area":null},{"id":"2608.29588","title":"Call Neighbours Yourself: Graph Walks with Destination-Conditioned On-Policy Self-Distillation","created":"2026-08-30","cited_by_count":1,"area":"distill"},{"id":"2408.09350","title":"E-CGL: An Efficient Continual Graph Learner","created":"2024-08-18","cited_by_count":0,"area":null},{"id":"2410.06480","title":"TCGU: Data-centric Graph Unlearning based on Transferable Condensation","created":"2024-10-09","cited_by_count":0,"area":"safety"},{"id":"2412.17961","title":"Extending Graph Condensation to Multi-Label Datasets: A Benchmark Study","created":"2024-12-23","cited_by_count":0,"area":null},{"id":"2504.13691","title":"MEGA: Second-Order Gradient Alignment for Catastrophic Forgetting Mitigation in GFSCIL","created":"2025-04-18","cited_by_count":0,"area":null},{"id":"2509.00735","title":"Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning","created":"2025-08-31","cited_by_count":0,"area":null},{"id":"2509.12727","title":"Unbiased Online Curvature Approximation for Regularized Graph Continual Learning","created":"2025-09-16","cited_by_count":0,"area":null},{"id":"2509.14722","title":"Towards Pre-trained Graph Condensation via Optimal Transport","created":"2025-09-18","cited_by_count":0,"area":null},{"id":"2601.10358","title":"PLGC: Pseudo-Labeled Graph Condensation","created":"2026-01-15","cited_by_count":0,"area":null},{"id":"2605.12998","title":"DRIFT: A Benchmark for Task-Free Continual Graph Learning with Continuous Distribution Shifts","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2607.00377","title":"SAOT: Self-Supervised Continual Graph Learning with Structure-Aware Optimal Transport","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2610.04963","title":"MAGIC: Topology-Aware Analytic Graph Few-Shot Class-Incremental Learning","created":"2026-10-04","cited_by_count":0,"area":null},{"id":"2610.08823","title":"HCPN-GCN: Scaling Hierarchical Prototype Networks with Cone Geometry for Continual Graph Learning","created":"2026-09-25","cited_by_count":0,"area":null}],"next_cursor":null}