On the public citation graph
Incremental Graph Computations: Doable and Undoable
0 signed · 50 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.1006/jagm.1996.0046openalex-snapshot
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
inferredcites →https://doi.org/10.1006/jcss.2001.1748openalex-snapshot
Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata
inferredcites →https://doi.org/10.1007/978-1-84800-070-4openalex-snapshot
The Algorithm Design Manual
inferredcites →https://doi.org/10.1016/0304-3975(95)00079-8openalex-snapshot
On the computational complexity of dynamic graph problems
inferredcites →https://doi.org/10.1016/0304-3975(95)00182-4openalex-snapshot
Partial derivatives of regular expressions and finite automaton constructions
inferredcites →https://doi.org/10.1023/a:1023607406540openalex-snapshot
An Incremental Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.1109/69.729731openalex-snapshot
Incremental maintenance of materialized object-oriented views in MultiView: strategies and performance evaluation
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1109/tpds.2021.3131677openalex-snapshot
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/s009753979122370xopenalex-snapshot
Finding Regular Simple Paths in Graph Databases
inferredcites →https://doi.org/10.1145/2071379.2071382openalex-snapshot
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
inferredcites →https://doi.org/10.1145/2206869.2206879openalex-snapshot
Query languages for graph databases
inferredcites →https://doi.org/10.1145/2483699.2483707openalex-snapshot
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
inferredcites →https://doi.org/10.1145/2508020.2489791openalex-snapshot
Incremental graph pattern matching
inferredcites →https://doi.org/10.1145/2508020.2508021openalex-snapshot
Algebraic incremental maintenance of XML views
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/358746.358755openalex-snapshot
The Cornell program synthesizer
inferredcites →https://doi.org/10.1145/369275.369284openalex-snapshot
Theory of answering queries using views
inferredcites →https://doi.org/10.14778/3389133.3389142openalex-snapshot
Incrementalization of graph partitioning algorithms
inferredcites →https://doi.org/10.14778/3457390.3457400openalex-snapshot
Parallel discrepancy detection and incremental detection
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-30675-4_10openalex-snapshot
Edge Coloring on Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/s00778-026-00977-5openalex-snapshot
Efficiently querying connected components in large temporal graphs via scalable and maintainable indices
inferred← citeshttps://doi.org/10.1007/s11390-025-4300-zopenalex-snapshot
Incremental Detection of Strongly Connected Components for Scholarly Data
inferred← citeshttps://doi.org/10.1016/j.fss.2024.109195openalex-snapshot
Incremental model checking for fuzzy computation tree logic
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114169openalex-snapshot
Actminer: Applying causality tracking and increment aligning for graph-based threat hunting
inferred← citeshttps://doi.org/10.1017/s1471068418000224openalex-snapshot
Certified Graph View Maintenance with Regular Datalog
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00174openalex-snapshot
Imputing Sparse and Noisy Labels for GNNs
inferred← citeshttps://doi.org/10.1109/sbac-pad59825.2023.00020openalex-snapshot
A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs
inferred← citeshttps://doi.org/10.1145/3589315openalex-snapshot
On Querying Connected Components in Large Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3698038.3698524openalex-snapshot
IncBoost: Scaling Incremental Graph Processing for Edge Deletions and Weight Updates
inferred← citeshttps://doi.org/10.1145/3702315openalex-snapshot
Making It Tractable to Detect and Correct Errors in Graphs
inferred← citeshttps://doi.org/10.1145/3709660openalex-snapshot
An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3725312openalex-snapshot
Incremental Rule Discovery in Response to Parameter Updates
inferred← citeshttps://doi.org/10.1145/3770854.3780256openalex-snapshot
Graph Perturbation Analysis for Subgraph Counting
inferred← citeshttps://doi.org/10.1145/3786674openalex-snapshot
Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/3837105openalex-snapshot
Detecting Contradictions Within and Across Documents
inferred← citeshttps://doi.org/10.1155/2023/1974161openalex-snapshot
An Efficient Dynamic Programming Algorithm for Finding Group Steiner Trees in Temporal Graphs
inferred← citeshttps://doi.org/10.14778/3551793.3551862openalex-snapshot
Optimizing differentially-maintained recursive queries on dynamic graphs
inferred← citeshttps://doi.org/10.14778/3598581.3598592openalex-snapshot
Maximal D-Truss Search in Dynamic Directed Graphs
inferred← citeshttps://doi.org/10.14778/3648160.3648162openalex-snapshot
Capturing More Associations by Referencing External Graphs
inferred← citeshttps://doi.org/10.14778/3725688.3725720openalex-snapshot
A Flexible Framework for Query-Oriented Interactive Community Search
inferred← citeshttps://doi.org/10.4018/jdm.2019100102openalex-snapshot
Multi-Fuzzy-Objective Graph Pattern Matching with Big Graph Data
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.