Key papers

• Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools (2026)
  Alina Du et al.
  1.83
• Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS (2026)
  Laurent Guigues
  1.83
• ReLU Networks for Exact Generation of Similar Graphs (2026)
  Mamoona Ghafoor and Tatsuya Akutsu
  1.78
• Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It (2026)
  Marco Bressan et al.
  1.78
• Breaking Hard Isomorphism Benchmarks with DRESS (2026)
  Eduar Castrillo Velilla
  1.72
• Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds (2026)
  Sujoy Bhore et al.
  1.67
• Constrained graph generation: Preserving diameter and clustering coefficient simultaneously (2026)
  D\'avid Ferenczi et al.
  1.67
• Coalgebraic analysis of social systems (2026)
  Nima Motamed et al.
  1.67
• Bringing order to network centrality measures (2026)
  G. Exarchakos et al.
  1.61
• Heuristic algorithms for the stochastic critical node detection problem (2025)
  Tuguldur Bayarsaikhan et al.
  1.56
• Aggregating maximal cliques in real-world graphs (2025)
  Noga Alon et al.
  1.56
• Accelerating Materials Discovery: Learning a Universal Representation of Chemical Processes for Cross-Domain Property Prediction (2025)
  Mikhail Tsitsvero et al.
  1.56
• Algorithm for Interpretable Graph Features via Motivic Persistent Cohomology (2025)
  Yoshihiro Maruyama
  1.56
• Geometric characterisation of structural and regular equivalences in undirected (hyper)graphs (2025)
  Marzieh Eidi and Nina Otter
  1.56
• Zoo of Centralities: Encyclopedia of Node Metrics in Complex Networks (2025)
  Sergey Shvydun
  1.50
• A Fast Binary Splitting Approach for Non-Adaptive Learning of Erd\H{o}s--R\'enyi Graphs (2025)
  Hoang Ta and Jonathan Scarlett
  1.50
• Partial Optimality in Cubic Correlation Clustering for General Graphs (2025)
  David Stein et al.
  1.44
• On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model (2025)
  Alexander Pluska et al.
  1.44
• Larger holes as narrower degree distributions in complex networks (2025)
  Kiri Kawato et al.
  1.44
• Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version) (2025)
  Zhongyuan Zhao et al.
  1.39
• Maxout Polytopes (2025)
  Andrei Balakin et al.
  1.39
• Neural Feature Geometry Evolves as Discrete Ricci Flow (2025)
  Moritz Hehl et al.
  1.39
• On Approximate MMS Allocations on Restricted Graph Classes (2025)
  V\'aclav Bla\v{z}ej and Micha{\l} D\k{e}bski and Zbigniew Lonc and Marta Piecyk and Pawe{\l} Rz\k{a}\.zewski
  1.33
• Reconstructing graphs and their connectivity using graphlets (2025)
  David Hartman and Aneta Pokorn\'a and Daniel Trlifaj and Llu\'is Vena
  1.33
• Universal vulnerability in strong modular networks with various degree distributions between inequality and equality (2025)
  Yukio Hayashi et al.
  1.33
• $\sigma$-Maximal Ancestral Graphs (2025)
  Binghua Yao et al.
  1.28
• In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator (2025)
  Randy Davila et al.
  1.28
• Bespoke multiresolution analysis of graph signals (2025)
  Giacomo Elefante and Gianluca Giacchi and Michael Multerer and Jacopo Quizi
  1.28
• Constructing and Sampling Directed Graphs with Linearly Rescaled Degree Matrices (2025)
  Yunxiang Yan et al.
  1.28
• Feature-Aware (Hyper)graph Generation via Next-Scale Prediction (2025)
  Dorian Gailhard et al.
  1.22
• HyColor: An Efficient Heuristic Algorithm for Graph Coloring (2025)
  Enqiang Zhu et al.
  1.22
• Circular Directional Flow Decomposition of Networks (2025)
  Marc Homs-Dones et al.
  1.22
• Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment (2025)
  Pablo Ari\~no Fern\'andez
  1.22
• Conceptual Topic Aggregation (2025)
  Klara M. Gutekunst et al.
  1.22
• Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs (2025)
  Marco Bressan and Victor Chepoi and Emmanuel Esposito and Maximilian Thiessen
  1.22
• Graphon Mixtures (2025)
  Sevvandi Kandanaarachchi et al.
  1.17
• From Signed Networks to Group Graphs (2025)
  Tim S. Evans
  1.17
• Causal Models for Growing Networks (2025)
  Gecia Bravo-Hermsdorff et al.
  1.11
• Graph Attention for Heterogeneous Graphs with Positional Encoding (2025)
  Nikhil Shivakumar Nayak
  1.11
• A Customized SAT-based Solver for Graph Coloring (2025)
  Timo Brand et al.
  1.11
• GraphOmni: A Comprehensive and Extensible Benchmark Framework for Large Language Models on Graph-theoretic Tasks (2025)
  Hao Xu et al.
  1.11
• How Local Separators Shape Community Structure in Large Networks (2025)
  Sarah Frenkel and Johannes Carmesin
  1.11
• Metric-Based Granular Computing in Networks (2025)
  Hibba Arshad et al.
  1.06
• The Computational Complexity of Positive Non-Clashing Teaching in Graphs (2025)
  Robert Ganian et al.
  1.06
• Revisiting FastMap: New Applications (2025)
  Ang Li
  1.06
• Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs (2025)
  Prathyush Sambaturu et al.
  1.06
• Computing and Learning on Combinatorial Data (2025)
  Simon Zhang
  1.00
• Robust Graph-Based Semi-Supervised Learning via $p$-Conductances (2025)
  Sawyer Jack Robertson et al.
  1.00
• A Machine Learning Approach That Beats Large Rubik's Cubes (2025)
  Alexander Chervov et al.
  1.00
• Local iterative algorithms for approximate symmetry guided by network centralities (2025)
  David Hartman et al.
  1.00
• Graph Inference with Effective Resistance Queries (2025)
  Huck Bennett et al.
  1.00
• A Parallel Hierarchical Approach for Community Detection on Large-scale Dynamic Networks (2025)
  Grigoriy Bokov et al.
  1.00
• CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs (2025)
  A. Chervov et al.
  1.00
• Low rank matrix completion and realization of graphs: results and problems (2025)
  S. Dzhenzher et al.
  0.94
• Convergence of gradient based training for linear Graph Neural Networks (2025)
  Dhiraj Patel et al.
  0.94
• Dense and sparse vertex connectivity in networks (2020)
  Djellabi Mehdi et al.
  —
• Expressive Power of Invariant and Equivariant Graph Neural Networks (2020)
  Wa\"iss Azizian et al.
  —
• Build2Vec: Building Representation in Vector Space (2020)
  Mahmoud Abdelrahman et al.
  —
• A simple bipartite graph projection model for clustering in networks (2020)
  Austin R. Benson et al.
  —
• Finding Densest $k$-Connected Subgraphs (2020)
  Francesco Bonchi et al.
  —