On the public citation graph
Graph embeddings 1988: Recent breakthroughs, new directions
0 signed · 40 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/bf02579202openalex-snapshot
Expanding graphs contain all small trees
inferredcites →https://doi.org/10.1016/0095-8956(79)90021-2openalex-snapshot
The book thickness of a graph
inferredcites →https://doi.org/10.1109/sfcs.1986.38openalex-snapshot
Optimal simulations of tree machines
inferredcites →https://doi.org/10.1109/tc.1983.1676134openalex-snapshot
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
inferredcites →https://doi.org/10.1109/tc.1985.1676584openalex-snapshot
Wafer-Scale Integration of Systolic Arrays
inferredcites →https://doi.org/10.1137/0608002openalex-snapshot
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
inferredcites →https://doi.org/10.1137/0608018openalex-snapshot
Embedding Outerplanar Graphs in Small Books
inferredcites →https://doi.org/10.1145/12130.12141openalex-snapshot
Four pages are necessary and sufficient for planar graphs
inferredcites →https://doi.org/10.1145/1634.2377openalex-snapshot
Configuration of VLSI Arrays in the Presence of Defects
inferredcites →https://doi.org/10.1145/2157.322401openalex-snapshot
Cost Trade-offs in Graph Embeddings, with Applications
inferredcites →https://doi.org/10.1145/28395.28425openalex-snapshot
Reconfiguring a hypercube in the presence of faults
inferredcites →https://doi.org/10.1145/28395.28437openalex-snapshot
The page number of genus g graphs is (g)
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/44483.44489openalex-snapshot
The physical mapping problem for parallel architectures
inferredcites →https://doi.org/10.1145/62212.62229openalex-snapshot
Optimal simulations by Butterfly Networks
inferredcites →https://doi.org/10.21236/ada200780openalex-snapshot
Optimal Simulations by Butterfly Networks
inferredcites →https://doi.org/10.7551/mitpress/1102.003.0015openalex-snapshot
Embedding Large Tree Machines into Small Ones
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1424openalex-snapshot
Optimal Embedding of Complete Binary Trees into Lines and Grid
inferred← citeshttps://doi.org/10.1007/10692760_20openalex-snapshot
Improved Compressions of Cube-Connected Cycles Networks
inferred← citeshttps://doi.org/10.1007/3-540-53832-1_42openalex-snapshot
Embeddings of treelike graphs into 2-dimensional meshes
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_46openalex-snapshot
Is the shuffle-exchange better than the butterfly?
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_3openalex-snapshot
Optimal embedding of complete binary trees into lines and grids
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_27openalex-snapshot
Parallel architectures: Design and efficient use
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_15openalex-snapshot
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
inferred← citeshttps://doi.org/10.1007/bf01379319openalex-snapshot
OREGAMI: Tools for mapping parallel computations to parallel architectures
inferred← citeshttps://doi.org/10.1007/s00453-024-01278-5openalex-snapshot
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90252-bopenalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.03.001openalex-snapshot
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00037-6openalex-snapshot
Efficient embeddings of ternary trees into hypercubes
inferred← citeshttps://doi.org/10.1063/5.0225049openalex-snapshot
Embedding (K9 – C9) n into 2-CAT and triangular snake graph
inferred← citeshttps://doi.org/10.1109/71.539736openalex-snapshot
Parallel divide and conquer on meshes
inferred← citeshttps://doi.org/10.1109/71.706051openalex-snapshot
Improved compressions of cube-connected cycles networks
inferred← citeshttps://doi.org/10.1109/fmpc.1992.234914openalex-snapshot
Optimal implementation of parallel divide-and-conquer algorithms on de Bruijn networks
inferred← citeshttps://doi.org/10.1109/icpp.1996.537383openalex-snapshot
Edge embedding of two-dimensional grids in hypercubes with dilation two and congestion three
inferred← citeshttps://doi.org/10.1109/ipps.1992.223065openalex-snapshot
Generalized compressed tree machines
inferred← citeshttps://doi.org/10.1109/spdp.1990.143659openalex-snapshot
Compressing cube-connected cycles and butterfly networks
inferred← citeshttps://doi.org/10.1109/spdp.1992.242739openalex-snapshot
On embedding ternary trees into Boolean hypercubes
inferred← citeshttps://doi.org/10.1109/spdp.1995.530748openalex-snapshot
Bisection widths of transposition graphs
inferred← citeshttps://doi.org/10.1145/73833.73866openalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
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.