On the public citation graph

An algebraic theory of graph reduction

https://doi.org/10.1007/bfb0017382
0 signed · 47 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.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-19488-6_129openalex-snapshot
Efficient analysis of graph properties on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-50728-0_34openalex-snapshot
The monadic second-order logic of graphs : Definable sets of finite graphs
inferredcites →https://doi.org/10.1007/3-540-52292-1_17openalex-snapshot
Improved self-reduction algorithms for graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01788098openalex-snapshot
Characterization of partial 3-trees in terms of three structures
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1016/0012-365x(90)90292-popenalex-snapshot
Forbidden minors characterization of partial 3-trees
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0196-6774(87)90039-3openalex-snapshot
Linear-time computation of optimal subgraphs of decomposable graphs
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferredcites →https://doi.org/10.1016/s0167-5060(13)71062-8openalex-snapshot
Annals of Discrete Mathematics 56
inferredcites →https://doi.org/10.1016/s0304-0208(08)73830-1openalex-snapshot
Some New Results on the Well-Quasi-Ordering of Graphs
inferredcites →https://doi.org/10.1109/sfcs.1989.63528openalex-snapshot
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
inferredcites →https://doi.org/10.1137/0201014openalex-snapshot
Flow Graph Reducibility
inferredcites →https://doi.org/10.1137/0607033openalex-snapshot
Characterization and Recognition of Partial 3-Trees
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/174147.169807openalex-snapshot
An algebraic theory of graph reduction
inferredcites →https://doi.org/10.1145/322154.322155openalex-snapshot
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45832-8_26openalex-snapshot
Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_100openalex-snapshot
Canonical representations of partial 2-and 3-trees
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_161openalex-snapshot
Finding minimal forbidden minors using a finite congruence
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_162openalex-snapshot
Better algorithms for the pathwidth and treewidth of graphs
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_24openalex-snapshot
On disjoint cycles
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_76openalex-snapshot
A linear algorithm for edge-coloring partial k-trees
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_9openalex-snapshot
Recognizable sets of graphs of bounded tree-width
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_39openalex-snapshot
Bounded tree-width and LOGCFL
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_40openalex-snapshot
On reduction algorithms for graphs with small treewidth
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_2openalex-snapshot
Backdoor Treewidth for SAT
inferred← citeshttps://doi.org/10.1007/bfb0017422openalex-snapshot
Computing by graph transformation: Overall aims and new results
inferred← citeshttps://doi.org/10.1007/bfb0019428openalex-snapshot
A characterization of graphs with vertex cover up to five
inferred← citeshttps://doi.org/10.1007/bfb0023853openalex-snapshot
An efficient algorithm for edge-coloring series parallel multigraphs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90064-zopenalex-snapshot
Monadic second-order evaluations on tree-decomposable graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90357-yopenalex-snapshot
Complexity of path-forming games
inferred← citeshttps://doi.org/10.1017/s0960129500000359openalex-snapshot
Recognizable sets of graphs: equivalent definitions and closure properties
inferred← citeshttps://doi.org/10.1051/ita/1992260302571openalex-snapshot
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
inferred← citeshttps://doi.org/10.1109/fscs.1990.89536openalex-snapshot
Efficient parallel algorithms for tree-decomposition and related problems
inferred← citeshttps://doi.org/10.1137/s0097539792228228openalex-snapshot
Fixed-Parameter Tractability and Completeness I: Basic Results
inferred← citeshttps://doi.org/10.1145/167088.167161openalex-snapshot
A linear time algorithm for finding tree-decompositions of small treewidth
inferred← citeshttps://doi.org/10.1145/3406325.3451068openalex-snapshot
Vertex deletion parameterized by elimination distance and even less
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.