On the public citation graph

Directed hypergraphs as a modelling paradigm

https://doi.org/10.1007/bf02735318
0 signed · 63 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.1007/978-1-4615-5757-9_9openalex-snapshot
Hyperpath Formulations of Traffic Assignment Problems
inferredcites →https://doi.org/10.1007/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf01581090openalex-snapshot
Gainfree Leontief substitution flow problems
inferredcites →https://doi.org/10.1007/bf01581727openalex-snapshot
Max Horn SAT and the minimum cut problem in directed hypergraphs
inferredcites →https://doi.org/10.1007/bf02614371openalex-snapshot
Flows on hypergraphs
inferredcites →https://doi.org/10.1007/bfb0083470openalex-snapshot
Hyperpaths and shortest hyperpaths
inferredcites →https://doi.org/10.1016/0004-3702(76)90006-0openalex-snapshot
Generalized and/or graphs
inferredcites →https://doi.org/10.1016/0004-3702(77)90014-5openalex-snapshot
Directed recursive labelnode hypergraphs: A new representation-language
inferredcites →https://doi.org/10.1016/0004-3702(80)90026-0openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1016/0020-0190(77)90002-3openalex-snapshot
A generalization of Dijkstra's algorithm
inferredcites →https://doi.org/10.1016/0020-0190(87)90028-7openalex-snapshot
On the complexity of the maximum satisfiability problem for horn formulas
inferredcites →https://doi.org/10.1016/0022-0000(78)90009-0openalex-snapshot
Candidate keys for relations
inferredcites →https://doi.org/10.1016/0166-218x(93)90045-popenalex-snapshot
Directed hypergraphs and applications
inferredcites →https://doi.org/10.1016/0306-4379(78)90025-xopenalex-snapshot
Formal aspects of the relational model
inferredcites →https://doi.org/10.1016/0377-2217(88)90327-xopenalex-snapshot
Equilibrium traffic assignment for large scale transit networks
inferredcites →https://doi.org/10.1016/0377-2217(90)90350-kopenalex-snapshot
A typology of cutting and packing problems
inferredcites →https://doi.org/10.1016/0377-2217(95)00022-iopenalex-snapshot
The modified integer round-up property of the one-dimensional cutting stock problem
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/0743-1066(89)90009-5openalex-snapshot
Algorithms for testing the satisfiability of propositional formulae
inferredcites →https://doi.org/10.1016/s0167-6377(96)00047-8openalex-snapshot
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
inferredcites →https://doi.org/10.1016/s0304-0208(08)72918-9openalex-snapshot
Minimax Theorems for Normal Hypergraphs and Balanced Hypergraphs — A Survey
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7007-2openalex-snapshot
Hypergraphs - Combinatorics of Finite Sets
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1112/blms/6.2.218bopenalex-snapshot
GRAPHS AND HYPERGRAPHS
inferredcites →https://doi.org/10.1145/322217.322223openalex-snapshot
Minimum Covers in Relational Database Model
inferredcites →https://doi.org/10.1145/322276.322285openalex-snapshot
Dynamic Programming as Graph Searching: An Algebraic Approach
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/mnsc.40.12.1579openalex-snapshot
Metagraphs: A Tool for Modeling Decision Support Systems
inferredcites →https://doi.org/10.2307/1055873openalex-snapshot
Microeconomic Theory: A Mathematical Approach
inferredcites →https://doi.org/10.2307/1910243openalex-snapshot
The Theory of Linear Economic Models
inferredcites →https://doi.org/10.2307/2551800openalex-snapshot
Microeconomic Theory: A Mathematical Approach.
inferredcites →https://doi.org/10.2307/3006664openalex-snapshot
The Theory of Linear Economic Models

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.20609openalex-snapshot
The Cartesian product of hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-04726-9_7openalex-snapshot
A Hypergraph-Based Modeling Approach for Service Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_40openalex-snapshot
Complexity of Linear Connectivity Problems in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-88869-7_10openalex-snapshot
Applying Symmetric Enumeration Method to One-Dimensional Assembly of Rotatable Tiles
inferred← citeshttps://doi.org/10.1007/978-3-642-04247-8_3openalex-snapshot
Graphical Modeling of Substitutions and Flexible Bills-of-Materials
inferred← citeshttps://doi.org/10.1007/s11786-012-0109-6openalex-snapshot
A Survey on Hypergraph Products
inferred← citeshttps://doi.org/10.1007/s13222-017-0253-xopenalex-snapshot
The Hydra.PowerGraph System
inferred← citeshttps://doi.org/10.1007/s41109-020-0252-yopenalex-snapshot
Annotated hypergraphs: models and applications
inferred← citeshttps://doi.org/10.1007/s41870-024-02264-4openalex-snapshot
Novel directed hypergraph p-Laplacian based semi-supervised learning method: theory and algorithms
inferred← citeshttps://doi.org/10.1016/j.chaos.2026.118755openalex-snapshot
Evolutionary games on directed and higher-order interaction networks: Simulation and application in scholarly citation relationships
inferred← citeshttps://doi.org/10.1016/j.fss.2022.02.001openalex-snapshot
Fuzzy logic programs as hypergraphs. Termination results
inferred← citeshttps://doi.org/10.1016/j.ieri.2014.03.005openalex-snapshot
Hypergraph Reconfigurability Analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.038openalex-snapshot
Linear connectivity problems in directed hypergraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.017openalex-snapshot
Enumeration approach to computing chemical equilibria
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.016openalex-snapshot
Directed hypergraphs: Introduction and fundamental algorithms—A survey
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00462-6openalex-snapshot
On the orientation of graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/s1076-5670(04)31001-3openalex-snapshot
Introduction to Hypergraph Theory and Its Use in Engineering and Image Processing
inferred← citeshttps://doi.org/10.1109/icsmc.2012.6378008openalex-snapshot
Dashboard by-example: A hypergraph-based approach to on-demand data warehousing systems
inferred← citeshttps://doi.org/10.1109/iske.2015.72openalex-snapshot
The New Directed Hypergraph for CNF Formula of Propositional Logic
inferred← citeshttps://doi.org/10.1145/2095536.2095545openalex-snapshot
Hypergraph-based multidimensional data modeling towards on-demand business analysis
inferred← citeshttps://doi.org/10.1186/1759-2208-3-1openalex-snapshot
Maximizing output and recognizing autocatalysis in chemical reaction networks is NP-complete
inferred← citeshttps://doi.org/10.1207/s15327744joce1403_02openalex-snapshot
Network Flow Models for Electronic Barter Exchanges
inferred← citeshttps://doi.org/10.12677/aam.2022.114203openalex-snapshot
Design of Restricted Disjoint B-Path Algorithm in Dynamic Directed Hypergraph
inferred← citeshttps://doi.org/10.1504/ijbidm.2012.049551openalex-snapshot
Query-by-example approach towards on-demand multidimensional analysis
inferred← citeshttps://doi.org/10.2298/csis100804016lopenalex-snapshot
Feature diagram formalization based on directed hypergraphs
inferred← citeshttps://doi.org/10.3934/fods.2023010openalex-snapshot
Persistent hyperdigraph homology and persistent hyperdigraph Laplacians
inferred← citeshttps://doi.org/10.4018/978-1-59140-050-9.ch002openalex-snapshot
Verifying Web Site Properties Using Computational Logic
inferred← citeshttps://doi.org/10.4018/978-1-61350-053-8.ch016openalex-snapshot
On the Efficiency of Querying and Storing RDF Documents
inferred← citeshttps://doi.org/10.48550/arxiv.1110.6051openalex-snapshot
Maximizing Output and Recognizing Autocatalysis in Chemical Reaction Networks is NP-Complete
inferred← citeshttps://doi.org/10.5373/jardcs/v12sp4/20201622openalex-snapshot
Directed Hypergraph Neural Network
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.