On the public citation graph
Operations with structures
0 signed · 190 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.4064/cm-14-1-1-32openalex-snapshot
The unique factorization problem for finite relational structures
inferredcites →https://doi.org/10.4064/fm-55-3-249-281openalex-snapshot
Refinement properties for relational structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20461openalex-snapshot
On recognizing graphs by numbers of homomorphisms
inferred← citeshttps://doi.org/10.1002/jgt.21846openalex-snapshot
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
inferred← citeshttps://doi.org/10.1002/jgt.70094openalex-snapshot
Explicit 3‐colorings for Exponential Graphs
inferred← citeshttps://doi.org/10.1002/rsa.21002openalex-snapshot
Graphon convergence of random cographs
inferred← citeshttps://doi.org/10.1006/jctb.2000.1970openalex-snapshot
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)
inferred← citeshttps://doi.org/10.1006/jtbi.2003.3150openalex-snapshot
Quasi-Independence, Homology and the Unity of Type: A Topological Theory of Characters
inferred← citeshttps://doi.org/10.1007/11786986_5openalex-snapshot
On Counting Homomorphisms to Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_18openalex-snapshot
Counting Graph Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_26openalex-snapshot
Color Refinement, Homomorphisms, and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_10openalex-snapshot
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-030-93736-2_17openalex-snapshot
Graph Homomorphism Features: Why Not Sample?
inferred← citeshttps://doi.org/10.1007/978-3-031-10736-8_2openalex-snapshot
Discrete Density Comonads and Graph Parameters
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_15openalex-snapshot
Some Thoughts on Graph Similarity
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_53openalex-snapshot
The Complexity of the Counting Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_13openalex-snapshot
Many Facets of Dualities
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_47openalex-snapshot
Classification of a Class of Counting Problems Using Holographic Reductions
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_8openalex-snapshot
Counting Subgraphs via Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_24openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_56openalex-snapshot
Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_16openalex-snapshot
On Tractable Exponential Sums
inferred← citeshttps://doi.org/10.1007/978-3-642-18734-6_12openalex-snapshot
The Topology of Evolutionary Biology
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_1openalex-snapshot
Progress in Complexity of Counting Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-31770-5_30openalex-snapshot
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_1openalex-snapshot
Complexity Dichotomy for Counting Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_23openalex-snapshot
Holographic Algorithms Beyond Matchgates
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_43openalex-snapshot
Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_52openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_10openalex-snapshot
On Edge-maps whose Inverse Preserves Flows or Tensions
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_1openalex-snapshot
Arithmetic of Ordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-009-7798-3_2openalex-snapshot
Exponentiation and Duality
inferred← citeshttps://doi.org/10.1007/bf02018391openalex-snapshot
A characterization of cancellablek-ary structures
inferred← citeshttps://doi.org/10.1007/bf02029172openalex-snapshot
On the cancellation law among finite relational structures
inferred← citeshttps://doi.org/10.1007/bf02488013openalex-snapshot
Algebras in permutable varieties: Geometrical properties of affine algebras
inferred← citeshttps://doi.org/10.1007/bf02945043openalex-snapshot
A method for obtaining refinement theorems, with an application to direct products of semigroups
inferred← citeshttps://doi.org/10.1007/bfb0037431openalex-snapshot
Recognizing graph products and bundles
inferred← citeshttps://doi.org/10.1007/bfb0066431openalex-snapshot
A survey of the reconstruction conjecture
inferred← citeshttps://doi.org/10.1007/s00037-024-00253-4openalex-snapshot
Algebraic Global Gadgetry for Surjective Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/s00224-011-9327-6openalex-snapshot
Containment of Conjunctive Queries on Annotated Relations
inferred← citeshttps://doi.org/10.1007/s00224-020-09983-8openalex-snapshot
Dichotomy for Holant∗ Problems on the Boolean Domain
inferred← citeshttps://doi.org/10.1007/s00373-025-02907-8openalex-snapshot
Graph Profiles as Characters on Bicommutative Hopf Algebras
inferred← citeshttps://doi.org/10.1007/s00493-021-4336-9openalex-snapshot
Fractional Isomorphism of Graphons
inferred← citeshttps://doi.org/10.1007/s10994-025-06815-zopenalex-snapshot
Improving graph neural networks through feature importance learning
inferred← citeshttps://doi.org/10.1007/s40687-025-00513-xopenalex-snapshot
The set-theoretic Yang–Baxter equation, Kimura semigroups and functional graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90041-9openalex-snapshot
On a multiplicative graph function conjecture
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90280-sopenalex-snapshot
Finding the prime factors of strong direct product graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00298-wopenalex-snapshot
Lattices arising in categorial investigations of Hedetniemi's conjecture
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00078-bopenalex-snapshot
Cancellation among finite unary algebras
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102994openalex-snapshot
Graph isomorphism and multivariate graph spectrum
inferred← citeshttps://doi.org/10.1016/j.aim.2022.108712openalex-snapshot
Polyadic sets and homomorphism counting
inferred← citeshttps://doi.org/10.1016/j.aim.2025.110598openalex-snapshot
Semisimple field theories detect stable diffeomorphism
inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100352openalex-snapshot
In praise of homomorphisms
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.006openalex-snapshot
Unique list-colourability and the fixing chromatic number of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.009openalex-snapshot
Chromatic numbers and products
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.055openalex-snapshot
A surprising permanence of old motivations (a not-so-rigid story)
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.04.012openalex-snapshot
The rank of connection matrices and the dimension of graph algebras
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.03.012openalex-snapshot
Distinguishing graphs by their left and right homomorphism profiles
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.03.011openalex-snapshot
Strengthening topological colorful results for graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.065openalex-snapshot
Counting Homomorphisms to Sparse Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2018.01.002openalex-snapshot
Holographic algorithms beyond matchgates
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.ic.2026.105421openalex-snapshot
Dichotomy for Holant* problems with one ternary function on domain size 3
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.11.036openalex-snapshot
Quantum automorphisms of matroids
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.09.002openalex-snapshot
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
inferred← citeshttps://doi.org/10.1016/j.jcta.2012.12.008openalex-snapshot
On the number of pentagons in triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.05.002openalex-snapshot
Limits of dense graph sequences
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/s0012-365x(01)00102-9openalex-snapshot
The level of nonmultiplicativity of graphs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80908-3openalex-snapshot
Monoid-labeled transition systems
inferred← citeshttps://doi.org/10.1017/9781009036214.006openalex-snapshot
Recent advances on the graph isomorphism problem
inferred← citeshttps://doi.org/10.1017/nws.2014.14openalex-snapshot
Generalized graphlet kernels for probabilistic inference in sparse graphs
inferred← citeshttps://doi.org/10.1017/s0963548321000286openalex-snapshot
Perfect matchings, rank of connection tensors and graph homomorphisms
inferred← citeshttps://doi.org/10.1023/a:1006457114427openalex-snapshot
Arithmetic of Finite Ordered Sets: Cancellation of Exponents, I
inferred← citeshttps://doi.org/10.1023/b:orde.0000026529.04361.f8openalex-snapshot
The Zig-Zag Property and Exponential Cancellation of Ordered Sets
inferred← citeshttps://doi.org/10.1073/pnas.2416552123openalex-snapshot
The role of fibration symmetries in geometric deep learning
inferred← citeshttps://doi.org/10.1080/03081087.2017.1373733openalex-snapshot
Constructing cospectral graphs via a new form of graph product
inferred← citeshttps://doi.org/10.1090/conm/798/15984openalex-snapshot
Advances in quantum permutation groups
inferred← citeshttps://doi.org/10.1090/noti2415openalex-snapshot
Was Gelfand Right? The Many Loves of Lattice Theory
inferred← citeshttps://doi.org/10.1090/s0894-0347-08-00614-0openalex-snapshot
The structure of locally finite varieties with polynomially many models
inferred← citeshttps://doi.org/10.1093/logcom/exae082openalex-snapshot
Modal logic with relations over paths: A theoretical development through comonadic semantics
inferred← citeshttps://doi.org/10.1109/ccc.2011.32openalex-snapshot
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00067openalex-snapshot
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00106openalex-snapshot
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1109/lics.2006.6openalex-snapshot
A Characterisation of First-Order Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/lics.2017.8005085openalex-snapshot
The logic of counting query answers
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470543openalex-snapshot
On the Expressive Power of Homomorphism Counts
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470609openalex-snapshot
Lovász-Type Theorems and Game Comonads
inferred← citeshttps://doi.org/10.1109/tpami.2025.3608902openalex-snapshot
Reinterpreting Hypergraph Kernels: Insights Through Homomorphism Analysis
inferred← citeshttps://doi.org/10.1137/070690201openalex-snapshot
The Complexity of Weighted Boolean #CSP
inferred← citeshttps://doi.org/10.1137/1.9781611973105.93openalex-snapshot
Dichotomy for Holant Problems with a Function on Domain Size 3
inferred← citeshttps://doi.org/10.1137/1.9781611975482.30openalex-snapshot
Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms
inferred← citeshttps://doi.org/10.1137/1.9781611976465.138openalex-snapshot
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch87openalex-snapshot
Weisfeiler-Leman and Graph Spectra
inferred← citeshttps://doi.org/10.1137/100789403openalex-snapshot
Counting Subgraphs via Homomorphisms
inferred← citeshttps://doi.org/10.1137/100811258openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1137/110840194openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.1137/15m1020551openalex-snapshot
Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard
inferred← citeshttps://doi.org/10.1137/15m1032314openalex-snapshot
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.1137/15m1049798openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
inferred← citeshttps://doi.org/10.1137/17m113304xopenalex-snapshot
The Complexity of Boolean Holant Problems with Nonnegative Weights
inferred← citeshttps://doi.org/10.1137/17m1153182openalex-snapshot
The Complexity of Counting Surjective Homomorphisms and Compactions
inferred← citeshttps://doi.org/10.1145/1314690.1314691openalex-snapshot
On counting homomorphisms to directed acyclic graphs
inferred← citeshttps://doi.org/10.1145/1514894.1514930openalex-snapshot
Containment of conjunctive queries on annotated relations
inferred← citeshttps://doi.org/10.1145/2090236.2090272openalex-snapshot
Gadgets and anti-gadgets leading to a complexity dichotomy
inferred← citeshttps://doi.org/10.1145/2488608.2488687openalex-snapshot
A complete dichotomy rises from the capture of vanishing signatures
inferred← citeshttps://doi.org/10.1145/2635825openalex-snapshot
The complexity of counting homomorphisms to cactus graphs modulo 2
inferred← citeshttps://doi.org/10.1145/2898441openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.1145/3055399.3055502openalex-snapshot
Homomorphisms are a good basis for counting small subgraphs
inferred← citeshttps://doi.org/10.1145/3305272openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
inferred← citeshttps://doi.org/10.1145/3373718.3394739openalex-snapshot
Counting Bounded Tree Depth Homomorphisms
inferred← citeshttps://doi.org/10.1145/3375395.3387641openalex-snapshot
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data
inferred← citeshttps://doi.org/10.1145/3448641openalex-snapshot
On a Theorem of Lovász that (&sdot, H ) Determines the Isomorphism Type of H
inferred← citeshttps://doi.org/10.1145/3460958openalex-snapshot
Counting Homomorphisms to Trees Modulo a Prime
inferred← citeshttps://doi.org/10.1145/3517804.3524168openalex-snapshot
Determinacy of Real Conjunctive Queries. The Boolean Case
inferred← citeshttps://doi.org/10.1145/3531130.3533335openalex-snapshot
The Pebble-Relation Comonad in Finite Model Theory
inferred← citeshttps://doi.org/10.1145/3564246.3585173openalex-snapshot
The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3
inferred← citeshttps://doi.org/10.1145/3632184openalex-snapshot
Bounded Degree Nonnegative Counting CSP
inferred← citeshttps://doi.org/10.1145/3687256.3687260openalex-snapshot
An Invitation to Game Comonads
inferred← citeshttps://doi.org/10.1145/3689486openalex-snapshot
Planar #CSP Equality Corresponds to Quantum Isomorphism – A Holant Viewpoint
inferred← citeshttps://doi.org/10.1145/3798129.3800779openalex-snapshot
Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
inferred← citeshttps://doi.org/10.1145/3848505openalex-snapshot
A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs
inferred← citeshttps://doi.org/10.11606/d.45.2008.tde-07082008-105246openalex-snapshot
Homomorfismos de grafos
inferred← citeshttps://doi.org/10.11650/twjm/1500406890openalex-snapshot
A SURVEY ON HEDETNIEMI'S CONJECTURE
inferred← citeshttps://doi.org/10.11650/twjm/1500407157openalex-snapshot
ASPECTS OF STRUCTURAL COMBINATORICS (Graph Homomorphisms and Their Use)
inferred← citeshttps://doi.org/10.1215/ijm/1256045973openalex-snapshot
Isomorphisms of incidence rings
inferred← citeshttps://doi.org/10.13140/rg.2.2.35278.20801openalex-snapshot
Calculation Rules and Cancellation Rules for Strong Hom-Schemes
inferred← citeshttps://doi.org/10.1515/jgth-2019-0071openalex-snapshot
The isomorphism problem for group algebras: A criterion
inferred← citeshttps://doi.org/10.18154/rwth-2021-07044openalex-snapshot
Graph Similarity and Homomorphism Densities
inferred← citeshttps://doi.org/10.19086/aic.2025.4openalex-snapshot
Homomorphism Tensors and Linear Equations
inferred← citeshttps://doi.org/10.20944/preprints202405.1667.v1openalex-snapshot
Adjacency Matrix for the Graph Exponential
inferred← citeshttps://doi.org/10.20944/preprints202405.1720.v1openalex-snapshot
Number of Components in the Graph Exponential with Complete Graph Exponents
inferred← citeshttps://doi.org/10.21136/cpm.1989.118364openalex-snapshot
A remark on cancellation in direct products of graphs
inferred← citeshttps://doi.org/10.21136/mb.2003.133930openalex-snapshot
On a cancellation law for monounary algebras
inferred← citeshttps://doi.org/10.2140/pjm.1999.187.201openalex-snapshot
The isomorphism problem for incidence rings
inferred← citeshttps://doi.org/10.2307/2273901openalex-snapshot
The contributions of Alfred Tarski to general algebra
inferred← citeshttps://doi.org/10.31274/rtd-180813-12503openalex-snapshot
Hypercubes, median graphs and products of graphs: some algorithmic and combinatorial results
inferred← citeshttps://doi.org/10.4153/cjm-1978-068-xopenalex-snapshot
A Logarithmic Property for Exponents of Partially Ordered Sets
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.31openalex-snapshot
A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties
inferred← citeshttps://doi.org/10.4230/lipics.esa.2017.63openalex-snapshot
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.17openalex-snapshot
On a Theorem of Lovász that $\hom(\cdot, H)$ Determines the Isomorphism Type of $H$
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2023.79openalex-snapshot
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.261openalex-snapshot
The #CSP Dichotomy is Decidable
inferred← citeshttps://doi.org/10.46298/lmcs-20(2:9)2024openalex-snapshot
The Pebble-Relation Comonad in Finite Model Theory
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2342openalex-snapshot
Partial profiles of quasi-complete graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0903.4728openalex-snapshot
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1003.3879openalex-snapshot
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5659openalex-snapshot
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3383openalex-snapshot
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6445openalex-snapshot
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
inferred← citeshttps://doi.org/10.48550/arxiv.1307.7430openalex-snapshot
Holographic Algorithms Beyond Matchgates
inferred← citeshttps://doi.org/10.48550/arxiv.1412.3493openalex-snapshot
Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings
inferred← citeshttps://doi.org/10.48550/arxiv.1501.07539openalex-snapshot
Counting Homomorphisms to Square-Free Graphs, Modulo 2
inferred← citeshttps://doi.org/10.48550/arxiv.1710.00234openalex-snapshot
Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one
inferred← citeshttps://doi.org/10.48550/arxiv.1906.11758openalex-snapshot
Generalized One-to-One Mappings between Homomorphism Sets of Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.01214openalex-snapshot
Graph Homomorphism Convolution
inferred← citeshttps://doi.org/10.48550/arxiv.2005.03255openalex-snapshot
An Issue Raised in 1978 by a Then-Future Editor-in-Chief of the Journal "Order": Does the Endomorphism Poset of a Finite Connected Poset Tell Us That the Poset Is Connected?
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03279openalex-snapshot
Criteria for the less-equal-relation between partial Lovász-vectors of digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2104.04040openalex-snapshot
Scaling up graph homomorphism for classification via sampling
inferred← citeshttps://doi.org/10.48550/arxiv.2106.06707openalex-snapshot
Graph Neural Networks with Local Graph Parameters
inferred← citeshttps://doi.org/10.48550/arxiv.2107.00874openalex-snapshot
Homomorphism counts in robustly sparse graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0403057openalex-snapshot
The complete dimension theory of partially ordered systems with equivalence and orthogonality
inferred← citeshttps://doi.org/10.5486/pmd.2002.2600openalex-snapshot
On powers of relational structures
inferred← citeshttps://doi.org/10.7151/dmgaa.1074openalex-snapshot
Isomorphisms of direct products of lattice-ordered groups
inferred← citeshttps://doi.org/10.7151/dmgaa.1123openalex-snapshot
Lattices of relative colour-families and antivarieties
inferred← citeshttps://doi.org/10.7151/dmgt.1175openalex-snapshot
Families of strongly projective graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2186openalex-snapshot
Graph exponentiation and neighborhood reconstruction
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.