On the public citation graph
Algorithms for Dense Graphs and Networks on the Random Access Computer
0 signed · 73 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-09526-8_27openalex-snapshot
A reduct-and-closure algorithm for graphs
inferredcites →https://doi.org/10.1007/3-540-63165-8_161openalex-snapshot
LEDA: a platform for combinatorial and geometric computing
inferredcites →https://doi.org/10.1007/978-1-4612-5695-3openalex-snapshot
Selected Writings on Computing: A personal Perspective
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01584237openalex-snapshot
A new algorithm for the assignment problem
inferredcites →https://doi.org/10.1007/bf01585705openalex-snapshot
Finding minimum-cost flows by double scaling
inferredcites →https://doi.org/10.1007/bf01586040openalex-snapshot
New scaling algorithms for the assignment and minimum mean cycle problems
inferredcites →https://doi.org/10.1007/bfb0032035openalex-snapshot
Can a maximum flow be computed in o(nm) time?
inferredcites →https://doi.org/10.1016/0020-0190(91)90195-nopenalex-snapshot
Computing a maximum cardinality matching in a bipartite graph in time O(n1.5)
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/0304-3975(83)90023-3openalex-snapshot
Upper bounds for sorting integers on random access machines
inferredcites →https://doi.org/10.1016/0304-3975(88)90032-1openalex-snapshot
An improved algorithm for transitive closure on acyclic digraphs
inferredcites →https://doi.org/10.1016/0898-1221(81)90008-0openalex-snapshot
A strong-connectivity algorithm and its applications in data flow analysis
inferredcites →https://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
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/0218069openalex-snapshot
Faster Scaling Algorithms for Network Problems
inferredcites →https://doi.org/10.1137/0222013openalex-snapshot
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k -Vertex Connectivity
inferredcites →https://doi.org/10.1145/100216.100217openalex-snapshot
BLASTING through the information theoretic barrier with FUSION TREES
inferredcites →https://doi.org/10.1145/103418.103424openalex-snapshot
Clique partitions, graph compression and speeding-up algorithms
inferredcites →https://doi.org/10.1145/219717.219797openalex-snapshot
Principles and applications of chaotic systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcc.23842openalex-snapshot
irGPU.proton.Net: Irregular strong charge interaction networks of protonatable groups in protein molecules—a GPU solver using the fast multipole method and statistical thermodynamics
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_23openalex-snapshot
Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
inferred← citeshttps://doi.org/10.1007/978-1-4302-3238-4_5openalex-snapshot
Traversal: The Skeleton Key of Algorithmics
inferred← citeshttps://doi.org/10.1007/978-1-4419-1549-8_3openalex-snapshot
Time Complexity of Decentralized Fixed Mode Verification
inferred← citeshttps://doi.org/10.1007/978-1-4614-3879-3_11openalex-snapshot
Exploration of Distributed Automotive Systems Using Compositional Timing Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4842-0055-1_5openalex-snapshot
Traversal: The Skeleton Key of Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-031-08011-1_26openalex-snapshot
A Parallel Algorithm for GAC Filtering of the Alldifferent Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_21openalex-snapshot
Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-19315-1_21openalex-snapshot
Speeding up Graph Algorithms via Switching Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_8openalex-snapshot
Matching Algorithms Are Fast in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_10openalex-snapshot
A New Combinatorial Approach for Sparse Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_4openalex-snapshot
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_5openalex-snapshot
Population Protocols and Related Models
inferred← citeshttps://doi.org/10.1007/978-3-642-19754-3_20openalex-snapshot
Computing Strongly Connected Components in the Streaming Model
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_39openalex-snapshot
Maximum Flows by Incremental Breadth-First Search
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_40openalex-snapshot
Engineering Multilevel Graph Partitioning Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-007-7684-5_22openalex-snapshot
Linear Programming Formulation of Boolean Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/s00453-012-9729-0openalex-snapshot
On the Complexity of Strongly Connected Components in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00894-017-3262-7openalex-snapshot
Subtle.Nets.Finder: finely tuned interaction networks in DNA/RNA/protein complexes
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103815openalex-snapshot
Finding strong components using depth-first search
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105334openalex-snapshot
Linear-time safe-alternating DFS and SCCs
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.010openalex-snapshot
A simple reduction from maximum weight matching to maximum cardinality matching
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.01.016openalex-snapshot
A simple test on 2-vertex- and 2-edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.029openalex-snapshot
An n log n algorithm for hyper-minimizing a (minimized) deterministic automaton
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.071openalex-snapshot
Finding all maximally-matchable edges in a bipartite graph
inferred← citeshttps://doi.org/10.1109/acc.2009.5159997openalex-snapshot
Complexity of checking the existence of a stabilizing decentralized controller
inferred← citeshttps://doi.org/10.1109/bibm.2009.28openalex-snapshot
GAM: Genomic Assemblies Merger: A Graph Based Method to Integrate Different Assemblies
inferred← citeshttps://doi.org/10.1109/es.2014.22openalex-snapshot
Linear System Solvability in the Virtual Money Exchange Rate Algorithm
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00017openalex-snapshot
CALock: Multi-Granularity Locking in Dynamic Hierarchies
inferred← citeshttps://doi.org/10.1109/mcas.2013.2271443openalex-snapshot
Multi-Agent Systems with Dynamical Topologies: Consensus and Applications
inferred← citeshttps://doi.org/10.1109/tac.2010.2041609openalex-snapshot
Time Complexity of Decentralized Fixed-Mode Verification
inferred← citeshttps://doi.org/10.1109/tcyb.2016.2573138openalex-snapshot
Observer-Based Consensus Tracking of Nonlinear Agents in Hybrid Varying Directed Topology
inferred← citeshttps://doi.org/10.1109/usbereit65494.2025.11054088openalex-snapshot
Application of Computer Vision Algorithms for Assessing the Content of Magnetic Nanoparticles Uptaken by Dendritic Cells In-Vitro
inferred← citeshttps://doi.org/10.1109/wisa.2014.57openalex-snapshot
A Graph-Based Bursty Topic Detection Approach in User-Generated Texts
inferred← citeshttps://doi.org/10.1137/1.9781611973099.110openalex-snapshot
Efficient Algorithms for Maximum Weight Matchings in General Graphs with Small Edge Weights
inferred← citeshttps://doi.org/10.1137/110848311openalex-snapshot
Contractions, Removals, and Certifying 3-Connectivity in Linear Time
inferred← citeshttps://doi.org/10.1145/2071379.2071382openalex-snapshot
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
inferred← citeshttps://doi.org/10.1145/2529989openalex-snapshot
Linear-Time Approximation for Maximum Weight Matching
inferred← citeshttps://doi.org/10.14778/3828612.3828621openalex-snapshot
X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs
inferred← citeshttps://doi.org/10.1587/transinf.2015dap0030openalex-snapshot
A Scheme for Fast k-Concealment Anonymization
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8145openalex-snapshot
Filtering Algorithms Based on the Word-RAM Model
inferred← citeshttps://doi.org/10.24963/ijcai.2023/221openalex-snapshot
A Bitwise GAC Algorithm for Alldifferent Constraints
inferred← citeshttps://doi.org/10.3384/ecp11063784openalex-snapshot
Minimal Equation Sets for Output Computation in Object-Oriented Models
inferred← citeshttps://doi.org/10.48550/arxiv.0803.0792openalex-snapshot
Incremental Topological Ordering and Strong Component Maintenance
inferred← citeshttps://doi.org/10.48550/arxiv.1107.4711openalex-snapshot
Finding All Allowed Edges in a Bipartite Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1112.0790openalex-snapshot
Scaling algorithms for approximate and exact maximum weight matching
inferred← citeshttps://doi.org/10.48550/arxiv.1408.4900openalex-snapshot
Speeding Up Graph Algorithms via Switching Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1703.10023openalex-snapshot
Engineering DFS-Based Graph Algorithms
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.