{"total":18,"rows":[{"id":"2110.02753","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","created":"2021-10-06","cited_by_count":21,"area":null},{"id":"2107.01952","title":"Partition and Code: learning how to compress graphs","created":"2021-07-05","cited_by_count":10,"area":null},{"id":"2102.04228","title":"Mask-GVAE: Blind Denoising Graphs via Partition","created":"2021-02-08","cited_by_count":9,"area":null},{"id":"2104.03546","title":"Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks","created":"2021-04-08","cited_by_count":8,"area":null},{"id":"2409.02135","title":"Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling","created":"2024-09-02","cited_by_count":7,"area":null},{"id":"2503.04047","title":"Reheated Gradient-based Discrete Sampling for Combinatorial Optimization","created":"2025-03-06","cited_by_count":6,"area":null},{"id":"2110.08614","title":"Deep Learning and Spectral Embedding for Graph Partitioning","created":"2021-10-16","cited_by_count":5,"area":null},{"id":"2310.10374","title":"Multi-Factor Spatio-Temporal Prediction based on Graph Decomposition Learning","created":"2023-10-16","cited_by_count":4,"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":"2510.08755","title":"Robust Heuristic Algorithm Design with LLMs","created":"2025-10-09","cited_by_count":3,"area":null},{"id":"2107.12070","title":"Robust Regularized Locality Preserving Indexing for Fiedler Vector Estimation","created":"2021-07-26","cited_by_count":1,"area":null},{"id":"2409.01387","title":"VLSI Hypergraph Partitioning with Deep Learning","created":"2024-09-02","cited_by_count":1,"area":null},{"id":"2209.14825","title":"Trading off Quality for Efficiency of Community Detection: An Inductive Method across Graphs","created":"2022-09-29","cited_by_count":0,"area":null},{"id":"2304.09975","title":"Solving the Kidney-Exchange Problem via Graph Neural Networks with No Supervision","created":"2023-04-19","cited_by_count":0,"area":null},{"id":"2305.17437","title":"GIMM: InfoMin-Max for Automated Graph Contrastive Learning","created":"2023-05-27","cited_by_count":0,"area":null},{"id":"2306.12857","title":"Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints","created":"2023-06-22","cited_by_count":0,"area":null},{"id":"2503.02448","title":"NodeNAS: Node-Specific Graph Neural Architecture Search for Out-of-Distribution Generalization","created":"2025-03-04","cited_by_count":0,"area":null},{"id":"2609.31816","title":"Relational Compression: A Framework for Relational Fidelity in Constrained Representations","created":"2026-09-25","cited_by_count":0,"area":null}],"next_cursor":null}