Key papers

• Distributional Determinantal Point Process for Repulsive Clustering of Distributions (2026)
  Khai Nguyen et al.
  4.95
• Hierarchical $\mathcal{F}$-Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs (2026)
  Micha{\l} Szyfelbein et al.
  4.33
• Graph Partitioning with Demands: Generalized Conductance and its Applications (2026)
  Micha{\l} Szyfelbein et al.
  4.33
• CayleyR: Solving the TopSpin puzzle via cycle intersection (2026)
  Yuri Baramykov
  4.33
• Cluster with Auctions for Vector Search (2026)
  Swann Bessa et al.
  4.33
• What Makes Majority Illusion Easy to Detect? (2026)
  \v{S}imon Schierreich and Ildik\'o Schlotter
  1.89
• Differentially Private Range Subgraph Counting (2026)
  Xian Chen et al.
  1.89
• An Approximation Algorithm for Graph Label Selection (2026)
  Josia John et al.
  1.83
• On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions (2026)
  Malte Luttermann et al.
  1.83
• Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It (2026)
  Marco Bressan et al.
  1.78
• Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs (2026)
  Kengo Nakamura and Masaaki Nishino
  1.78
• Greedy Routing in a Sequentially Grown One-Dimensional Random Graph (2026)
  Alexander Ponomarenko
  1.78
• Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search (2026)
  Nicolas Tacheny
  1.78
• Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability (2026)
  Eleanor Wiesler et al.
  1.78
• An Efficient Streaming Algorithm for Approximating Graphlet Distributions (2026)
  Marco Bressan et al.
  1.78
• Incremental Strongly Connected Components with Predictions (2026)
  Ronald Deng et al.
  1.78
• Instruction set for the representation of graphs (2026)
  Ezequiel Lopez-Rubio et al.
  1.72
• Bonsai: A class of effective methods for independent sampling of graph partitions (2026)
  Jeanne Clelland and Kristopher Tapp
  1.72
• Breaking Hard Isomorphism Benchmarks with DRESS (2026)
  Eduar Castrillo Velilla
  1.72
• Detection of local geometry in random graphs: information-theoretic and computational limits (2026)
  Jinho Bok et al.
  1.72
• A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management (2026)
  Ashwin Ganesan
  1.72
• Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds (2026)
  Sujoy Bhore et al.
  1.67
• Incremental (k, z)-Clustering on Graphs (2026)
  Emilio Cruciani et al.
  1.67
• The Complexity of Bayesian Network Learning: Revisiting the Superstructure (2026)
  Robert Ganian et al.
  1.67
• Which Algorithms Can Graph Neural Networks Learn? (2026)
  Solveig Wittig et al.
  1.67
• Learning to Approximate Uniform Facility Location via Graph Neural Networks (2026)
  Chendi Qian et al.
  1.67
• Counting Balanced Triangles on Social Networks With Uncertain Edge Signs (2026)
  Alexander Zhou et al.
  1.67
• DRESS: A Continuous Framework for Structural Graph Refinement (2026)
  Eduar Castrillo Velilla
  1.67
• Counting hypertriangles through hypergraph orientations (2026)
  Daniel Paul-Pena et al.
  1.61
• Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning (2025)
  Dongyue Li et al.
  1.56
• Aggregating maximal cliques in real-world graphs (2025)
  Noga Alon et al.
  1.56
• ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks (2025)
  Dehong Zheng et al.
  1.56
• Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications (2025)
  J. Allagan et al.
  1.56
• Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning (2025)
  Ayoub Ghriss
  1.50
• A Spanning-Tree-Based Algorithm for Planar Graph Dismantling (2025)
  Fangchen You
  1.50
• Exact Learning of Weighted Graphs Using Composite Queries (2025)
  Michael T. Goodrich et al.
  1.50
• Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity (2025)
  Lutz Oettershagen et al.
  1.44
• Learning-Augmented Streaming Algorithms for Correlation Clustering (2025)
  Yinhao Dong et al.
  1.44
• Structure-Aware Spectral Sparsification via Uniform Edge Sampling (2025)
  Kaiwen He et al.
  1.44
• Opinion Maximization in Social Networks by Modifying Internal Opinions (2025)
  Gengyu Wang et al.
  1.44
• The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions (2025)
  Atticus McWhorter and Daryl DeFord
  1.44
• Fast Percolation Centrality Approximation with Importance Sampling (2025)
  Antonio Cruciani et al.
  1.39
• Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case (2025)
  Danila Valko et al.
  1.39
• Robust Detection of Planted Subgraphs in Semi-Random Models (2025)
  Dor Elimelech et al.
  1.33
• Online Sparsification of Bipartite-Like Clusters in Graphs (2025)
  Joyentanuj Das et al.
  1.33
• The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem (2025)
  Qiheng Lu et al.
  1.33
• Quality control in sublinear time: a case study via random graphs (2025)
  Cassandra Marcussen et al.
  1.33
• $\sigma$-Maximal Ancestral Graphs (2025)
  Binghua Yao et al.
  1.28
• Efficient and Adaptive Estimation of Local Triadic Coefficients (2025)
  Ilie Sarpe and Aristides Gionis
  1.28
• Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts (2025)
  Pan Peng et al.
  1.28
• Triadic First-Order Logic Queries in Temporal Networks (2025)
  Omkar Bhalerao et al.
  1.28
• Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models (2025)
  Arijit Bishnu et al.
  1.28
• Controlling the Spread of Epidemics on Networks with Differential Privacy (2025)
  Dung Nguyen et al.
  1.22
• Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs (2025)
  Hadley Black et al.
  1.22
• Efficient Approximate Temporal Triangle Counting in Streaming with Predictions (2025)
  Giorgio Venturin et al.
  1.22
• Learning Augmented Graph $k$-Clustering (2025)
  Chenglin Fan et al.
  1.22
• Asymptotically Smaller Encodings for Graph Problems and Scheduling (2025)
  Bernardo Subercaseaux
  1.22
• Linear-Time Primitives for Algorithm Development in Graphical Causal Inference (2025)
  Marcel Wien\"obst et al.
  1.22
• Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations (2025)
  Lorenzo Bini et al.
  1.22
• Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks (2025)
  Samin Aref and Boris Ng
  1.17