{"list":"other","total":60,"rows":[{"id":"1812.08434","title":"Graph Neural Networks: A Review of Methods and Applications","created":"2018-12-20","cited_by_count":1576},{"id":"2007.08663","title":"TUDataset: A collection of benchmark datasets for learning with graphs","created":"2020-07-16","cited_by_count":728},{"id":"1811.06128","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","created":"2018-11-15","cited_by_count":623},{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268},{"id":"2002.04025","title":"Can Graph Neural Networks Count Substructures?","created":"2020-02-10","cited_by_count":236},{"id":"2002.06157","title":"Generalization and Representational Limits of Graph Neural Networks","created":"2020-02-14","cited_by_count":218},{"id":"1302.5843","title":"Ising formulations of many NP problems","created":"2013-02-23","cited_by_count":207},{"id":"1907.03199","title":"What graph neural networks cannot learn: depth vs width","created":"2019-07-06","cited_by_count":201},{"id":"1802.03685","title":"Learning a SAT Solver from Single-Bit Supervision","created":"2018-02-11","cited_by_count":200},{"id":"1905.13211","title":"What Can Neural Networks Reason About?","created":"2019-05-30","cited_by_count":159},{"id":"2006.10643","title":"Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs","created":"2020-06-18","cited_by_count":115},{"id":"2003.04078","title":"A Survey on The Expressive Power of Graph Neural Networks","created":"2020-03-09","cited_by_count":111},{"id":"2107.01188","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","created":"2021-07-02","cited_by_count":108},{"id":"2012.04030","title":"Statistical Mechanics of Deep Linear Neural Networks: The Back-Propagating Kernel Renormalization","created":"2020-12-07","cited_by_count":71},{"id":"1606.07550","title":"SNAP: A General Purpose Network Analysis and Graph Mining Library","created":"2016-06-24","cited_by_count":56},{"id":"1710.05017","title":"The power of sum-of-squares for detecting hidden structures","created":"2017-10-13","cited_by_count":54},{"id":"1810.03068","title":"Geometric Scattering for Graph Data Analysis","created":"2018-10-07","cited_by_count":49},{"id":"1804.00099","title":"Graph Convolutional Neural Networks via Scattering","created":"2018-03-31","cited_by_count":46},{"id":"1806.08829","title":"Diffusion Scattering Transforms on Graphs","created":"2018-06-22","cited_by_count":44},{"id":"2206.13211","title":"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","created":"2022-06-27","cited_by_count":33},{"id":"2106.07162","title":"Goal-Aware Neural SAT Solver","created":"2021-06-14","cited_by_count":28},{"id":"2206.01506","title":"Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?","created":"2022-06-03","cited_by_count":25},{"id":"2210.00623","title":"Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut","created":"2022-10-02","cited_by_count":19},{"id":"1302.6256","title":"Parallel Maximum Clique Algorithms with Applications to Network Analysis and Storage","created":"2013-02-25","cited_by_count":15},{"id":"1508.05117","title":"The backtracking survey propagation algorithm for solving random K-SAT problems","created":"2015-08-20","cited_by_count":14},{"id":"1503.06447","title":"Sum-of-squares lower bounds for planted clique","created":"2015-03-22","cited_by_count":12},{"id":"2109.11405","title":"Learning the noise fingerprint of quantum devices","created":"2021-09-23","cited_by_count":12},{"id":"2012.06344","title":"Learning from Survey Propagation: a Neural Network for MAX-E-$3$-SAT","created":"2020-12-10","cited_by_count":11},{"id":"2012.07747","title":"Solving non-linear Kolmogorov equations in large dimensions by using deep learning: a numerical comparison of discretization schemes","created":"2020-12-09","cited_by_count":11},{"id":"1502.06590","title":"Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems","created":"2015-02-23","cited_by_count":9},{"id":"1904.07174","title":"The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property","created":"2019-04-15","cited_by_count":9},{"id":"2302.03602","title":"Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","created":"2023-02-03","cited_by_count":9},{"id":"1411.2680","title":"Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover","created":"2014-11-11","cited_by_count":8},{"id":"1502.05680","title":"Finding One Community in a Sparse Graph","created":"2015-02-19","cited_by_count":8},{"id":"1708.06151","title":"Scalable Kernelization for Maximum Independent Sets","created":"2017-08-21","cited_by_count":8},{"id":"1910.03740","title":"The Resolution of Keller's Conjecture","created":"2019-10-09","cited_by_count":8},{"id":"2209.04824","title":"Hard Optimization Problems have Soft Edges","created":"2022-09-11","cited_by_count":8},{"id":"2204.01911","title":"Almost-Linear Planted Cliques Elude the Metropolis Process","created":"2022-04-05","cited_by_count":7},{"id":"2001.01230","title":"Learning fine-grained search space pruning and heuristics for combinatorial optimization","created":"2020-01-05","cited_by_count":6},{"id":"2106.05720","title":"Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model","created":"2021-06-10","cited_by_count":6},{"id":"1802.05903","title":"Parallel Tempering for the planted clique problem","created":"2018-02-16","cited_by_count":5},{"id":"2006.04411","title":"A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms","created":"2020-06-08","cited_by_count":5},{"id":"2303.12096","title":"Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems","created":"2023-02-03","cited_by_count":5},{"id":"2312.07296","title":"Complex Recurrent Spectral Network","created":"2023-12-12","cited_by_count":5},{"id":"1411.7460","title":"Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection","created":"2014-11-27","cited_by_count":4},{"id":"1703.00676","title":"A Unifying View of Explicit and Implicit Feature Maps of Graph Kernels","created":"2017-03-02","cited_by_count":4},{"id":"2003.12293","title":"Large independent sets on random $d$-regular graphs with fixed degree $d$","created":"2020-03-27","cited_by_count":4},{"id":"2008.05180","title":"Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations","created":"2020-08-12","cited_by_count":4},{"id":"1505.07077","title":"Solving the Maximum Clique Problem with Symmetric Rank-One Nonnegative Matrix Approximation","created":"2015-05-26","cited_by_count":3},{"id":"2303.17403","title":"Matrix Product Belief Propagation for reweighted stochastic dynamics over graphs","created":"2023-03-30","cited_by_count":3},{"id":"2309.05337","title":"Stochastic Gradient Descent-like relaxation is equivalent to Metropolis dynamics in discrete optimization and inference problems","created":"2023-09-11","cited_by_count":3},{"id":"1608.00724","title":"On the Power of Simple Reductions for the Maximum Independent Set Problem","created":"2016-08-02","cited_by_count":2},{"id":"2311.07540","title":"Finding planted cliques using gradient descent","created":"2023-11-13","cited_by_count":2},{"id":"1308.3520","title":"Fixed-Parameter and Approximation Algorithms: A New Look","created":"2013-08-15","cited_by_count":1},{"id":"1505.00449","title":"Algorithms for the minimum sum coloring problem: a review","created":"2015-05-03","cited_by_count":1},{"id":"1612.05026","title":"Solving graph coloring problems with the Douglas-Rachford algorithm","created":"2016-12-15","cited_by_count":1},{"id":"1912.02728","title":"Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk","created":"2019-12-05","cited_by_count":1},{"id":"2009.13644","title":"A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems","created":"2020-09-28","cited_by_count":1},{"id":"2111.13302","title":"Equivalence between algorithmic instability and transition to replica symmetry breaking in perceptron learning systems","created":"2021-11-26","cited_by_count":1},{"id":"2301.00483","title":"Inferring multiple consensus trees and supertrees using clustering: a review","created":"2023-01-01","cited_by_count":1}],"next_cursor":null}