{"total":21,"rows":[{"id":"2302.11603","title":"Some Might Say All You Need Is Sum","created":"2023-02-22","cited_by_count":21,"area":null},{"id":"2310.00526","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","created":"2023-10-01","cited_by_count":11,"area":null},{"id":"2403.06026","title":"Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches","created":"2024-03-09","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":"2505.00291","title":"Repetition Makes Perfect: Recurrent Graph Neural Networks Match Message-Passing Limit","created":"2025-05-01","cited_by_count":4,"area":null},{"id":"2505.16053","title":"Learning from Algorithm Feedback: One-Shot SAT Solver Guidance with GNNs","created":"2025-05-21","cited_by_count":4,"area":null},{"id":"2211.12581","title":"UNSAT Solver Synthesis via Monte Carlo Forest Search","created":"2022-11-22","cited_by_count":3,"area":null},{"id":"2406.11897","title":"A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization","created":"2024-06-14","cited_by_count":3,"area":null},{"id":"2404.04874","title":"Quadratic Binary Optimization with Graph Neural Networks","created":"2024-04-07","cited_by_count":2,"area":null},{"id":"2508.20330","title":"FORGE: Foundational Optimization Representations from Graph Embeddings","created":"2025-08-28","cited_by_count":2,"area":null},{"id":"2306.06523","title":"Finding Hamiltonian cycles with graph neural networks","created":"2023-06-10","cited_by_count":1,"area":null},{"id":"2502.04402","title":"Beyond Interpolation: Extrapolative Reasoning with Reinforcement Learning and Graph Neural Networks","created":"2025-02-06","cited_by_count":1,"area":null},{"id":"2505.19497","title":"Learning for Dynamic Combinatorial Optimization without Training Data","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2603.20801","title":"Large Neighborhood Search meets Iterative Neural Constraint Heuristics","created":"2026-03-21","cited_by_count":1,"area":null},{"id":"2409.13959","title":"One Model, Any Conjunctive Query: Graph Neural Networks for Answering Queries over Incomplete Knowledge Graphs","created":"2024-09-21","cited_by_count":0,"area":null},{"id":"2601.08696","title":"Enabling Population-Based Architectures for Neural Combinatorial Optimization","created":"2026-01-13","cited_by_count":0,"area":null},{"id":"2601.21048","title":"Test-Time Adaptation for Unsupervised Combinatorial Optimization","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2602.20376","title":"Exploiting Low-Rank Objective Structure in Discrete Quadratic Optimization","created":"2026-02-23","cited_by_count":0,"area":null},{"id":"2603.02462","title":"Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?","created":"2026-03-02","cited_by_count":0,"area":null},{"id":"2603.14846","title":"Lost in Aggregation: On a Fundamental Expressivity Limit of Message-Passing Graph Neural Networks","created":"2026-03-16","cited_by_count":0,"area":null},{"id":"2604.09001","title":"Hypergraph Neural Networks Accelerate MUS Enumeration","created":"2026-04-10","cited_by_count":0,"area":null}],"next_cursor":null}