On the public citation graph
Constructing disjoint paths on expander graphs
0 signed · 57 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/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1109/sfcs.1984.715909openalex-snapshot
Parallel Communication With Limited Buffers
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/12130.12146openalex-snapshot
Parallel hashing---an efficient implementation of shared memory
inferredcites →https://doi.org/10.1145/12130.12154openalex-snapshot
Explicit expanders and the Ramanujan conjectures
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/800220.806683openalex-snapshot
Randomized parallel communication (Preliminary Version)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20216openalex-snapshot
The fractional congestion bound for efficient edge disjoint routing
inferred← citeshttps://doi.org/10.1002/net.3230220705openalex-snapshot
Finding disjoint paths with different path‐costs: Complexity and algorithms
inferred← citeshttps://doi.org/10.1006/jcss.1998.1579openalex-snapshot
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
inferred← citeshttps://doi.org/10.1007/11803034_6openalex-snapshot
Semantic Data Management in Peer-to-Peer E-Commerce Applications
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_1openalex-snapshot
Disjoint Paths in Expander Graphs via Random Walks: a Short Survey
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_12openalex-snapshot
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
inferred← citeshttps://doi.org/10.1007/bf01270385openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferred← citeshttps://doi.org/10.1007/s00453-004-1086-1openalex-snapshot
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
inferred← citeshttps://doi.org/10.1007/s10107-002-0370-6openalex-snapshot
Approximating disjoint-path problems using packing integer programs
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.12.035openalex-snapshot
An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
inferred← citeshttps://doi.org/10.1016/j.cor.2009.12.009openalex-snapshot
Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.027openalex-snapshot
On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
inferred← citeshttps://doi.org/10.1017/s0963548300004284openalex-snapshot
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
inferred← citeshttps://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferred← citeshttps://doi.org/10.1109/acssc.2007.4487288openalex-snapshot
Further Results on Performance Analysis for Compressive Sensing Using Expander Graphs
inferred← citeshttps://doi.org/10.1109/focs.2007.19openalex-snapshot
Finding Disjoint Paths in Expanders Deterministically and Online
inferred← citeshttps://doi.org/10.1109/focs.2007.28openalex-snapshot
Polylogarithmic Independence Can Fool DNF Formulas
inferred← citeshttps://doi.org/10.1109/hicss.1998.649241openalex-snapshot
Multicommodity flow and circuit switching
inferred← citeshttps://doi.org/10.1109/itw.2007.4313110openalex-snapshot
Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs
inferred← citeshttps://doi.org/10.1109/jstsp.2008.924384openalex-snapshot
Recovering Sparse Signals Using Sparse Measurement Matrices in Compressed DNA Microarrays
inferred← citeshttps://doi.org/10.1109/secpri.2002.1004376openalex-snapshot
Expander graphs for digital stream authentication and robust overlay networks
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492462openalex-snapshot
Disjoint paths in densely embedded graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548467openalex-snapshot
Short paths in expander graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646130openalex-snapshot
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959932openalex-snapshot
Arc-disjoint paths in expander digraphs
inferred← citeshttps://doi.org/10.1137/25m1724717openalex-snapshot
Edge-Disjoint Paths in Expanders: Online with Removals
inferred← citeshttps://doi.org/10.1137/s0097539700366103openalex-snapshot
Edge-Disjoint Paths in Expander Graphs
inferred← citeshttps://doi.org/10.1137/s0097539701398582openalex-snapshot
Arc-Disjoint Paths in Expander Digraphs
inferred← citeshttps://doi.org/10.1137/s0097539792232021openalex-snapshot
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
inferred← citeshttps://doi.org/10.1145/129712.129727openalex-snapshot
Existence and construction of edge disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1145/225058.225075openalex-snapshot
Approximations for the disjoint paths problem in high-diameter planar networks
inferred← citeshttps://doi.org/10.1145/3087801.3087827openalex-snapshot
Distributed MST and Routing in Almost Mixing Time
inferred← citeshttps://doi.org/10.1145/378580.378586openalex-snapshot
Simple on-line algorithms for the maximum disjoint paths problem
inferred← citeshttps://doi.org/10.1145/509907.510003openalex-snapshot
Randomness conductors and constant-degree lossless expanders
inferred← citeshttps://doi.org/10.1145/73007.73062openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferred← citeshttps://doi.org/10.1287/moor.25.2.255.12228openalex-snapshot
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
inferred← citeshttps://doi.org/10.31979/etd.be7s-4dwpopenalex-snapshot
Family of Circulant Graphs and Its Expander Properties
inferred← citeshttps://doi.org/10.46298/dmtcs.2760openalex-snapshot
60/102 Null Boundary Cellular Automata based expander graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1711.01692openalex-snapshot
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
inferred← citeshttps://doi.org/10.53846/goediss-2467openalex-snapshot
Ramanujan Regular Hypergraphs based on special Affine Bruhat-Tits Buildings
inferred← citeshttps://doi.org/10.5555/313852.314072openalex-snapshot
An efficient algorithm for the vertex-disjoint paths problem in random graphs
inferred← citeshttps://doi.org/10.5555/338219.338631openalex-snapshot
Edge-disjoint paths in expander graphs
inferred← citeshttps://doi.org/10.6109/jkiice.2011.15.9.1939openalex-snapshot
Expander graphs based on 60/102 NBCA and its application
inferred← citeshttps://doi.org/10.7282/t3571bb2openalex-snapshot
Column generation and network modeling in large-scale logistics networks
inferred← citeshttps://doi.org/10.7907/f63k-gt12.openalex-snapshot
Compressive sensing for sparse approximations: constructions, algorithms, and analysis
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.