On the public citation graph

Short Encodings of Evolving Structures

https://doi.org/10.1137/0405034
0 signed · 48 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/3-540-13345-3_47openalex-snapshot
Encoding graphs by derivations and implications for the theory of graph grammars
inferredcites →https://doi.org/10.1007/3-540-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1016/0020-0190(82)90083-7openalex-snapshot
A note on some tree similarity measures
inferredcites →https://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1090/s0002-9947-1956-0081471-8openalex-snapshot
A Theorem on Planar Graphs
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0928904-4openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.2307/1968197openalex-snapshot
A Theorem on Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/047134608x.w1608openalex-snapshot
Biology Computing
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse932openalex-snapshot
Biology Computing
inferred← citeshttps://doi.org/10.1002/jgt.20214openalex-snapshot
Simultaneous diagonal flips in plane triangulations
inferred← citeshttps://doi.org/10.1006/aama.2001.0759openalex-snapshot
Geometry of the Space of Phylogenetic Trees
inferred← citeshttps://doi.org/10.1006/jagm.1999.1010openalex-snapshot
Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_168openalex-snapshot
Some notes on the nearest neighbour interchange distance
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_12openalex-snapshot
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_52openalex-snapshot
Computing Distances Between Evolutionary Trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_11openalex-snapshot
Computing Distances between Evolutionary Trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_7openalex-snapshot
Average-Case Analysis Using Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_52-1openalex-snapshot
Computing Distances Between Evolutionary Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_60openalex-snapshot
Transition Operations over Plane Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_3openalex-snapshot
A History of Flips in Combinatorial Triangulations
inferred← citeshttps://doi.org/10.1007/bfb0036170openalex-snapshot
Average-case analysis via incompressibility
inferred← citeshttps://doi.org/10.1007/pl00008273openalex-snapshot
On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees
inferred← citeshttps://doi.org/10.1007/s00285-017-1167-9openalex-snapshot
The combinatorics of discrete time-trees: theory and open problems
inferred← citeshttps://doi.org/10.1007/s00285-017-1171-0openalex-snapshot
Bounds for phylogenetic network space metrics
inferred← citeshttps://doi.org/10.1007/s00454-017-9867-xopenalex-snapshot
Computing the Flip Distance Between Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-020-00242-8openalex-snapshot
Packing Disks by Flipping and Flowing
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.04.001openalex-snapshot
Flips in planar graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.005openalex-snapshot
Flipping edge-labelled triangulations
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111929openalex-snapshot
Transition operations over plane trees
inferred← citeshttps://doi.org/10.1016/s0010-4655(99)00216-7openalex-snapshot
On rotation distance between binary coupling trees and applications for 3nj-coefficients
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00418-6openalex-snapshot
On the diameter of the rotation graph of binary coupling trees
inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00180-9openalex-snapshot
Two shortest path metrics on well-formed parentheses strings
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80020-4openalex-snapshot
On bounds for the rotation distance between binary coupling trees
inferred← citeshttps://doi.org/10.1039/9781847558183-00208openalex-snapshot
Towards a Catalogue of Designer Zeolites
inferred← citeshttps://doi.org/10.1090/dimacs/055/09openalex-snapshot
On computing the nearest neighbor interchange distance
inferred← citeshttps://doi.org/10.1090/proc/12816openalex-snapshot
Uniform growth rate
inferred← citeshttps://doi.org/10.1090/tran/7356openalex-snapshot
The geometry of flip graphs and mapping class groups
inferred← citeshttps://doi.org/10.1109/18.681318openalex-snapshot
Information distance
inferred← citeshttps://doi.org/10.1137/060663611openalex-snapshot
Sequences with Changing Dependencies
inferred← citeshttps://doi.org/10.1142/s0218195914600036openalex-snapshot
FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR
inferred← citeshttps://doi.org/10.1186/s13015-021-00188-3openalex-snapshot
The Bourque distances for mutation trees of cancers
inferred← citeshttps://doi.org/10.1215/00127094-1507312openalex-snapshot
Growth of the Weil–Petersson diameter of moduli space
inferred← citeshttps://doi.org/10.1215/00127094-2323128openalex-snapshot
The diameter of the thick part of moduli space and simultaneous Whitehead moves
inferred← citeshttps://doi.org/10.22215/etd/2015-11052openalex-snapshot
Flips and Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.1006.3520openalex-snapshot
Information Distance
inferred← citeshttps://doi.org/10.48550/arxiv.1607.07503openalex-snapshot
Genomic data analysis in tree spaces
inferred← citeshttps://doi.org/10.5555/1109557.1109582openalex-snapshot
Simultaneous diagonal flips in plane triangulations
inferred← citeshttps://doi.org/10.70675/8f18b972z43abz4f03z9460zb1ac39f5a2d8openalex-snapshot
Combinatorial methods in Teichmüller theory
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.