On the public citation graph
An Algorithmic Friedman–Pippenger Theorem on Tree Embeddings and Applications
0 signed · 29 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-63890-3_36openalex-snapshot
On defect sets in bipartite graphs (extended abstract)
inferredcites →https://doi.org/10.1007/978-3-642-04016-0openalex-snapshot
Graph Colouring and the Probabilistic Method
inferredcites →https://doi.org/10.1007/978-3-642-72905-8_4openalex-snapshot
On Size Ramsey Number of Paths, Trees and Circuits. II
inferredcites →https://doi.org/10.1007/bf02579202openalex-snapshot
Expanding graphs contain all small trees
inferredcites →https://doi.org/10.1007/s00493-007-2182-zopenalex-snapshot
Embedding nearly-spanning bounded degree trees
inferredcites →https://doi.org/10.1007/s004930050049openalex-snapshot
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications
inferredcites →https://doi.org/10.1016/0012-365x(76)90068-6openalex-snapshot
Hamiltonian circuits in random graphs
inferredcites →https://doi.org/10.1109/ccc.2002.1004327openalex-snapshot
Randomness conductors and constant-degree lossless expanders
inferredcites →https://doi.org/10.1109/focs.2006.18openalex-snapshot
Better lossless condensers through derandomized curve samplers
inferredcites →https://doi.org/10.1137/s0097539700379760openalex-snapshot
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning
inferredcites →https://doi.org/10.1137/s0097539791221499openalex-snapshot
On-Line Algorithms for Path Selection in a Nonblocking Network
inferredcites →https://doi.org/10.1145/100216.100232openalex-snapshot
On-line algorithms for path selection in a nonblocking network
inferredcites →https://doi.org/10.1145/1109557.1109672openalex-snapshot
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing
inferredcites →https://doi.org/10.1145/235809.235812openalex-snapshot
Efficient routing in optical networks
inferredcites →https://doi.org/10.1145/380752.380790openalex-snapshot
Loss-less condensers, unbalanced expanders, and extractors
inferredcites →https://doi.org/10.1145/509907.510003openalex-snapshot
Randomness conductors and constant-degree lossless expanders
inferredcites →https://doi.org/10.5555/314464.314579openalex-snapshot
Efficient routing and scheduling algorithms for optical networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20345openalex-snapshot
Local resilience of almost spanning trees in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20545openalex-snapshot
An improved upper bound on the density of universal random graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_20openalex-snapshot
An Improved Upper Bound on the Density of Universal Random Graphs
inferred← citeshttps://doi.org/10.1007/s10878-017-0214-1openalex-snapshot
Sparse multipartite graphs as partition universal for graphs with bounded degree
inferred← citeshttps://doi.org/10.1090/tran/8660openalex-snapshot
Rolling backwards can move you forward: On embedding problems in sparse expanders
inferred← citeshttps://doi.org/10.1137/130942437openalex-snapshot
Universality of Random Graphs for Graphs of Maximum Degree Two
inferred← citeshttps://doi.org/10.1145/3564246.3585134openalex-snapshot
Almost Chor-Goldreich Sources and Adversarial Random Walks
inferred← citeshttps://doi.org/10.48550/arxiv.1310.5873openalex-snapshot
Universality of random graphs for graphs of maximum degree two
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6966openalex-snapshot
Sparse Multipartite Graphs as Partition Universal for Graphs of Bounded-Degrees
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.