On the public citation graph
Dynamic expression trees
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140208openalex-snapshot
Shortest‐path algorithms: Taxonomy and annotation
inferredcites →https://doi.org/10.1007/bf00259471openalex-snapshot
Proving relative lower bounds for incremental algorithms
inferredcites →https://doi.org/10.1007/bf01758775openalex-snapshot
A fast algorithm for the generalized parametric minimum cut problem and applications
inferredcites →https://doi.org/10.1007/bf01840401openalex-snapshot
Dynamic maintenance of planar digraphs, with applications
inferredcites →https://doi.org/10.1007/bfb0024016openalex-snapshot
A dynamization of the All Pairs Least Cost Path Problem
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
inferredcites →https://doi.org/10.1016/0196-6774(92)90004-vopenalex-snapshot
Maintenance of a minimum spanning forest in a dynamic plane graph
inferredcites →https://doi.org/10.1016/s0019-9958(83)80038-2openalex-snapshot
Optimal orientations of cells in slicing floorplan designs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70323-6openalex-snapshot
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
inferredcites →https://doi.org/10.1109/sfcs.1989.63515openalex-snapshot
Incremental planarity testing
inferredcites →https://doi.org/10.1137/0204032openalex-snapshot
On Finding and Updating Spanning Trees and Shortest Paths
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs
inferredcites →https://doi.org/10.1145/73560.73584openalex-snapshot
Incremental data flow analysis via dominator and attribute update
inferredcites →https://doi.org/10.1145/75277.75305openalex-snapshot
Incremental computation via function caching
inferredcites →https://doi.org/10.5555/320176.320180openalex-snapshot
Incremental evaluation of computational circuits
inferredcites →https://doi.org/10.5555/320176.320189openalex-snapshot
Applying parallel processing techniques to classification problems in constructive solid geometry
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0044openalex-snapshot
On-line Planar Graph Embedding
inferred← citeshttps://doi.org/10.1006/jagm.1996.0835openalex-snapshot
A Data Structure for Dynamically Maintaining Rooted Trees
inferred← citeshttps://doi.org/10.1007/11496656_34openalex-snapshot
Parametric Analysis for Ungapped Markov Models of Evolution
inferred← citeshttps://doi.org/10.1007/3-211-38167-8_7openalex-snapshot
Efficient computation of project characteristics in a series-parallel activity network with interval durations
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_6openalex-snapshot
Maintaining Center and Median in Dynamic Trees
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_62openalex-snapshot
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
inferred← citeshttps://doi.org/10.1007/pl00009227openalex-snapshot
Maintaining Regular Properties Dynamically in k-Terminal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-003-1065-yopenalex-snapshot
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)
inferred← citeshttps://doi.org/10.1007/s00453-019-00594-5openalex-snapshot
An $$O(n \log n)$$ Time Algorithm for Computing the Path-Length Distance Between Trees
inferred← citeshttps://doi.org/10.1142/s0218195998000023openalex-snapshot
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
inferred← citeshttps://doi.org/10.1145/1103963.1103966openalex-snapshot
Maintaining information in fully dynamic trees with top trees
inferred← citeshttps://doi.org/10.1145/1597036.1597048openalex-snapshot
Parametric analysis for ungapped Markov models of evolution
inferred← citeshttps://doi.org/10.70675/20c06f35z8a0dz4872z83e0z5bc2fafd8555openalex-snapshot
On the complexity of regular languages
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.