On the public citation graph

Hypergraph Acyclicity Revisited

https://doi.org/10.1145/2983573
0 signed · 66 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1999.1626openalex-snapshot
On the Complexity of Database Queries
inferredcites →https://doi.org/10.1006/jcss.2001.1809openalex-snapshot
Hypertree Decompositions and Tractable Queries
inferredcites →https://doi.org/10.1007/978-3-319-09284-3_29openalex-snapshot
Hypergraph Acyclicity and Propositional Model Counting
inferredcites →https://doi.org/10.1007/978-3-540-74915-8_18openalex-snapshot
On Acyclic Conjunctive Queries and Constant Delay Enumeration
inferredcites →https://doi.org/10.1016/0004-3702(89)90037-4openalex-snapshot
Tree clustering for constraint networks
inferredcites →https://doi.org/10.1016/0012-365x(83)90088-2openalex-snapshot
Graphs whose neighborhoods have no special cycles
inferredcites →https://doi.org/10.1016/0020-0190(88)90121-4openalex-snapshot
On hypergraph acyclicity and graph chordality
inferredcites →https://doi.org/10.1016/0095-8956(82)90056-9openalex-snapshot
Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(87)90018-6openalex-snapshot
Problems complete for deterministic logarithmic space
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/j.ipl.2012.05.005openalex-snapshot
Some characterizations of γ and β-acyclicity of hypergraphs
inferredcites →https://doi.org/10.1016/j.jctb.2009.07.003openalex-snapshot
Graph minors XXIII. Nash-Williams' immersion conjecture
inferredcites →https://doi.org/10.1016/j.tcs.2012.09.007openalex-snapshot
Hypertree-depth and minors in hypergraphs
inferredcites →https://doi.org/10.1016/j.tcs.2012.12.039openalex-snapshot
Satisfiability of acyclic and almost acyclic CNF formulas
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1090/s0273-0979-05-01088-8openalex-snapshot
Graph minor theory
inferredcites →https://doi.org/10.1109/cmpsac.1979.762509openalex-snapshot
An algorithm for tree-query membership of a distributed query
inferredcites →https://doi.org/10.1109/lics.2013.10openalex-snapshot
Groupoids, Hypergraphs, and Symmetries in Finite Models
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
inferredcites →https://doi.org/10.1145/2402.322390openalex-snapshot
Degrees of acyclicity for hypergraphs and relational database schemes
inferredcites →https://doi.org/10.1145/319732.319735openalex-snapshot
A simplied universal relation assumption and its properties
inferredcites →https://doi.org/10.1145/382780.382783openalex-snapshot
The complexity of acyclic conjunctive queries
inferredcites →https://doi.org/10.1145/602220.602222openalex-snapshot
Query evaluation via tree-decompositions
inferredcites →https://doi.org/10.4230/lipics.csl.2012.137openalex-snapshot
A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
inferredcites →https://doi.org/10.4230/lipics.stacs.2015.iopenalex-snapshot
Front Matter, Table of Contents, Preface, Conference Organization
inferredcites →https://doi.org/10.5860/choice.33-0359openalex-snapshot
Foundations of databases

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.4132993openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-21462-3_17openalex-snapshot
A Formal Context for Closures of Acyclic Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_28openalex-snapshot
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_17openalex-snapshot
Consistency, Acyclicity, and Positive Semirings
inferred← citeshttps://doi.org/10.1007/s00373-024-02864-8openalex-snapshot
On the Cut-Vertex and the Interval Transit Functions of Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01086-9openalex-snapshot
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.032openalex-snapshot
Transit functions and pyramid-like binary clustering systems
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113311openalex-snapshot
Hypergraph incidence coloring
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.002openalex-snapshot
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT
inferred← citeshttps://doi.org/10.1017/s0963548321000158openalex-snapshot
Spanning trees in random regular uniform hypergraphs
inferred← citeshttps://doi.org/10.1109/access.2020.3015654openalex-snapshot
On Quasi Cycles in Hypergraph Databases
inferred← citeshttps://doi.org/10.1137/1.9781611977073.105openalex-snapshot
On the complexity of binary polynomial optimization over acyclic hypergraphs
inferred← citeshttps://doi.org/10.1137/16m1095998openalex-snapshot
The Multilinear Polytope for Acyclic Hypergraphs
inferred← citeshttps://doi.org/10.1145/3125644openalex-snapshot
Communication Steps for Parallel Query Processing
inferred← citeshttps://doi.org/10.1145/3294052.3319679openalex-snapshot
Testability of Homomorphism Inadmissibility
inferred← citeshttps://doi.org/10.1145/3385634.3385636openalex-snapshot
Constant delay enumeration for conjunctive queries
inferred← citeshttps://doi.org/10.1145/3450626.3459853openalex-snapshot
A mathematical foundation for foundation paper pieceable quilts
inferred← citeshttps://doi.org/10.1145/3452021.3458308openalex-snapshot
Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation
inferred← citeshttps://doi.org/10.1145/3452021.3458329openalex-snapshot
Structure and Complexity of Bag Consistency
inferred← citeshttps://doi.org/10.1145/3517804.3524156openalex-snapshot
The Complexity of Boolean Conjunctive Queries with Intersection Joins
inferred← citeshttps://doi.org/10.1145/3517804.3526234openalex-snapshot
Tight Fine-Grained Bounds for Direct Access on Join Queries
inferred← citeshttps://doi.org/10.1145/3520240openalex-snapshot
Counting Subgraphs in Degenerate Graphs
inferred← citeshttps://doi.org/10.1145/3531055openalex-snapshot
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
inferred← citeshttps://doi.org/10.1145/3542700.3542719openalex-snapshot
Structure and Complexity of Bag Consistency
inferred← citeshttps://doi.org/10.1145/3584372.3588676openalex-snapshot
Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins
inferred← citeshttps://doi.org/10.1145/3695837openalex-snapshot
Insert-Only versus Insert-Delete in Dynamic Query Evaluation
inferred← citeshttps://doi.org/10.1145/3703922.3703924openalex-snapshot
Ranked Enumeration for Database Queries
inferred← citeshttps://doi.org/10.1145/3721855openalex-snapshot
Consistency of Relations over Monoids
inferred← citeshttps://doi.org/10.1145/3734517openalex-snapshot
Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3780099openalex-snapshot
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
inferred← citeshttps://doi.org/10.1145/3786785openalex-snapshot
Finding Smallest Witnesses for Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3797036openalex-snapshot
Modern Minimal Perfect Hashing: A Survey
inferred← citeshttps://doi.org/10.1145/3799232openalex-snapshot
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
inferred← citeshttps://doi.org/10.14778/3476249.3476306openalex-snapshot
Beyond equi-joins
inferred← citeshttps://doi.org/10.24963/ijcai.2017/57openalex-snapshot
Synchronisation Games on Hypergraphs
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.58openalex-snapshot
Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width
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.