On the public citation graph

Computational complexity of geometric symmetry detection in graphs

https://doi.org/10.1007/bfb0038465
0 signed · 20 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0166-218x(92)90112-nopenalex-snapshot
Fast detection and display of symmetry in outerplanar graphs
inferredcites →https://doi.org/10.1137/0210002openalex-snapshot
Some NP-Complete Problems Similar to Graph Isomorphism
inferredcites →https://doi.org/10.1145/323233.323254openalex-snapshot
A method for drawing graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-36151-0_8openalex-snapshot
Computing and Drawing Isomorphic Subgraphs
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_26openalex-snapshot
Graph Multidrawing: Finding Nice Drawings Without Defining Nice
inferred← citeshttps://doi.org/10.1007/3-540-45848-4_15openalex-snapshot
Detecting Symmetries by Branch & Cut
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_378openalex-snapshot
A system for drawing graphs with geometric symmetry
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_16openalex-snapshot
An Integer Programming Approach to Fuzzy Symmetry Detection
inferred← citeshttps://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferred← citeshttps://doi.org/10.1007/s00453-002-1011-4openalex-snapshot
Drawing Trees Symmetrically in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-004-1132-zopenalex-snapshot
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00453-007-9050-5openalex-snapshot
Testing Planarity of Geometric Automorphisms in Linear Time
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90112-nopenalex-snapshot
Fast detection and display of symmetry in outerplanar graphs
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00014-xopenalex-snapshot
Algorithms for drawing graphs: an annotated bibliography
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50022-xopenalex-snapshot
Graph Drawing**Work supported in part by the National Science Foundation under grant CCR-9732327, and by the U.S. Army Research Office under grant DAAH04-96-1-0013.
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00239-xopenalex-snapshot
Spring algorithms and symmetry
inferred← citeshttps://doi.org/10.1201/b16812-17openalex-snapshot
Graph Drawing
inferred← citeshttps://doi.org/10.70675/95fb364azf8b2z4edczb25dz3fc6ef2d836dopenalex-snapshot
Modélisation, approche polyédrale et approche arborescente pour des problèmes de comparaison de graphes
inferred← citeshttps://doi.org/10.7155/jgaa.00090openalex-snapshot
Computing and Drawing Isomorphic Subgraphs
inferred← citeshttps://doi.org/10.7155/jgaa.00150openalex-snapshot
Large-Graph Layout Algorithms at Work: An Experimental Study
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.