On the public citation graph
A New Approach to Incremental Cycle Detection and Related Problems
0 signed · 91 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.1007/11785293_8openalex-snapshot
An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
inferredcites →https://doi.org/10.1007/3-540-45749-6_17openalex-snapshot
Two Simplified Algorithms for Maintaining Order in a List
inferredcites →https://doi.org/10.1007/978-3-540-24838-5_29openalex-snapshot
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_35openalex-snapshot
Faster Algorithms for Incremental Topological Ordering
inferredcites →https://doi.org/10.1007/978-3-540-77120-3_41openalex-snapshot
Average-Case Analysis of Online Topological Ordering
inferredcites →https://doi.org/10.1016/0020-0190(74)90001-5openalex-snapshot
A structured program to generate all topological sorting arrangements
inferredcites →https://doi.org/10.1016/0020-0190(96)00075-0openalex-snapshot
Maintaining a topological order under edge insertions
inferredcites →https://doi.org/10.1016/j.endm.2006.06.050openalex-snapshot
An algorithm for online topological ordering
inferredcites →https://doi.org/10.1016/j.tcs.2007.08.009openalex-snapshot
A tight analysis of the Katriel–Bodlaender algorithm for online topological ordering
inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot
The Art of Computer Programming, Volume 3, Sorting and Searching
inferredcites →https://doi.org/10.1109/scam.2003.1238026openalex-snapshot
Online cycle detection and difference propagation for pointer analysis
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferredcites →https://doi.org/10.1137/060650271openalex-snapshot
Improved Dynamic Reachability Algorithms for Directed Graphs
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/1187436.1210590openalex-snapshot
A dynamic topological sort algorithm for directed acyclic graphs
inferredcites →https://doi.org/10.1145/1383369.1383370openalex-snapshot
An O ( n 2.75 ) algorithm for incremental topological ordering
inferredcites →https://doi.org/10.1145/2071379.2071382openalex-snapshot
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
inferredcites →https://doi.org/10.1145/28395.28434openalex-snapshot
Two algorithms for maintaining order in a list
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/368996.369025openalex-snapshot
Topological sorting of large networks
inferredcites →https://doi.org/10.1145/512274.512284openalex-snapshot
Algorithm 230: Matrix Permutation
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
inferredcites →https://doi.org/10.1287/opre.27.1.161openalex-snapshot
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
inferredcites →https://doi.org/10.2307/2282802openalex-snapshot
Structural Models: An Introduction to the Theory of Directed Graphs.
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.2307/3007289openalex-snapshot
Structural Models: An Introduction to the Theory of Directed Graphs
inferredcites →https://doi.org/10.4064/fm-16-1-386-389openalex-snapshot
Sur l'extension de l'ordre partiel
inferredcites →https://doi.org/10.48550/arxiv.cs/0602073openalex-snapshot
An O(n^{2.75}) algorithm for online topological ordering
inferredcites →https://doi.org/10.5555/1496770.1496890openalex-snapshot
A new approach to incremental topological ordering
inferredcites →https://doi.org/10.5555/314161.314187openalex-snapshot
Buckets, heaps, lists, and monotone priority queues
inferredcites →https://doi.org/10.5555/320176.320180openalex-snapshot
Incremental evaluation of computational circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4673353openalex-extracted
Encoding Path Sets in Acyclic Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_22openalex-snapshot
A Pragmatic Non-blocking Concurrent Directed Acyclic Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-88806-0_17openalex-snapshot
Automated Verification of the Parallel Bellman–Ford Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-25803-9_6openalex-snapshot
SMT-Based Verification of Persistency Invariants of Px86 Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_12openalex-snapshot
Incremental Dead State Detection in Logarithmic Time
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_39openalex-snapshot
Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00236-015-0248-8openalex-snapshot
Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
inferred← citeshttps://doi.org/10.1007/s10270-024-01186-wopenalex-snapshot
Using reactive links to propagate changes across engineering models
inferred← citeshttps://doi.org/10.1007/s10618-015-0406-1openalex-snapshot
Beyond rankings: comparing directed acyclic graphs
inferred← citeshttps://doi.org/10.1007/s10639-022-11576-6openalex-snapshot
Conflict recognition in CSCL sessions through the identification of cycles in conversational graphs
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.jcss.2021.09.008openalex-snapshot
Single-source shortest paths and strong connectivity in dynamic planar graphs
inferred← citeshttps://doi.org/10.1017/s0956796817000028openalex-snapshot
A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading
inferred← citeshttps://doi.org/10.1038/s41598-026-44835-4openalex-snapshot
Persistent cycles and network resilience: a hypernetwork-based framework for temporal graph analysis
inferred← citeshttps://doi.org/10.1090/mcom/3513openalex-snapshot
Approximations of the Lagrange and Markov spectra
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00108openalex-snapshot
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00100openalex-snapshot
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time
inferred← citeshttps://doi.org/10.1109/icbda.2018.8367653openalex-snapshot
An algorithmic approach to handle circular trading in commercial taxation system
inferred← citeshttps://doi.org/10.1109/scam67354.2025.00011openalex-snapshot
Insights into Optimizing Research Software: A Case of an Architecture-Smell Detection Tool
inferred← citeshttps://doi.org/10.1137/1.9781611975994.153openalex-snapshot
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.146openalex-snapshot
Incremental Single Source Shortest Paths in Sparse Digraphs
inferred← citeshttps://doi.org/10.1137/1.9781611977073.137openalex-snapshot
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier
inferred← citeshttps://doi.org/10.1137/15m1050987openalex-snapshot
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
inferred← citeshttps://doi.org/10.1137/20m1312149openalex-snapshot
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
inferred← citeshttps://doi.org/10.1145/3192366.3192390openalex-snapshot
D4: fast concurrency debugging with parallel differential analysis
inferred← citeshttps://doi.org/10.1145/3293606openalex-snapshot
Rethinking Incremental and Parallel Pointer Analysis
inferred← citeshttps://doi.org/10.1145/3296979.3192390openalex-snapshot
D4: fast concurrency debugging with parallel differential analysis
inferred← citeshttps://doi.org/10.1145/3357713.3384236openalex-snapshot
New algorithms and hardness for incremental single-source shortest paths in directed graphs
inferred← citeshttps://doi.org/10.1145/3371076openalex-snapshot
Coq Coq correct! verification of type checking and erasure for Coq, in Coq
inferred← citeshttps://doi.org/10.1145/3448016.3457290openalex-snapshot
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration
inferred← citeshttps://doi.org/10.1145/3453483.3454066openalex-snapshot
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints
inferred← citeshttps://doi.org/10.1145/3453483.3454108openalex-snapshot
Satisfiability modulo ordering consistency theory for multi-threaded program verification
inferred← citeshttps://doi.org/10.1145/3519935.3520058openalex-snapshot
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
inferred← citeshttps://doi.org/10.1145/3527332openalex-snapshot
SHARP: fast incremental context-sensitive pointer analysis for Java
inferred← citeshttps://doi.org/10.1145/3579835openalex-snapshot
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models
inferred← citeshttps://doi.org/10.1145/3618260.3649745openalex-snapshot
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow
inferred← citeshttps://doi.org/10.1145/3639277openalex-snapshot
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
inferred← citeshttps://doi.org/10.1145/3706056openalex-snapshot
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq
inferred← citeshttps://doi.org/10.1145/3725261openalex-snapshot
Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs
inferred← citeshttps://doi.org/10.14778/3648160.3648173openalex-snapshot
Minimum Strongly Connected Subgraph Collection in Dynamic Graphs
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13603openalex-snapshot
Incremental Dynamic Controllability Revisited
inferred← citeshttps://doi.org/10.18653/v1/2020.acl-main.629openalex-snapshot
Transition-based Semantic Dependency Parsing with Pointer Networks
inferred← citeshttps://doi.org/10.20547/jfer1803103openalex-snapshot
A Novel Approach for Circular Trade Detection in Mercantile Exchange
inferred← citeshttps://doi.org/10.3384/ecp17132565openalex-snapshot
Transformation of Differential Algebraic Array Equations to Index One Form
inferred← citeshttps://doi.org/10.3384/lic.diva-119409openalex-snapshot
Efficient Temporal Reasoning with Uncertainty
inferred← citeshttps://doi.org/10.3390/a10040115openalex-snapshot
A Multi-Threading Algorithm to Detect and Remove Cycles in Vertex- and Arc-Weighted Digraph
inferred← citeshttps://doi.org/10.3990/1.9789036553421openalex-snapshot
Correct optimized GPU programs
inferred← citeshttps://doi.org/10.4204/eptcs.337.2openalex-snapshot
Touring the MetaCoq Project (Invited Paper)
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.49openalex-snapshot
Incremental $2$-Edge-Connectivity in Directed Graphs
inferred← citeshttps://doi.org/10.4230/lipics.sea.2017.27openalex-snapshot
Incremental Low-High Orders of Directed Graphs and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1402.0054openalex-snapshot
Popular conjectures imply strong lower bounds for dynamic problems
inferred← citeshttps://doi.org/10.48550/arxiv.1710.10836openalex-snapshot
An algorithmic approach to handle circular trading in commercial taxing system
inferred← citeshttps://doi.org/10.48550/arxiv.1804.01276openalex-snapshot
Maintenance of Strongly Connected Component in Shared-memory Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1908.03773openalex-snapshot
Approximation of the Lagrange and Markov spectra
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11169openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2107.07670openalex-snapshot
Touring the MetaCoq Project (Invited Paper)
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.