Pith. sign in

REVIEW 4 minor 49 references

Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width

T0 review · 0 major / 4 minor · reviewed 2026-07-10 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Two relational structures are k-RCR-indistinguishable exactly when they agree on all homomorphism counts from structures of generalised hypertreewidth at most k.

desk verdict They close Scheidt's open problem for every k and ship a direct HyperOWL that also gives constructive GHW-k counting; the non-pure case is handled carefully and the proofs look solid. read the letter →

arxiv 2607.07934 v1 pith:2HKXQPI2 submitted 2026-07-08 cs.DS

Panagiotis Aivasiliotis , Andreas Göbel , Matthias Lanzinger , Marc Roth This is my paper · ORCID
classification cs.DS MSC 68Q2568R1005C6003B70
keywords Weisfeiler-LemanhomomorphismindistinguishabilitygeneralisedhypertreewidthrelationalcolourrefinementHyperOWLfractionalstructures
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper lifts the classic equivalence between the k-dimensional Weisfeiler–Leman algorithm and homomorphism counts from treewidth-k graphs to the setting of higher-arity relational structures. It defines k-RCR, a natural colour-refinement procedure on multi-coloured tuples of length at most k, and proves that two structures are distinguished by k-RCR if and only if some connected structure of generalised hypertreewidth ≤ k has different homomorphism numbers into them. A fractional analogue does the same for a pure variant of fractional hypertreewidth. The authors also introduce k-HyperOWL, the first WL-style algorithm that works directly on the relational structure (without first reducing to a binary graph), runs in time linear in |A|^{k+1} per iteration, matches the distinguishing power of k-RCR, and yields a constructive counting algorithm for homomorphisms from any GHW-≤k source. The result matters because generalised hypertreewidth is the central tractability parameter for constraint satisfaction and database query evaluation; the paper therefore supplies a uniform combinatorial, logical and algorithmic dictionary between colour refinement, width measures and counting for arbitrary-arity data.

What carries the argument

k-RCR together with the binary structures induced by generalised hypertree decompositions (and the associated k-exploded encodings). These binary structures translate both the colour-refinement process and the homomorphism counts into ordinary 1-WL and tree-homomorphism counts, so the classical Dell–Grohe–Rattan theorem applies.

What would settle it

Exhibit a concrete pair of small-signature structures that receive identical stable k-RCR colour multiplicities yet differ by at least one homomorphism count from a connected structure whose generalised hypertreewidth is known to be exactly k (or vice versa).

Watch

Extended reading notes

Core claim

For every fixed signature and every k ≥ 1, two structures are indistinguishable by the k-dimensional relational colour-refinement algorithm if and only if they receive the same number of homomorphisms from every connected structure of generalised hypertreewidth at most k. The same equivalence holds for a fractional version of the algorithm with respect to pure fractional hypertreewidth.

Load-bearing premise

The bijection between natural extensions of homomorphisms continues to hold for non-pure decompositions even after dummy symbols mark elements that are covered by a bag but lie outside it.

Editorial extensions

If this is right

  • The stable colouring of k-HyperOWL can be used as a preprocessing step that reduces homomorphism counting from any GHW-≤k source to a simple sum over colour classes.
  • k-HyperOWL itself runs in O(t·|A|^{k+1}) time and is at least as expressive as k-RCR, giving a practical direct algorithm on relational data.
  • The same correspondence holds for the fractional variant with pure fractional hypertreewidth, linking colour refinement to the current frontier of polynomial-time CSP algorithms.
  • Any future logical or machine-learning characterisation of k-RCR automatically inherits an exact characterisation in terms of GHW-bounded homomorphism counts.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The direct HyperOWL colouring suggests a natural higher-arity message-passing architecture whose expressivity is governed by generalised hypertreewidth rather than Gaifman-treewidth.
  • The equivalence supplies a concrete route to a counting-logic characterisation of GHW-bounded formulas, analogous to the known C^{k+1} characterisation of ordinary k-WL.
  • The same technique may yield analogous equivalences for other covering-based width measures (e.g., fractional edge-cover width of the whole structure) once suitable “pure” or “semi-pure” restrictions are identified.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper introduces k-RCR, a k-dimensional relational colour-refinement algorithm on multi-coloured tuples, and proves that two σ-structures are k-RCR-indistinguishable if and only if they admit the same homomorphism counts from all connected structures of generalised hypertreewidth at most k (Theorem 1.2). An analogous characterisation is obtained for a fractional variant (k-frac-RCR) with respect to semi-pure fractional hypertreewidth (Theorem 1.3). The proofs reduce both algorithms to ordinary 1-WL on carefully defined k-exploded binary encodings, invoke the known tree characterisation of 1-WL, and lift the counts back via pure and non-pure (full) generalised/fractional hypertree decompositions. A third algorithm, k-HyperOWL, is defined that works directly on k-coverable rk-tuples of the input structure; it is shown to be at least as expressive as k-RCR, to run in time O(t |A|^{k+1}), and to yield a constructive dynamic-programming routine for counting homomorphisms from structures of GHW ≤ k.

Significance. The work cleanly closes the open problem posed by Scheidt for all k ≥ 1 and supplies the first direct relational WL algorithm that does not route through a rank-2 encoding. The equivalences link an algorithmic width measure (GHW / fractional hypertreewidth) that is central to CSP and database theory with a colour-refinement procedure, thereby generalising the Dell–Grohe–Rattan theorem beyond graphs. The HyperOWL colouring further yields a practical preprocessing step for homomorphism counting that extends the recent Lanzinger–Barceló result from arity 2 to arbitrary rank. The technical development is self-contained, the reductions are explicit, and the running-time bound is tight enough for algorithmic use.

minor comments (4)
  1. Several typographical slips appear in the abstract and introduction (“insdistinguishable”, “hypertreewdith”, “indistinguishabily”). A global spell-check would remove them.
  2. Definition 1.8 / 3.4: the multiset notation {{·}} is used both for ordinary multisets and for the colour-update rule; a short clarifying sentence would help readers unfamiliar with the Scheidt–Schweikardt convention.
  3. Lemma 5.10: the factor (rk)^{rk} is written without parentheses in one place; the asymptotic claim is clear but the typesetting should be uniform.
  4. The relationship between pure, semi-pure and ordinary fractional hypertreewidth is stated correctly, yet a one-sentence remark on whether the semi-pure restriction is known to be without loss of generality for the homomorphism-counting problem would be welcome.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: equivalences are derived from first-principles constructions of exploded encodings, GHD-induced binary structures, and colour-class bijections.

full rationale

The paper's central claims (Theorems 1.2 and 1.3, Corollary 1.6) are proved by explicit constructions: k-exploded encodings B(A,k) and F(A,k) that reduce k-RCR / k-frac-RCR to ordinary 1-WL (Propositions 3.10, 4.8), binary structures A_D induced by (semi-)pure full GHDs/FHDs, and a BFS matching of stable colour-class indices that produces a bijection between natural D-extensions (Lemmas 3.17, 4.17). The pure direction uses the exact equality #Hom(A_D, B(B,k)) = #Hom(A,B) (Lemma 3.20) together with a print construction that recovers a pure GHD from a distinguishing tree (Lemma 3.22). HyperOWL is defined directly on k-coverable tuples and shown to dominate k-RCR by a dynamic-programming argument over nice hypertree decompositions (Theorem 5.18). All steps are self-contained mathematical arguments; the only external inputs are the classical Dell–Grohe–Rattan / Dvořák characterisation of 1-WL (Theorem 1.16 / 3.21) and standard facts about hypertree decompositions. No parameters are fitted, no uniqueness theorem is imported from the authors' own prior work as a load-bearing premise, and no quantity is redefined as its own prediction. The derivation is therefore free of circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 4 invented entities

The work rests entirely on standard definitions of relational structures, homomorphisms, generalised and fractional hypertree decompositions, and the known 1-WL characterisation for binary structures. No free parameters are fitted; the only domain assumptions are the usual finiteness and absence of isolated elements. The invented entities are the three new colouring procedures and the exploded encodings needed to reduce them to 1-WL.

assumptions (3)
  • standard math Two binary structures are 1-WL-equivalent iff they are homomorphism-indistinguishable over trees (Dell-Grohe-Rattan / Dvořák).
    Invoked as Theorem 1.16 / 3.21 to transfer indistinguishability from the exploded encodings back to the original structures.
  • domain assumption Every GHD (resp. FHD) can be made full while preserving width (Remark 2.4).
    Used throughout Sections 3 and 4 to guarantee that every coloured tuple appears in some bag of the decomposition.
  • domain assumption Structures contain no isolated domain elements (Remark 2.1 / 3.1).
    Ensures that bags cover the whole domain and that natural D-extensions are unique.
invented entities (4)
  • k-RCR colouring on multi-coloured tuples MCT_k(A)
    purpose: Provide a relational colour-refinement procedure whose stable colour multiplicities characterise GHW-k homomorphism indistinguishability.
    Defined in Definition 3.4; the whole of Theorem 1.2 rests on it.
  • k-frac-RCR on fractionally coverable multi-tuples
    purpose: Analogous characterisation for pure fractional hypertreewidth.
    Defined in Definition 4.4; used for Theorem 1.3.
  • k-HyperOWL operating directly on k-coverable r k-tuples
    purpose: First direct higher-arity WL algorithm with matching expressivity and an explicit counting application.
    Defined in Definition 5.9; yields Theorem 1.5 and Corollary 1.6.
  • Canonical k-exploded binary encoding B(A,k) and its profile-split variant
    purpose: Reduce k-RCR equivalence to ordinary 1-WL equivalence on binary structures.
    Definitions 3.7-3.8; central technical device of Propositions 3.9-3.10.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width." pith.science (2026). https://pith.science/paper/2HKXQPI2

@misc{pith2026260707934,
  author       = {Pith},
  title        = {Pith review of: Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2HKXQPI2}},
  note         = {Machine review of arXiv:2607.07934}
}
abstract

The Weisfeiler--Leman (WL) algorithm is one of the most influential heuristics for the graph isomorphism problem. The expressive power of WL has been extensively studied in the contexts of descriptive complexity, logics, graph neural networks, and the theory of homomorphism indistinguishabily. Notably, two graphs are indistinguishable by the $k$-dimensional WL algorithm if and only if they are indistinguishable by homomorphism-counts from graphs of treewidth at most $k$. An intrinsic question is to find a natural version of the WL algorithm for relational structures of higher arity admitting an equivalent characterisation via homomorphism indistinguishability along bounded generalised hypertree width (GHW). Scheidt and Schweikardt solved this for $k=1$ by defining the RCR algorithm and showing indistinguishability from $\alpha$-acyclic structures. In this work, we resolve this for all $k\ge1$: we develop $k$-RCR and show that two structures $\mathcal{A}$ and $\mathcal{B}$ are insdistinguishable by $k$-RCR if and only if they have the same homomorphism-counts from all structures $\mathcal{C}$ of generalised hypertreewidth $\le k$. Moreover, we introduce a ``fractional'' version of $k$-RCR and show that two structures are insdistinguishable by fractional $k$-RCR if and only if they have the same homomorphism-counts from all structures with (a variant of) fractional hypertreewidth at most $k$. Last, we develop $k$-HyperOWL, the first relational WL algorithm operating directly on a relational structure. We show that $k$-HyperOWL is as expressive as $k$-RCR and that, given a structure $\mathcal{A}$, $k$-HyperOWL can compute $t$ iterative refinements in time $O(t|\mathcal{A}|^{k+1})$. Moreover, the colouring produced by $k$-HyperOWL can be used as a constructive preprocessing routine for counting homomorphisms from structures of generalised hypertreewidth $\le k$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages

  1. [1]

    On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters

    Matthias Lanzinger and Pablo Barcel. On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters , journal =. 2023 , url =. doi:10.48550/ARXIV.2309.17053 , eprinttype =. 2309.17053 , timestamp =

    work page Pith review arXiv doi:10.48550/arxiv.2309.17053 2023

  2. [2]

    Weisfeiler and Leman Go Relational , booktitle =

    Pablo Barcel. Weisfeiler and Leman Go Relational , booktitle =. 2022 , url =

    work page 2022

  3. [3]

    50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) , pages =

    Scheidt, Benjamin and Schweikardt, Nicole , title =. 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025) , pages =. 2025 , volume =. doi:10.4230/LIPIcs.MFCS.2025.88 , annote =

    work page doi:10.4230/lipics.mfcs.2025.88 2025

  4. [4]

    On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties , booktitle =

    Vikraman Arvind and Frank Fuhlbr. On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties , booktitle =. 2019 , url =. doi:10.1007/978-3-030-25027-0\_8 , timestamp =

    work page doi:10.1007/978-3-030-25027-0 2019

  5. [5]

    Counting Small Induced Subgraphs: Hardness via Fourier Analysis , booktitle =

    Radu Curticapean and Daniel Neuen , editor =. Counting Small Induced Subgraphs: Hardness via Fourier Analysis , booktitle =. 2025 , url =. doi:10.1137/1.9781611978322.122 , timestamp =

    work page doi:10.1137/1.9781611978322.122 2025

  6. [6]

    2026 , eprint=

    Color Refinement for Relational Structures , author=. 2026 , eprint=

    work page 2026

  7. [7]

    Fomin and Lukasz Kowalik and Daniel Lokshtanov and D

    Marek Cygan and Fedor V. Fomin and Lukasz Kowalik and Daniel Lokshtanov and D. Parameterized Algorithms , publisher =. 2015 , url =. doi:10.1007/978-3-319-21275-3 , isbn =

    work page doi:10.1007/978-3-319-21275-3 2015

  8. [8]

    Color Refinement, Homomorphisms, and Hypergraphs , booktitle =

    Jan B. Color Refinement, Homomorphisms, and Hypergraphs , booktitle =. 2019 , url =. doi:10.1007/978-3-030-30786-8\_26 , timestamp =

    work page doi:10.1007/978-3-030-30786-8 2019

Show all 49 references
  1. [9]

    36th Annual

    Martin Grohe , title =. 36th Annual. 2021 , url =. doi:10.1109/LICS52264.2021.9470677 , timestamp =

    2021 doi

  2. [10]

    Reinhard Pichler and Sebastian Skritek , title =. J. Comput. Syst. Sci. , volume =. 2013 , url =. doi:10.1016/J.JCSS.2013.01.012 , timestamp =

    2013 doi

  3. [11]

    45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) , pages =

    Dell, Holger and Grohe, Martin and Rattan, Gaurav , title =. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) , pages =. 2018 , volume =. doi:10.4230/LIPIcs.ICALP.2018.40 , annote =

    2018 doi

  4. [12]

    Journal of Graph Theory , volume=

    On recognizing graphs by numbers of homomorphisms , author=. Journal of Graph Theory , volume=. 2010 , publisher=

    2010

  5. [13]

    nti, Series , volume=

    The reduction of a graph to canonical form and the algebra which appears therein , author=. nti, Series , volume=

  6. [14]

    Constraint Solving via Fractional Edge Covers , journal =

    Martin Grohe and D. Constraint Solving via Fractional Edge Covers , journal =. 2014 , url =. doi:10.1145/2636918 , timestamp =

    2014 doi

  7. [15]

    Generalized hypertree decompositions: NP-hardness and tractable variants , journal =

    Georg Gottlob and Zolt. Generalized hypertree decompositions: NP-hardness and tractable variants , journal =. 2009 , url =. doi:10.1145/1568318.1568320 , timestamp =

    2009 doi

  8. [16]

    Georg Gottlob and Nicola Leone and Francesco Scarcello , title =. J. Comput. Syst. Sci. , volume =. 2002 , url =. doi:10.1006/JCSS.2001.1809 , timestamp =

    2002 doi

  9. [17]

    Ronald Fagin , title =. J. 1983 , url =. doi:10.1145/2402.322390 , timestamp =

    1983 doi

  10. [18]

    2023 , url =

    Wenwen Xia and Yuchen Li and Shenghong Li , title =. 2023 , url =. doi:10.1109/TKDE.2022.3223471 , timestamp =

    2023 doi

  11. [19]

    Bronstein , title =

    Giorgos Bouritsas and Fabrizio Frasca and Stefanos Zafeiriou and Michael M. Bronstein , title =. 2023 , url =. doi:10.1109/TPAMI.2022.3154319 , timestamp =

    2023 doi

  12. [20]

    Proceedings of the ACM on Management of Data , volume=

    The Weisfeiler-Leman dimension of conjunctive queries , author=. Proceedings of the ACM on Management of Data , volume=. 2024 , publisher=

    2024

  13. [21]

    and Lander, E

    Immerman, N. and Lander, E. , title =. Complexity Theory Retrospective , editor =. 1990 , doi =

    1990

  14. [22]

    The Complexity of Homomorphism Indistinguishability , booktitle =

    Jan B. The Complexity of Homomorphism Indistinguishability , booktitle =. 2019 , url =. doi:10.4230/LIPICS.MFCS.2019.54 , timestamp =

    2019 doi

  15. [23]

    Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity , year =

    Focke, Jacob and Goldberg, Leslie Ann and Roth, Marc and. Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity , year =. doi:10.1145/3771726 , note =

    doi

  16. [24]

    An Algorithmic Meta Theorem for Homomorphism Indistinguishability , booktitle =

    Tim Seppelt , editor =. An Algorithmic Meta Theorem for Homomorphism Indistinguishability , booktitle =. 2024 , url =. doi:10.4230/LIPICS.MFCS.2024.82 , timestamp =

    2024 doi

  17. [25]

    Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors , booktitle =

    Tim Seppelt , editor =. Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors , booktitle =. 2023 , url =. doi:10.4230/LIPICS.MFCS.2023.82 , timestamp =

    2023 doi

  18. [26]

    On Homomorphism Indistinguishability and Hypertree Depth , booktitle =

    Benjamin Scheidt , editor =. On Homomorphism Indistinguishability and Hypertree Depth , booktitle =. 2024 , url =. doi:10.4230/LIPICS.ICALP.2024.152 , timestamp =

    2024 doi

  19. [27]

    Roberson and Tim Seppelt and Peter Zeman , editor =

    Prem Nigam Kar and David E. Roberson and Tim Seppelt and Peter Zeman , editor =. 52nd International Colloquium on Automata, Languages, and Programming,. 2025 , url =. doi:10.4230/LIPICS.ICALP.2025.105 , timestamp =

    2025 doi

  20. [28]

    Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing , booktitle =

    Marek Cern. Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing , booktitle =. 2026 , url =. doi:10.4230/LIPICS.STACS.2026.25 , timestamp =

    2026 doi

  21. [29]

    Roberson , editor =

    Laura Mancinska and David E. Roberson , editor =. Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs , booktitle =. 2020 , url =. doi:10.1109/FOCS46700.2020.00067 , timestamp =

    2020 doi

  22. [30]

    Roberson and Tim Seppelt , title =

    David E. Roberson and Tim Seppelt , title =. TheoretiCS , volume =. 2024 , url =. doi:10.46298/THEORETICS.24.20 , timestamp =

    2024 doi

  23. [31]

    Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width , booktitle =

    Daniel Neuen , editor =. Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width , booktitle =. 2024 , url =. doi:10.4230/LIPICS.STACS.2024.53 , timestamp =

    2024 doi

  24. [32]

    On recognizing graphs by numbers of homomorphisms , journal =

    Zdenek Dvor. On recognizing graphs by numbers of homomorphisms , journal =. 2010 , url =. doi:10.1002/JGT.20461 , timestamp =

    2010 doi

  25. [33]

    Graph isomorphism in quasipolynomial time [extended abstract] , year =

    Babai, L\'. Graph isomorphism in quasipolynomial time [extended abstract] , year =. Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing , pages =. doi:10.1145/2897518.2897542 , abstract =

    doi

  26. [34]

    2012 , publisher=

    Large networks and graph limits , author=. 2012 , publisher=

    2012

  27. [35]

    The Twelfth International Conference on Learning Representations , year=

    On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters , author=. The Twelfth International Conference on Learning Representations , year=

  28. [36]

    An optimal lower bound on the number of variables for graph identification , volume =

    Cai, Jin-Yi and Fürer, Martin and Immerman, Neil , year =. An optimal lower bound on the number of variables for graph identification , volume =. Combinatorica , publisher =. doi:10.1007/bf01305232 , number =

    doi

  29. [37]

    46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) , pages =

    Butti, Silvia and Dalmau, V. 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) , pages =. 2021 , volume =. doi:10.4230/LIPIcs.MFCS.2021.27 , annote =

    2021 doi

  30. [38]

    A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus , booktitle =

    Martin Grohe and Sandra Kiefer , editor =. A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus , booktitle =. 2019 , url =. doi:10.4230/LIPICS.ICALP.2019.117 , timestamp =

    2019 doi

  31. [39]

    Hamilton and Jan Eric Lenssen and Gaurav Rattan and Martin Grohe , title =

    Christopher Morris and Martin Ritzert and Matthias Fey and William L. Hamilton and Jan Eric Lenssen and Gaurav Rattan and Martin Grohe , title =. The Thirty-Third. 2019 , url =. doi:10.1609/AAAI.V33I01.33014602 , timestamp =

    2019 doi

  32. [40]

    Bonsma and Martin Grohe , title =

    Christoph Berkholz and Paul S. Bonsma and Martin Grohe , title =. Theory Comput. Syst. , volume =. 2017 , url =. doi:10.1007/S00224-016-9686-0 , timestamp =

    2017 doi

  33. [41]

    Random Graph Isomorphism , journal =

    L. Random Graph Isomorphism , journal =. 1980 , url =. doi:10.1137/0209047 , timestamp =

    1980 doi

  34. [42]

    Morgan, H. L. , title =. Journal of Chemical Documentation , year =

  35. [43]

    Sandra Kiefer and Ilia Ponomarenko and Pascal Schweitzer , title =. J. 2019 , url =. doi:10.1145/3333003 , timestamp =

    2019 doi

  36. [44]

    Kriege and Martin Grohe and Matthias Fey and Karsten M

    Christopher Morris and Yaron Lipman and Haggai Maron and Bastian Rieck and Nils M. Kriege and Martin Grohe and Matthias Fey and Karsten M. Borgwardt , title =. J. Mach. Learn. Res. , volume =. 2023 , url =

    2023

  37. [45]

    2026 , url =

    Libor Barto and Silvia Butti and Victor Dalmau , title =. 2026 , url =. doi:10.1145/3756323 , timestamp =

    2026 doi

  38. [46]

    Acta Mathematica Hungarica , volume=

    Operations with structures , author=. Acta Mathematica Hungarica , volume=. 1967 , publisher=

    1967

  39. [47]

    Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems , url =

    Chen, Hubie and Gottlob, Georg and Lanzinger, Matthias and Pichler, Reinhard , year =. Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems , url =. doi:10.24963/ijcai.2020/239 , booktitle =

    2020 doi

  40. [48]

    2026 , issue_date =

    Lanzinger, Matthias and Razgon, Igor and Unterberger, Daniel , title =. 2026 , issue_date =. doi:10.1145/3801900 , journal =

    2026 doi

  41. [49]

    Fractional covers of hypergraphs with bounded multi-intersection , volume =

    Gottlob, Georg and Lanzinger, Matthias and Pichler, Reinhard and Razgon, Igor , year =. Fractional covers of hypergraphs with bounded multi-intersection , volume =. doi:10.1016/j.tcs.2023.114204 , journal =

    2023 doi

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.