On the public citation graph
Dynamic maintenance of planar digraphs, with applications
0 signed · 67 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/3-540-10704-5_9openalex-snapshot
A graph-planarization algorithm and its application to random graphs
inferredcites →https://doi.org/10.1007/3-540-19422-3_9openalex-snapshot
Maintenance of transitive closures and transitive reductions of graphs
inferredcites →https://doi.org/10.1007/3-540-19488-6_143openalex-snapshot
A dynamic data structure for planar graph embedding
inferredcites →https://doi.org/10.1007/bf00714475openalex-snapshot
Representing orders on the plane by translating convex figures
inferredcites →https://doi.org/10.1007/bf01762117openalex-snapshot
A linear algorithm to find a rectangular dual of a planar triangulated graph
inferredcites →https://doi.org/10.1007/bf02187705openalex-snapshot
A unified approach to visibility representations of planar graphs
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1016/0012-365x(87)90008-2openalex-snapshot
Fundamentals of planar ordered sets
inferredcites →https://doi.org/10.1016/0020-0190(75)90019-8openalex-snapshot
On the vector representation of the reachability in planar directed graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90136-6openalex-snapshot
Finding paths and deleting edges in directed acyclic graphs
inferredcites →https://doi.org/10.1016/0022-0000(85)90004-2openalex-snapshot
A linear algorithm for embedding planar graphs using PQ-trees
inferredcites →https://doi.org/10.1016/0304-3975(86)90098-8openalex-snapshot
Amortized efficiency of a path retrieval data structure
inferredcites →https://doi.org/10.1016/0304-3975(88)90123-5openalex-snapshot
Algorithms for plane representations of acyclic digraphs
inferredcites →https://doi.org/10.1109/31.1739openalex-snapshot
Floorplans, planar graphs, and layouts
inferredcites →https://doi.org/10.1109/31.1746openalex-snapshot
Planar embedding: linear-time algorithms for vertex placement and edge orderings
inferredcites →https://doi.org/10.1137/0206043openalex-snapshot
Location of a Point in a Planar Subdivision and Its Applications
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/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0218056openalex-snapshot
Fully Dynamic Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/28395.28403openalex-snapshot
The complexity of cutting convex polytypes
inferredcites →https://doi.org/10.1145/323233.323253openalex-snapshot
Characterizing bar line-of-sight graphs
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
inferredcites →https://doi.org/10.1145/800141.804663openalex-snapshot
On translating a set of rectangles
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.1007/3-540-51542-9_2openalex-snapshot
Efficient spatial point location
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_57openalex-snapshot
Fully dynamic planarity testing in planar embedded graphs
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_72openalex-snapshot
A fully dynamic data structure for reachability in planar digraphs
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_144openalex-snapshot
Fully Dynamic Transitive Closure in plane dags with one source and one sink
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_132openalex-snapshot
Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_25openalex-snapshot
Efficient parallel algorithms for planar st-graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_22openalex-snapshot
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_9openalex-snapshot
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
inferred← citeshttps://doi.org/10.1007/bf01294130openalex-snapshot
An efficient parallel algorithm for shortest paths in planar layered digraphs
inferred← citeshttps://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferred← citeshttps://doi.org/10.1007/bfb0055041openalex-snapshot
Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method
inferred← citeshttps://doi.org/10.1007/s00453-002-0995-0openalex-snapshot
Efficient Parallel Algorithms for Planar st-Graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90164-oopenalex-snapshot
Dynamic reachability in planar digraphs with one source and one sink
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.04.001openalex-snapshot
I/O-efficient dynamic planar point location
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1109/ptp.2003.1231506openalex-snapshot
Dynamic networking refinement in distributed systems
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63515openalex-snapshot
Incremental planarity testing
inferred← citeshttps://doi.org/10.1109/spdp.1992.242747openalex-snapshot
A divide and conquer approach to shortest paths in planar layered digraphs
inferred← citeshttps://doi.org/10.1137/0218056openalex-snapshot
Fully Dynamic Point Location in a Monotone Subdivision
inferred← citeshttps://doi.org/10.1137/0220045openalex-snapshot
Parallel Transitive Closure and Point Location in Planar Structures
inferred← citeshttps://doi.org/10.1137/0221020openalex-snapshot
Efficient Point Location in a Convex Spatial Cell-Complex
inferred← citeshttps://doi.org/10.1137/0221062openalex-snapshot
Fully Dynamic Algorithms for 2-Edge Connectivity
inferred← citeshttps://doi.org/10.1137/0222002openalex-snapshot
Maintaining the 3-Edge-Connected Components of a Graph On-Line
inferred← citeshttps://doi.org/10.1137/s0097539701391592openalex-snapshot
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539792235724openalex-snapshot
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
inferred← citeshttps://doi.org/10.1145/142675.142728openalex-snapshot
A framework for dynamic graph drawing
inferred← citeshttps://doi.org/10.1145/174625.174627openalex-snapshot
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
inferred← citeshttps://doi.org/10.1145/300515.300517openalex-snapshot
Fully dynamic planarity testing with applications
inferred← citeshttps://doi.org/10.1145/3055399.3055480openalex-snapshot
Decremental single-source reachability in planar digraphs
inferred← citeshttps://doi.org/10.1145/314500.314525openalex-snapshot
I/O-efficient dynamic point location in monotone planar subdivisions
inferred← citeshttps://doi.org/10.1145/336154.336205openalex-snapshot
I/O-efficient dynamic planar point location (extended abstract)
inferred← citeshttps://doi.org/10.1145/72935.72978openalex-snapshot
Optimal parallel algorithms for transitive closure and point location in planar structures
inferred← citeshttps://doi.org/10.1631/jzus.2004.0518openalex-snapshot
An efficient parallel algorithm for shortest paths in planar layered digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1705.11163openalex-snapshot
Decremental Single-Source Reachability in Planar Digraphs
inferred← citeshttps://doi.org/10.5555/127787.127805openalex-snapshot
Dynamic expression trees and their applications
inferred← citeshttps://doi.org/10.7146/brics.v1i30.21613openalex-snapshot
Fully Dynamic Transitive Closure in Plane Dags with one Source and one Sink
inferred← citeshttps://doi.org/10.7146/brics.v3i9.19972openalex-snapshot
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
inferred← citeshttps://doi.org/10.7146/brics.v4i32.18958openalex-snapshot
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method
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.