On the public citation graph
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
0 signed · 283 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/cpe.605openalex-snapshot
Parallel static and dynamic multi‐constraint graph partitioning
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.1996.0002openalex-snapshot
Separator Based Sparsification
inferredcites →https://doi.org/10.1006/jpdc.1997.1407openalex-snapshot
Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes
inferredcites →https://doi.org/10.1006/jpdc.1997.1410openalex-snapshot
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes
inferredcites →https://doi.org/10.1007/11533719_47openalex-snapshot
Subquadratic Algorithm for Dynamic Shortest Distances
inferredcites →https://doi.org/10.1007/11533719_72openalex-snapshot
New Streaming Algorithms for Counting Triangles in Graphs
inferredcites →https://doi.org/10.1007/3-540-36383-1_11openalex-snapshot
Implementations and Experimental Studies of Dynamic Graph Algorithms
inferredcites →https://doi.org/10.1007/3-540-44436-x_10openalex-snapshot
Greedy Approximation Algorithms for Finding Dense Components in a Graph
inferredcites →https://doi.org/10.1007/3-540-44679-6_30openalex-snapshot
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
inferredcites →https://doi.org/10.1007/3-540-44691-5_19openalex-snapshot
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
inferredcites →https://doi.org/10.1007/3-540-44985-x_1openalex-snapshot
Dynamic Graph Algorithms with Applications
inferredcites →https://doi.org/10.1007/3-540-45643-0_9openalex-snapshot
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
inferredcites →https://doi.org/10.1007/3-540-57899-4_44openalex-snapshot
Fully dynamic maintenance of vertex cover
inferredcites →https://doi.org/10.1007/3-540-60084-1_81openalex-snapshot
Approximating minimum cuts under insertions
inferredcites →https://doi.org/10.1007/3-540-63165-8_214openalex-snapshot
Maintaining minimum spanning trees in dynamic graphs
inferredcites →https://doi.org/10.1007/978-1-4939-2864-4_154openalex-snapshot
Fully Dynamic Higher Connectivity
inferredcites →https://doi.org/10.1007/978-3-030-13469-3_31openalex-snapshot
Space Efficient Incremental Betweenness Algorithm for Directed Graphs
inferredcites →https://doi.org/10.1007/978-3-030-59416-9_32openalex-snapshot
Efficient Closeness Centrality Computation for Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-319-21233-3_5openalex-snapshot
StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-319-32149-3_20openalex-snapshot
Fast Incremental Community Detection on Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-319-43659-3_11openalex-snapshot
Penalized Graph Partitioning for Static and Dynamic Load Balancing
inferredcites →https://doi.org/10.1007/978-3-319-43659-3_24openalex-snapshot
GraphIn: An Online High Performance Incremental Graph Processing Framework
inferredcites →https://doi.org/10.1007/978-3-319-73117-9_3openalex-snapshot
The State of the Art in Dynamic Graph Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-78024-5_26openalex-snapshot
Approximating Personalized Katz Centrality in Dynamic Graphs
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-27810-8_33openalex-snapshot
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_30openalex-snapshot
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_5openalex-snapshot
Landmark-Based Routing in Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-540-72845-0_6openalex-snapshot
Dynamic Highway-Node Routing
inferredcites →https://doi.org/10.1007/978-3-642-02011-7_7openalex-snapshot
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
inferredcites →https://doi.org/10.1007/978-3-642-12848-6_3openalex-snapshot
Dynamic Graph Cuts and Their Applications in Computer Vision
inferredcites →https://doi.org/10.1007/978-3-642-13193-6_37openalex-snapshot
Modularity-Driven Clustering of Dynamic Graphs
inferredcites →https://doi.org/10.1007/978-3-642-20662-7_32openalex-snapshot
Customizable Route Planning
inferredcites →https://doi.org/10.1007/978-3-642-22300-6_29openalex-snapshot
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees
inferredcites →https://doi.org/10.1007/978-3-642-25501-4_20openalex-snapshot
Fast Community Detection for Dynamic Complex Networks
inferredcites →https://doi.org/10.1007/978-3-642-34862-4_16openalex-snapshot
An Efficient Generator for Clustered Dynamic Random Networks
inferredcites →https://doi.org/10.1007/978-3-662-44465-8_49openalex-snapshot
Betweenness Centrality – Incremental and Faster
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_14openalex-snapshot
Fully-Dynamic Approximation of Betweenness Centrality
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_52openalex-snapshot
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
inferredcites →https://doi.org/10.1007/978-3-662-48350-3_62openalex-snapshot
Faster Fully-Dynamic Minimum Spanning Forest
inferredcites →https://doi.org/10.1007/978-3-662-48971-0_29openalex-snapshot
Fully Dynamic Betweenness Centrality
inferredcites →https://doi.org/10.1007/bf01189067openalex-snapshot
Fully dynamic biconnectivity in graphs
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/pl00009228openalex-snapshot
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
inferredcites →https://doi.org/10.1007/s00453-010-9401-5openalex-snapshot
On Dynamic Shortest Paths Problems
inferredcites →https://doi.org/10.1007/s00453-015-0036-4openalex-snapshot
Triangle Counting in Dynamic Graph Streams
inferredcites →https://doi.org/10.1007/s00453-019-00630-4openalex-snapshot
Deterministic Dynamic Matching in O(1) Update Time
inferredcites →https://doi.org/10.1007/s00778-016-0423-8openalex-snapshot
Incremental k-core decomposition: algorithms and evaluation
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/0304-3975(94)90159-7openalex-snapshot
Complexity models for incremental computation
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/j.dam.2009.10.005openalex-snapshot
Maintaining dynamic minimum spanning trees: An experimental study
inferredcites →https://doi.org/10.1016/j.ic.2018.02.005openalex-snapshot
Dynamic algorithms via the primal-dual method
inferredcites →https://doi.org/10.1016/j.ins.2015.07.053openalex-snapshot
Efficient algorithms for updating betweenness centrality in fully dynamic graphs
inferredcites →https://doi.org/10.1016/j.jda.2017.09.001openalex-snapshot
Engineering graph-based models for dynamic timetable information systems
inferredcites →https://doi.org/10.1016/j.jpdc.2004.02.001openalex-snapshot
Dynamic load balancing by diffusion in heterogeneous systems
inferredcites →https://doi.org/10.1016/j.parco.2015.01.003openalex-snapshot
Incremental closeness centrality in distributed memory
inferredcites →https://doi.org/10.1016/j.tcs.2011.11.034openalex-snapshot
Extended dynamic subgraph statistics using h -index parameterized data structures
inferredcites →https://doi.org/10.1016/s0167-8191(99)00002-2openalex-snapshot
An improved diffusion algorithm for dynamic load balancing
inferredcites →https://doi.org/10.1016/s0898-1221(00)90183-4openalex-snapshot
Complexity and approximation: Combinatorial optimization problems and their approximability properties
inferredcites →https://doi.org/10.1023/a:1023607406540openalex-snapshot
An Incremental Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.1023/b:sqjo.0000039791.93071.a2openalex-snapshot
Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis
inferredcites →https://doi.org/10.1080/15427951.2016.1177802openalex-snapshot
Approximating Betweenness Centrality in Fully Dynamic Networks
inferredcites →https://doi.org/10.1103/physreve.69.026113openalex-snapshot
Finding and evaluating community structure in networks
inferredcites →https://doi.org/10.1109/90.893870openalex-snapshot
New dynamic algorithms for shortest path tree computation
inferredcites →https://doi.org/10.1109/90.974525openalex-snapshot
New dynamic SPT algorithm based on a ball-and-string model
inferredcites →https://doi.org/10.1109/asonam.2014.6921567openalex-snapshot
Community detection in dynamic social networks: A game-theoretic approach
inferredcites →https://doi.org/10.1109/bigdata.2013.6691611openalex-snapshot
Incremental algorithms for closeness centrality
inferredcites →https://doi.org/10.1109/bigdata.2015.7363954openalex-snapshot
DISTINGER: A distributed graph data structure for massive dynamic graph processing
inferredcites →https://doi.org/10.1109/bigdata.2018.8622452openalex-snapshot
DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs
inferredcites →https://doi.org/10.1109/cluster.2013.6702680openalex-snapshot
STREAMER: A distributed framework for incremental closeness centrality computation
inferredcites →https://doi.org/10.1109/focs.2004.25openalex-snapshot
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
inferredcites →https://doi.org/10.1109/focs.2013.65openalex-snapshot
Fully Dynamic (1+ e)-Approximate Matchings
inferredcites →https://doi.org/10.1109/focs.2014.53openalex-snapshot
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
inferredcites →https://doi.org/10.1109/focs.2016.43openalex-snapshot
Fully Dynamic Maximal Matching in Constant Update Time
inferredcites →https://doi.org/10.1109/focs.2016.58openalex-snapshot
Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms
inferredcites →https://doi.org/10.1109/focs.2019.00031openalex-snapshot
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time
inferredcites →https://doi.org/10.1109/focs.2019.00032openalex-snapshot
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
inferredcites →https://doi.org/10.1109/focs.2019.00033openalex-snapshot
A New Deterministic Algorithm for Dynamic Set Cover
inferredcites →https://doi.org/10.1109/focs.2019.00035openalex-snapshot
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
inferredcites →https://doi.org/10.1109/focs.2019.00036openalex-snapshot
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds
inferredcites →https://doi.org/10.1109/focs46700.2020.00109openalex-snapshot
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
inferredcites →https://doi.org/10.1109/focs52979.2021.00088openalex-snapshot
Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract)
inferredcites →https://doi.org/10.1109/hicss.1996.495507openalex-snapshot
Enhancing data locality by using terminal propagation
inferredcites →https://doi.org/10.1109/hipc.2017.00011openalex-snapshot
Exact and Parallel Triangle Counting in Dynamic Graphs
inferredcites →https://doi.org/10.1109/hpec.2012.6408680openalex-snapshot
STINGER: High performance data structure for streaming graphs
inferredcites →https://doi.org/10.1109/hpec.2018.8547541openalex-snapshot
Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs
inferredcites →https://doi.org/10.1109/icdcs.2014.23openalex-snapshot
Adaptive Partitioning for Large-Scale Dynamic Graphs
inferredcites →https://doi.org/10.1109/icdcs.2017.288openalex-snapshot
Parallel Algorithm for Core Maintenance in Dynamic Graphs
inferredcites →https://doi.org/10.1109/icde.2016.7498421openalex-snapshot
Scalable online betweenness centrality in evolving graphs
inferredcites →https://doi.org/10.1109/icde.2017.93openalex-snapshot
A Fast Order-Based Approach for Core Maintenance
inferredcites →https://doi.org/10.1109/icde.2018.00083openalex-snapshot
Efficient Computation of a Near-Maximum Independent Set over Evolving Graphs
inferredcites →https://doi.org/10.1109/icde.2019.00016openalex-snapshot
Computing a Near-Maximum Independent Set in Dynamic Graphs
inferredcites →https://doi.org/10.1109/icdm.2013.135openalex-snapshot
An Efficient Approach to Updating Closeness Centrality and Average Path Length in Dynamic Networks
inferredcites →https://doi.org/10.1109/icdm.2017.51openalex-snapshot
Benchmark Generator for Dynamic Overlapping Communities in Networks
inferredcites →https://doi.org/10.1109/icpads.2009.114openalex-snapshot
Dynamic Load Balancing for Parallel Numerical Simulations Based on Repartitioning with Disturbed Diffusion
inferredcites →https://doi.org/10.1109/ipdps47924.2020.00081openalex-snapshot
Dynamic Graphs on the GPU
inferredcites →https://doi.org/10.1109/ipdpsw.2016.189openalex-snapshot
Towards a Distributed Large-Scale Dynamic Graph Data Store
inferredcites →https://doi.org/10.1109/iscc.2018.8538625openalex-snapshot
Multimodal Dynamic Journey Planning
inferredcites →https://doi.org/10.1109/sc.2000.10035openalex-snapshot
A Unified Algorithm for Load-balancing Adaptive Scientific Simulations
inferredcites →https://doi.org/10.1109/sc.2018.00063openalex-snapshot
faimGraph: High Performance Management of Fully-Dynamic Graphs Under Tight Memory Constraints on the GPU
inferredcites →https://doi.org/10.1109/sffcs.1999.814580openalex-snapshot
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
inferredcites →https://doi.org/10.1109/socialcom-passat.2012.37openalex-snapshot
A Fast Algorithm for Streaming Betweenness Centrality
inferredcites →https://doi.org/10.1109/tc.2008.198openalex-snapshot
Shortest Path Tree Computation in Dynamic Graphs
inferredcites →https://doi.org/10.1109/tkde.2013.158openalex-snapshot
Efficient Core Maintenance in Large Dynamic Graphs
inferredcites →https://doi.org/10.1109/tkde.2015.2419666openalex-snapshot
Scalable Online Betweenness Centrality in Evolving Graphs
inferredcites →https://doi.org/10.1109/tkde.2016.2550042openalex-snapshot
Incremental and Decremental Max-Flow for Online Semi-Supervised Learning
inferredcites →https://doi.org/10.1109/tkde.2019.2951419openalex-snapshot
DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity
inferredcites →https://doi.org/10.1109/tpami.2004.60openalex-snapshot
An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
inferredcites →https://doi.org/10.1109/tpami.2007.1128openalex-snapshot
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields
inferredcites →https://doi.org/10.1109/tpds.2018.2835441openalex-snapshot
Core Maintenance in Dynamic Graphs: A Parallel Approach Based on Matching
inferredcites →https://doi.org/10.1109/tpds.2019.2960226openalex-snapshot
Faster Parallel Core Maintenance Algorithms in Dynamic Graphs
inferredcites →https://doi.org/10.1109/tsmcb.2005.850180openalex-snapshot
Dynamic Algorithms for the Shortest Path Routing Problem: Learning Automata-Based Solutions
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/090776573openalex-snapshot
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs
inferredcites →https://doi.org/10.1137/1.9781611973105.81openalex-snapshot
Dynamic graph connectivity in polylogarithmic worst case time
inferredcites →https://doi.org/10.1137/1.9781611973730.54openalex-snapshot
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
inferredcites →https://doi.org/10.1137/1.9781611973754.12openalex-snapshot
Approximating Betweenness Centrality in Large Evolving Networks
inferredcites →https://doi.org/10.1137/1.9781611974331.ch50openalex-snapshot
Faster Fully Dynamic Matchings with Small Approximation Ratios
inferredcites →https://doi.org/10.1137/1.9781611974782.28openalex-snapshot
Fully dynamic all-pairs shortest paths with worst-case update-time revisited
inferredcites →https://doi.org/10.1137/1.9781611974782.32openalex-snapshot
Fully Dynamic Connectivity in O (log n (log log n ) 2 ) Amortized Expected Time
inferredcites →https://doi.org/10.1137/1.9781611975055.3openalex-snapshot
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
inferredcites →https://doi.org/10.1137/1.9781611975482.113openalex-snapshot
Deterministically Maintaining a (2 + ∊ )-Approximate Minimum Vertex Cover in O (1/ ∊ 2 ) Amortized Update Time
inferredcites →https://doi.org/10.1137/1.9781611975482.115openalex-snapshot
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
inferredcites →https://doi.org/10.1137/1.9781611975482.116openalex-snapshot
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
inferredcites →https://doi.org/10.1137/1.9781611975499.8openalex-snapshot
Batch-Parallel Euler Tour Trees
inferredcites →https://doi.org/10.1137/1.9781611975994.152openalex-snapshot
Fully Dynamic Matching: Beating 2-Approximation in Δ ϵ Update Time
inferredcites →https://doi.org/10.1137/1.9781611975994.156openalex-snapshot
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
inferredcites →https://doi.org/10.1137/1.9781611976007.9openalex-snapshot
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
inferredcites →https://doi.org/10.1137/1.9781611976465.110openalex-snapshot
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
inferredcites →https://doi.org/10.1137/1.9781611976465.132openalex-snapshot
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
inferredcites →https://doi.org/10.1137/1.9781611976465.150openalex-snapshot
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
inferredcites →https://doi.org/10.1137/1.9781611976465.75openalex-snapshot
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
inferredcites →https://doi.org/10.1137/1.9781611976489.10openalex-snapshot
Parallel Batch-Dynamic k -Clique Counting
inferredcites →https://doi.org/10.1137/1.9781611976496.10openalex-snapshot
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching
inferredcites →https://doi.org/10.1137/1.9781611977042.2openalex-snapshot
Practical Fully Dynamic Minimum Cut Algorithms
inferredcites →https://doi.org/10.1137/1.9781611977073.23openalex-snapshot
The Complexity of Average-Case Dynamic Subgraph Counting
inferredcites →https://doi.org/10.1137/13093618xopenalex-snapshot
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time
inferredcites →https://doi.org/10.1137/140998925openalex-snapshot
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
inferredcites →https://doi.org/10.1137/16m1106158openalex-snapshot
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version)
inferredcites →https://doi.org/10.1137/17m114306xopenalex-snapshot
Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier
inferredcites →https://doi.org/10.1137/s0097539705447256openalex-snapshot
Logarithmic Lower Bounds in the Cell-Probe Model
inferredcites →https://doi.org/10.1137/s0097539792226825openalex-snapshot
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
inferredcites →https://doi.org/10.1137/s0097539794263907openalex-snapshot
Improved Data Structures for Fully Dynamic Biconnectivity
inferredcites →https://doi.org/10.1137/s0097539794269072openalex-snapshot
Separator-Based Sparsification II: Edge and Vertex Connectivity
inferredcites →https://doi.org/10.1145/1039488.1039492openalex-snapshot
A new approach to dynamic all pairs shortest paths
inferredcites →https://doi.org/10.1145/1060590.1060607openalex-snapshot
Worst-case update times for fully-dynamic all-pairs shortest paths
inferredcites →https://doi.org/10.1145/1064546.1103378openalex-snapshot
Geometric containers for efficient shortest-path computation
inferredcites →https://doi.org/10.1145/1142351.1142388openalex-snapshot
Counting triangles in data streams
inferredcites →https://doi.org/10.1145/1187436.1210590openalex-snapshot
A dynamic topological sort algorithm for directed acyclic graphs
inferredcites →https://doi.org/10.1145/1198513.1198519openalex-snapshot
Experimental analysis of dynamic all pairs shortest path algorithms
inferredcites →https://doi.org/10.1145/1227161.1227166openalex-snapshot
Efficient models for timetable information in public transportation systems
inferredcites →https://doi.org/10.1145/1227161.1370597openalex-snapshot
An experimental study of algorithms for fully dynamic transitive closure
inferredcites →https://doi.org/10.1145/1328911.1328917openalex-snapshot
A faster and simpler fully dynamic transitive closure
inferredcites →https://doi.org/10.1145/1529282.1529607openalex-snapshot
Applying latent dirichlet allocation to group discovery in large graphs
inferredcites →https://doi.org/10.1145/1671970.1671976openalex-snapshot
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
inferredcites →https://doi.org/10.1145/1806689.1806753openalex-snapshot
Maintaining a large matching and a small vertex cover
inferredcites →https://doi.org/10.1145/1806689.1806772openalex-snapshot
Towards polynomial lower bounds for dynamic problems
inferredcites →https://doi.org/10.1145/2038633.2038638openalex-snapshot
Mining large distributed log data in near real time
inferredcites →https://doi.org/10.1145/225058.225269openalex-snapshot
Randomized dynamic graph algorithms with polylogarithmic time per operation
inferredcites →https://doi.org/10.1145/2444016.2444021openalex-snapshot
Dynamic graph clustering combining modularity and smoothness
inferredcites →https://doi.org/10.1145/2488608.2488705openalex-snapshot
Max flows in O(nm) time, or better
inferredcites →https://doi.org/10.1145/2492517.2500270openalex-snapshot
Incremental closeness centrality for dynamically changing social networks
inferredcites →https://doi.org/10.1145/2556195.2556224openalex-snapshot
Fast approximation of betweenness centrality through sampling
inferredcites →https://doi.org/10.1145/2566486.2568007openalex-snapshot
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling
inferredcites →https://doi.org/10.1145/264216.264223openalex-snapshot
An empirical study of dynamic graph algorithms
inferredcites →https://doi.org/10.1145/2700206openalex-snapshot
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
inferredcites →https://doi.org/10.1145/2746539.2746592openalex-snapshot
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
inferredcites →https://doi.org/10.1145/2746539.2746609openalex-snapshot
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
inferredcites →https://doi.org/10.1145/276698.276715openalex-snapshot
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
inferredcites →https://doi.org/10.1145/2786022openalex-snapshot
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates
inferredcites →https://doi.org/10.1145/2897518.2897568openalex-snapshot
New deterministic approximation algorithms for fully dynamic matching
inferredcites →https://doi.org/10.1145/2933267.2933299openalex-snapshot
Distributed k-core decomposition and maintenance in large dynamic graphs
inferredcites →https://doi.org/10.1145/297096.297147openalex-snapshot
Experimental analysis of dynamic algorithms for the single source shortest paths problem
inferredcites →https://doi.org/10.1145/2983323.2983731openalex-snapshot
Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks
inferredcites →https://doi.org/10.1145/3019612.3019816openalex-snapshot
Incremental maximum flow computation on evolving networks
inferredcites →https://doi.org/10.1145/3022186openalex-snapshot
Memory-Efficient and Accurate Sampling for Counting Local Triangles in Graph Streams
inferredcites →https://doi.org/10.1145/3110025openalex-snapshot
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017
inferredcites →https://doi.org/10.1145/3110025.3110034openalex-snapshot
A Dynamic Algorithm for Updating Katz Centrality in Graphs
inferredcites →https://doi.org/10.1145/3172867openalex-snapshot
Community Discovery in Dynamic Networks
inferredcites →https://doi.org/10.1145/3174803openalex-snapshot
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
inferredcites →https://doi.org/10.1145/3188745.3188922openalex-snapshot
Fully dynamic maximal independent set with sublinear update time
inferredcites →https://doi.org/10.1145/320211.320215openalex-snapshot
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.1145/3313276.3316376openalex-snapshot
Dynamic set cover: improved algorithms and lower bounds
inferredcites →https://doi.org/10.1145/3323165.3323196openalex-snapshot
Parallel Batch-Dynamic Graph Connectivity
showing the first 200 of 245 · page through all 245
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-90203-1_28openalex-snapshot
DP_Kruskal: A Concurrent Algorithm to Maintain Dynamically Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_5openalex-snapshot
Hardness of Dynamic Core and Truss Decompositions
inferred← citeshttps://doi.org/10.1007/s11704-023-2656-1openalex-snapshot
A survey on dynamic graph processing on GPUs: concepts, terminologies and systems
inferred← citeshttps://doi.org/10.1007/s12045-022-1436-9openalex-snapshot
An Invitation to Dynamic Graph Problems: Basics — I
inferred← citeshttps://doi.org/10.1007/s12045-022-1452-9openalex-snapshot
An Invitation to Dynamic Graph Problems: Upper Bounds — II
inferred← citeshttps://doi.org/10.1007/s44163-026-01402-0openalex-snapshot
Systematic literature analysis of artificial intelligence driven penetration testing for ARM systems
inferred← citeshttps://doi.org/10.1016/j.datak.2025.102421openalex-snapshot
A graph theoretic approach to assess quality of data for classification task
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.03.017openalex-snapshot
Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
inferred← citeshttps://doi.org/10.1109/access.2023.3316602openalex-snapshot
Top-k Distance Queries on Large Time-Evolving Graphs
inferred← citeshttps://doi.org/10.1109/access.2025.3596871openalex-snapshot
The Current Landscape of Scalable Dynamic Graph Processing
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386845openalex-snapshot
Maximum Flow on Highly Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00098openalex-snapshot
Approximating Edit Distance in the Fully Dynamic Model
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00250openalex-snapshot
Efficient Multi-Query Oriented Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10229050openalex-snapshot
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
inferred← citeshttps://doi.org/10.1109/noms69089.2026.11668418openalex-snapshot
A Knowledge Graph-Based Framework for Intent Representation and Intent Management
inferred← citeshttps://doi.org/10.1109/pdp66500.2025.00020openalex-snapshot
Fast Maximal Independent Sets on Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/pdp66500.2025.00021openalex-snapshot
Fast Katz Centrality on Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/sbac-pad66369.2025.00021openalex-snapshot
DynaMap: A Map Equation-based Parallel Algorithm for Detecting Communities on Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/ssitcon66133.2025.11341989openalex-snapshot
Graph Connectivity Analysis of South Indian Cities from Vizhinjam Port Using Sequential and Parallel Depth First Search Algorithm
inferred← citeshttps://doi.org/10.1109/tkde.2026.3721816openalex-snapshot
Efficient Multi-Query Optimization for Continuous Subgraph Matching Over Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3626183.3659982openalex-snapshot
Parallel Dynamic Maximal Matching
inferred← citeshttps://doi.org/10.1145/3635800.3637447openalex-snapshot
Incremental Computation: What Is the Essence? (Invited Contribution)
inferred← citeshttps://doi.org/10.1145/3662158.3662770openalex-snapshot
Streaming Graph Algorithms in the Massively Parallel Computation Model
inferred← citeshttps://doi.org/10.1145/3685980.3685982openalex-snapshot
Tractable Circuits in Database Theory
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/3709704openalex-snapshot
Minimum Spanning Tree Maintenance in Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3717823.3718168openalex-snapshot
Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights
inferred← citeshttps://doi.org/10.1145/3725228openalex-snapshot
An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/3802084openalex-snapshot
Maintaining Biconnected Components in Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3806645.3807595openalex-snapshot
SAGA: State-Aware Graph Analytics for Combinatorial Optimization on Dynamic Graphs
inferred← citeshttps://doi.org/10.1145/3818671.3818673openalex-snapshot
TC-MIS: Maximal Independent Set on Tensor-Cores
inferred← citeshttps://doi.org/10.14778/3712221.3712250openalex-snapshot
Towards Scalable and Practical Batch-Dynamic Connectivity
inferred← citeshttps://doi.org/10.14778/3749646.3749665openalex-snapshot
Approximate 2-hop Neighborhoods on Incremental Graphs: An Efficient Lazy Approach
inferred← citeshttps://doi.org/10.26467/2079-0619-2026-29-4-8-28openalex-snapshot
Method for determining an aircraft avoidance route around a dynamically changing thunderstorm activity area
inferred← citeshttps://doi.org/10.3390/app15063172openalex-snapshot
Large-Scale Dynamic Graph Processing with Graphic Processing Unit-Accelerated Priority-Driven Differential Scheduling and Operation Reduction
inferred← citeshttps://doi.org/10.3390/app15116003openalex-snapshot
Recent Advances in Efficient Dynamic Graph Processing
inferred← citeshttps://doi.org/10.7155/jgaa.00609openalex-snapshot
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
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.