On the public citation graph
On Certificates and Lookahead in Dynamic Graph Problems
0 signed · 36 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.1994.1033openalex-snapshot
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
inferredcites →https://doi.org/10.1007/3-540-57568-5_234openalex-snapshot
How to treat delete requests in semi-online problems
inferredcites →https://doi.org/10.1007/bf01758773openalex-snapshot
Maintaining bridge-connected and biconnected components on-line
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0004-3702(94)90048-5openalex-snapshot
Geometric reasoning about mechanical assembly
inferredcites →https://doi.org/10.1016/0020-0190(90)90055-3openalex-snapshot
On the time-space complexity of reachability queries for preprocessed graphs
inferredcites →https://doi.org/10.1016/0196-6774(85)90030-6openalex-snapshot
Batched dynamic solutions to decomposable searching problems
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1109/icde.1989.47238openalex-snapshot
Materialization and incremental update of path information
inferredcites →https://doi.org/10.1109/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferredcites →https://doi.org/10.1109/sfcs.1992.267819openalex-snapshot
Fully dynamic biconnectivity in graphs
inferredcites →https://doi.org/10.1109/sfcs.1995.492668openalex-snapshot
Fully dynamic biconnectivity and transitive closure
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1137/s0097539796299540openalex-snapshot
Beyond Competitive Analysis
inferredcites →https://doi.org/10.1145/103418.103454openalex-snapshot
Fully dynamic algorithms for edge connectivity problems
inferredcites →https://doi.org/10.1145/16856.16861openalex-snapshot
Efficiently updating materialized views
inferredcites →https://doi.org/10.1145/298514.298576openalex-snapshot
Graph-theoretic methods in database theory
inferredcites →https://doi.org/10.1145/38713.38759openalex-snapshot
A performance analysis of view materialization strategies
inferredcites →https://doi.org/10.1145/99935.99944openalex-snapshot
A compression technique to materialize transitive closure
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-642-00312-7_26openalex-snapshot
Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_58openalex-snapshot
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
inferred← citeshttps://doi.org/10.1007/s00453-007-9051-4openalex-snapshot
Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure
inferred← citeshttps://doi.org/10.1007/s00453-008-9166-2openalex-snapshot
Fast Dynamic Transitive Closure with Lookahead
inferred← citeshttps://doi.org/10.1016/j.jda.2005.12.003openalex-snapshot
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
inferred← citeshttps://doi.org/10.1109/focs.2019.00036openalex-snapshot
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds
inferred← citeshttps://doi.org/10.1109/tase.2013.2242327openalex-snapshot
Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact
inferred← citeshttps://doi.org/10.1137/s009753970343912xopenalex-snapshot
Dynamic Subgraph Connectivity with Geometric Applications
inferred← citeshttps://doi.org/10.1145/1059513.1059514openalex-snapshot
Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O ( n 2 barrier
inferred← citeshttps://doi.org/10.1145/509907.509911openalex-snapshot
Dynamic subgraph connectivity with geometric applications
inferred← citeshttps://doi.org/10.14232/actacyb.23.3.2018.10openalex-snapshot
DFS is Unsparsable and Lookahead Can Help in Maximal Matching
inferred← citeshttps://doi.org/10.48550/arxiv.0906.3240openalex-snapshot
Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
inferred← citeshttps://doi.org/10.5555/365411.365463openalex-snapshot
Pattern matching for sets of segments
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.