On the public citation graph
An optimal lower bound on the number of variables for graph identification
0 signed · 501 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10854-8_4openalex-snapshot
Moderately exponential bound for graph isomorphism
inferredcites →https://doi.org/10.1007/978-1-4612-4478-3_5openalex-snapshot
Describing Graphs: A First-Order Approach to Graph Canonization
inferredcites →https://doi.org/10.1007/bfb0089374openalex-snapshot
On Construction and Identification of Graphs
inferredcites →https://doi.org/10.1016/0020-0190(79)90004-8openalex-snapshot
A note on the graph isomorphism counting problem
inferredcites →https://doi.org/10.1016/0022-0000(81)90039-8openalex-snapshot
Number of quantifiers is better than number of tape cells
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0022-0000(82)90011-3openalex-snapshot
Upper and lower bounds for first order expressibility
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
inferredcites →https://doi.org/10.1016/0890-5401(89)90055-2openalex-snapshot
Definability with bounded number of bound variables
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1979.8openalex-snapshot
Canonical labelling of graphs in linear average time
inferredcites →https://doi.org/10.1109/sfcs.1983.10openalex-snapshot
Computational complexity and the classification of finite simple groups
inferredcites →https://doi.org/10.1109/sfcs.1987.11openalex-snapshot
Canonical labeling of regular graphs in linear average time
inferredcites →https://doi.org/10.1109/sfcs.1987.50openalex-snapshot
Recursive construction for 3-regular expanders
inferredcites →https://doi.org/10.1137/0209018openalex-snapshot
On the Complexity of Canonical Labeling of Strongly Regular Graphs
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1145/113413.113417openalex-snapshot
The expressiveness of a family of finite set languages
inferredcites →https://doi.org/10.1145/800061.808745openalex-snapshot
Normal forms for trivalent graphs and graphs of bounded valence
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.1145/800133.804331openalex-snapshot
On the nlog n isomorphism technique (A Preliminary Report)
inferredcites →https://doi.org/10.2307/2006997openalex-snapshot
On the Order of Uniprimitive Permutation Groups
inferredcites →https://doi.org/10.4064/fm-49-2-129-141openalex-snapshot
An application of games to the completeness problem for formalized theories
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4658352openalex-extracted
On the Weisfeiler Algorithm of Depth-1 Stabilization
inferred← citeshttps://doi.org/10.1002/jgt.20461openalex-snapshot
On recognizing graphs by numbers of homomorphisms
inferred← citeshttps://doi.org/10.1002/malq.19970430203openalex-snapshot
Logics with Zero‐One Laws that Are Not Fragments of Bounded‐Variable Infinitary Logic
inferred← citeshttps://doi.org/10.1002/rsa.20049openalex-snapshot
How complex are random graphs in first order logic?
inferred← citeshttps://doi.org/10.1006/inco.1998.2703openalex-snapshot
A Restricted Second Order Logic for Finite Structures
inferred← citeshttps://doi.org/10.1006/jcss.1997.1485openalex-snapshot
Counting Quantifiers, Successor Relations, and Logarithmic Space
inferred← citeshttps://doi.org/10.1006/jcss.2000.1712openalex-snapshot
Querying Spatial Databases via Topological Invariants
inferred← citeshttps://doi.org/10.1006/jcss.2001.1806openalex-snapshot
Inherent Complexity of Recursive Queries
inferred← citeshttps://doi.org/10.1007/10703163_8openalex-snapshot
Choice Construct and Lindström Logics
inferred← citeshttps://doi.org/10.1007/11672142_31openalex-snapshot
On Hypergraph and Graph Isomorphism with Bounded Color Classes
inferred← citeshttps://doi.org/10.1007/11780342_26openalex-snapshot
On Graph Isomorphism for Restricted Graph Classes
inferred← citeshttps://doi.org/10.1007/11786986_2openalex-snapshot
Testing Graph Isomorphism in Parallel by Playing a Game
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-36596-6_11openalex-snapshot
Semantic Classifications of Queries to Relational Databases
inferred← citeshttps://doi.org/10.1007/3-540-45758-5_14openalex-snapshot
Relational Databases and Homogeneity in Logics with Counting
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_9openalex-snapshot
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_18openalex-snapshot
Logics Capturing Local Properties
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_1openalex-snapshot
Generalized Quantifiers, an Introduction
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_2openalex-snapshot
Counting and Locality over Finite Structures A Survey
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_27openalex-snapshot
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_6openalex-snapshot
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_15openalex-snapshot
Inductive definability with counting on finite structures
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_136openalex-snapshot
Reachability and the power of local ordering
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_4openalex-snapshot
Languages for polynomial-time queries — An ongoing quest
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_100openalex-snapshot
A query language for NC (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_94openalex-snapshot
A restricted second order logic for finite structures
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_3openalex-snapshot
Finite Model Theory and Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_8openalex-snapshot
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_25openalex-snapshot
On the Weisfeiler-Leman Dimension of Fractional Packing
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_9openalex-snapshot
Graph Isomorphism Restricted by Lists
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_17openalex-snapshot
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-88942-5_13openalex-snapshot
Ranking Structured Objects with Graph Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-94876-4_2openalex-snapshot
An Introduction to Graph Neural Networks from a Distributed Computing Perspective
inferred← citeshttps://doi.org/10.1007/978-3-031-14714-2_31openalex-snapshot
Revisiting Attention-Based Graph Neural Networks for Graph Classification
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_18openalex-snapshot
Constraint Satisfaction, Graph Isomorphism, and the Pebbling Comonad
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_17openalex-snapshot
On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_14openalex-snapshot
NP-completeness by First-order and Quantifier-free Interpretations and Related Topics
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_16openalex-snapshot
Linear Algebraic Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_16openalex-snapshot
Complexity of Identifying Fitting-Free Groups
inferred← citeshttps://doi.org/10.1007/978-3-032-22469-9_11openalex-snapshot
Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_32openalex-snapshot
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-12640-1_12openalex-snapshot
Graph Kernels Exploiting Weisfeiler-Lehman Graph Isomorphism Test Extensions
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_11openalex-snapshot
Is Polynomial Time Choiceless?
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_13openalex-snapshot
An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-319-28678-5_2openalex-snapshot
On Symmetric and Choiceless Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_22openalex-snapshot
On the Combinatorial Power of the Weisfeiler-Lehman Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_19openalex-snapshot
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_16openalex-snapshot
A Fixed-Point Logic with Symmetric Choice
inferred← citeshttps://doi.org/10.1007/978-3-540-69937-8_2openalex-snapshot
On the Descriptive Complexity of Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_58openalex-snapshot
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_2openalex-snapshot
Finite Model Theory on Tame Classes of Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_10openalex-snapshot
The Power of Counting Logics on Restricted Classes of Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_12openalex-snapshot
CFI Construction and Balanced Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_4openalex-snapshot
Fixed-Point Definability and Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_17openalex-snapshot
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_28openalex-snapshot
Choiceless Computation and Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_23openalex-snapshot
Randomisation and Derandomisation in Descriptive Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_13openalex-snapshot
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_3openalex-snapshot
Experimental Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_25openalex-snapshot
Pebble Games with Algebraic Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_21openalex-snapshot
On Tractable Parameterizations of Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-36008-4_8openalex-snapshot
Semantic Restrictions over Second-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_6openalex-snapshot
On the Resolution Complexity of Graph Non-isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_13openalex-snapshot
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_10openalex-snapshot
Fixed Point Logics and Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-662-21676-7openalex-snapshot
Bounded Variable Logics and Counting
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_5openalex-snapshot
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_13openalex-snapshot
Limitations of Algebraic Approaches to Graph Isomorphism Testing
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_25openalex-snapshot
Graphs Identified by Logics with Counting
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_12openalex-snapshot
Descriptive Complexity of Graph Spectra
inferred← citeshttps://doi.org/10.1007/978-981-95-8110-8_4openalex-snapshot
Scaling Laws of Deep-Learning Neural Networks: Taxonomy and Survey
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_23openalex-snapshot
Canonization of a Random Circulant Graph by Counting Walks
inferred← citeshttps://doi.org/10.1007/978-981-97-5752-7_6openalex-snapshot
User Behavior Identification via Traffic Analysis in Web 3.0
inferred← citeshttps://doi.org/10.1007/978-981-99-7224-1_3openalex-snapshot
Exploring the Logical Expressiveness of Graph Neural Networks by Establishing a Connection with $$\mathcal {C}_2$$
inferred← citeshttps://doi.org/10.1007/bf01057805openalex-snapshot
Directions in generalized quantifier theory
inferred← citeshttps://doi.org/10.1007/bfb0028560openalex-snapshot
Unary quantifiers, transitive closure, and relations of large degree
inferred← citeshttps://doi.org/10.1007/s00037-016-0147-6openalex-snapshot
Graph Isomorphism, Color Refinement, and Compactness
inferred← citeshttps://doi.org/10.1007/s00037-024-00255-2openalex-snapshot
Combinatorial refinement on circulant graphs
inferred← citeshttps://doi.org/10.1007/s00037-025-00270-xopenalex-snapshot
On a Hierarchy of Spectral Isomorphism Invariants
inferred← citeshttps://doi.org/10.1007/s001530050127openalex-snapshot
Bounded variable logics: two, three, and more
inferred← citeshttps://doi.org/10.1007/s001530050141openalex-snapshot
Vectorization hierarchies of some graph quantifiers
inferred← citeshttps://doi.org/10.1007/s00224-005-1230-6openalex-snapshot
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
inferred← citeshttps://doi.org/10.1007/s00224-016-9686-0openalex-snapshot
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
inferred← citeshttps://doi.org/10.1007/s00224-016-9692-2openalex-snapshot
On Symmetric Circuits and Fixed-Point Logics
inferred← citeshttps://doi.org/10.1007/s00224-020-09990-9openalex-snapshot
On the Expressive Power of Linear Algebra on Graphs
inferred← citeshttps://doi.org/10.1007/s00373-021-02308-7openalex-snapshot
The Weisfeiler–Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw
inferred← citeshttps://doi.org/10.1007/s00373-021-02364-zopenalex-snapshot
On WL-Rank and WL-Dimension of Some Deza Circulant Graphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02683-3openalex-snapshot
The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs
inferred← citeshttps://doi.org/10.1007/s004939970004openalex-snapshot
Equivalence in Finite-Variable Logics is Complete for Polynomial Time
inferred← citeshttps://doi.org/10.1007/s10107-023-01989-7openalex-snapshot
Graph isomorphism: physical resources, optimization models, and algebraic characterizations
inferred← citeshttps://doi.org/10.1007/s10618-026-01277-wopenalex-snapshot
IGA: isomorphism-aware graph alignment for robust unsupervised anchor link prediction
inferred← citeshttps://doi.org/10.1007/s10801-014-0554-1openalex-snapshot
Strongly regular graphs with the $$7$$ 7 -vertex condition
inferred← citeshttps://doi.org/10.1007/s10878-018-0266-xopenalex-snapshot
The QAP-polytope and the graph isomorphism problem
inferred← citeshttps://doi.org/10.1007/s10878-020-00598-wopenalex-snapshot
A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
inferred← citeshttps://doi.org/10.1007/s10958-016-3061-1openalex-snapshot
New Invariants for the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1007/s11280-021-00900-8openalex-snapshot
Powerful graph of graphs neural network for structured entity analysis
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00019-nopenalex-snapshot
Pruning the search tree in the constructive enumeration of molecular graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90048-7openalex-snapshot
An analysis of fixed-point queries on binary trees
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00034-topenalex-snapshot
Reachability and the power of local ordering
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102994openalex-snapshot
Graph isomorphism and multivariate graph spectrum
inferred← citeshttps://doi.org/10.1016/j.apal.2005.04.003openalex-snapshot
Succinct definitions in the first order theory of graphs
inferred← citeshttps://doi.org/10.1016/j.apal.2007.11.011openalex-snapshot
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.018openalex-snapshot
Symbioses between mathematical logic and computer science
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.005openalex-snapshot
Descriptive complexity of graph spectra
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.002openalex-snapshot
The first order definability of graphs: Upper bounds for quantifier depth
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.037openalex-snapshot
Local WL invariance and hidden shades of regularity
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114526openalex-snapshot
Cartesian products of graphs and their coherent configurations
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.01.004openalex-snapshot
Sherali–Adams relaxations of graph isomorphism polytopes
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.04.016openalex-snapshot
Decomposable graphs and definitions with no quantifier alternation
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.11.005openalex-snapshot
Permutation group approach to association schemes
inferred← citeshttps://doi.org/10.1016/j.endm.2005.05.050openalex-snapshot
A new refinement procedure for graph isomorphism algorithms
inferred← citeshttps://doi.org/10.1016/j.endm.2011.10.033openalex-snapshot
On the Limitations of Graph Invariants Inspired by Quantum Walks
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.024openalex-snapshot
Choiceless Polynomial Time, Counting and the Cai–Fürer–Immerman Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104803openalex-snapshot
On the Weisfeiler-Leman dimension of fractional packing
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105224openalex-snapshot
Logical equivalences, homomorphism indistinguishability, and forbidden minors
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105326openalex-snapshot
On algorithms based on finitely many homomorphism counts
inferred← citeshttps://doi.org/10.1016/j.inffus.2025.103558openalex-snapshot
Improving the representational power of graph neural networks via mixed substructure learning
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.09.009openalex-snapshot
Equivariant algorithms for constraint satisfaction problems over coset templates
inferred← citeshttps://doi.org/10.1016/j.is.2018.03.002openalex-snapshot
Grammar-based graph compression
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.04.003openalex-snapshot
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103703openalex-snapshot
On the parallel complexity of group isomorphism via Weisfeiler–Leman
inferred← citeshttps://doi.org/10.1016/j.jcta.2010.06.006openalex-snapshot
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.07.001openalex-snapshot
Spectra of symmetric powers of graphs and the Weisfeiler–Lehman refinements
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.11.002openalex-snapshot
Quantum and non-signalling graph isomorphisms
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.09.005openalex-snapshot
Quantum isomorphism of graphs from association schemes
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.07.003openalex-snapshot
Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101143openalex-snapshot
The μG language for programming graph neural networks
inferred← citeshttps://doi.org/10.1016/j.jnca.2024.104069openalex-snapshot
SAT-Net: A staggered attention network using graph neural networks for encrypted traffic classification
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.06.002openalex-snapshot
The Graph Isomorphism Problem and approximate categories
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.07.003openalex-snapshot
Baby-step giant-step algorithms for the symmetric group
inferred← citeshttps://doi.org/10.1016/j.laa.2009.07.019openalex-snapshot
On the power of combinatorial and spectral invariants
inferred← citeshttps://doi.org/10.1016/j.neunet.2023.09.025openalex-snapshot
Lower and upper bounds for numbers of linear regions of graph convolutional networks
inferred← citeshttps://doi.org/10.1016/j.neunet.2026.108869openalex-snapshot
Permutation-Invariant graph partitioning: How graph neural networks capture structural interactions?
inferred← citeshttps://doi.org/10.1016/j.phpro.2012.03.308openalex-snapshot
A Partition Method for Graph Isomorphism
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.05.003openalex-snapshot
The first order definability of graphs with separators via the Ehrenfeucht game
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115460openalex-snapshot
On the Weisfeiler algorithm of depth-1 stabilization
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00172-5openalex-snapshot
A note on the Kolmogorov data complexity and nonuniform logical definitions
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00042-4openalex-snapshot
Completeness results for graph isomorphism
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00014-5openalex-snapshot
On the geometric graph isomorphism problem
inferred← citeshttps://doi.org/10.1016/s0168-0072(96)00047-4openalex-snapshot
Canonization for two variables and puzzles on the square
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00008-0openalex-snapshot
How to define a linear order on finite models
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00152-9openalex-snapshot
Lower bounds for invariant queries in logics with counting
inferred← citeshttps://doi.org/10.1017/9781009036214.006openalex-snapshot
Recent advances on the graph isomorphism problem
inferred← citeshttps://doi.org/10.1017/9781108924184.003openalex-snapshot
Deep Learning on Graphs: An Introduction
inferred← citeshttps://doi.org/10.1017/9781108924184.006openalex-snapshot
Foundations of Deep Learning
inferred← citeshttps://doi.org/10.1017/9781108924184.010openalex-snapshot
Robust Graph Neural Networks
inferred← citeshttps://doi.org/10.1017/9781108924184.011openalex-snapshot
Scalable Graph Neural Networks
inferred← citeshttps://doi.org/10.1017/9781108924184.012openalex-snapshot
Graph Neural Networks for Complex Graphs
inferred← citeshttps://doi.org/10.1017/9781108924184.013openalex-snapshot
Beyond GNNs: More Deep Models on Graphs
inferred← citeshttps://doi.org/10.1017/9781108924184.015openalex-snapshot
Graph Neural Networks in Natural Language Processing
inferred← citeshttps://doi.org/10.1017/9781108924184.016openalex-snapshot
Graph Neural Networks in Computer Vision
inferred← citeshttps://doi.org/10.1017/9781108924184.017openalex-snapshot
Graph Neural Networks in Data Mining
inferred← citeshttps://doi.org/10.1017/9781108924184.018openalex-snapshot
Graph Neural Networks in Biochemistry and Health Care
inferred← citeshttps://doi.org/10.1017/9781108924184.020openalex-snapshot
Advanced Topics in Graph Neural Networks
inferred← citeshttps://doi.org/10.1017/9781108924184.021openalex-snapshot
Advanced Applications in Graph Neural Networks
inferred← citeshttps://doi.org/10.1017/9781139028868openalex-snapshot
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
inferred← citeshttps://doi.org/10.1017/jsl.2015.28openalex-snapshot
PEBBLE GAMES AND LINEAR EQUATIONS
inferred← citeshttps://doi.org/10.1017/jsl.2018.33openalex-snapshot
RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!
inferred← citeshttps://doi.org/10.1017/s096354832510028xopenalex-snapshot
Canonization of a random circulant graph by counting walks
inferred← citeshttps://doi.org/10.1021/ci010121yopenalex-snapshot
Exploring the Limits of Graph Invariant- and Spectrum-Based Discrimination of (Sub)structures
inferred← citeshttps://doi.org/10.1023/a:1008215718090openalex-snapshot
Definability of Polyadic Lifts of Generalized Quantifiers
inferred← citeshttps://doi.org/10.1023/a:1018672019177openalex-snapshot
On a New High Dimensional Weisfeiler-Lehman Algorithm
inferred← citeshttps://doi.org/10.1063/1.5024797openalex-snapshot
Predicting molecular properties with covariant compositional networks
inferred← citeshttps://doi.org/10.1090/conm/558/11050openalex-snapshot
Logical complexity of graphs: A survey
inferred← citeshttps://doi.org/10.1090/dimacs/031/01openalex-snapshot
Easier ways to win logical games
inferred← citeshttps://doi.org/10.1090/spmj/1684openalex-snapshot
On the separability of cyclotomic schemes over finite fields
inferred← citeshttps://doi.org/10.1093/jigpal/6.4.601openalex-snapshot
Computational model theory: an overview
inferred← citeshttps://doi.org/10.1093/jigpal/8.5.605openalex-snapshot
Finite and infinite model theory - a historical perspective
inferred← citeshttps://doi.org/10.1093/logcom/exac058openalex-snapshot
Limitations of the invertible-map equivalences
inferred← citeshttps://doi.org/10.1093/logcom/exz022openalex-snapshot
Definable inapproximability: new challenges for duplicator
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.001.0001openalex-snapshot
Fragments of First-Order Logic
showing the first 200 of 471 · page through all 471
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.