On the public citation graph

The complexity of drawing trees nicely

https://doi.org/10.1007/bf00289576
0 signed · 89 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.1002/spe.4380100706openalex-snapshot
Pretty‐printing of trees
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0396605-3openalex-snapshot
Bounds on Positive Integral Solutions of Linear Diophantine Equations
inferredcites →https://doi.org/10.1109/tse.1979.234212openalex-snapshot
Tidy Drawings of Trees
inferredcites →https://doi.org/10.1109/tse.1981.234519openalex-snapshot
Tidier Drawings of Trees
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/359423.359434openalex-snapshot
A numbering system for binary trees
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/ecjc.4430750504openalex-snapshot
An algorithm for testing the planarity of a hierarchical graph
inferred← citeshttps://doi.org/10.1002/net.10092openalex-snapshot
A linear algorithm for compact box‐drawings of trees
inferred← citeshttps://doi.org/10.1002/scj.4690240804openalex-snapshot
A graph editor for large trees with browsing and zooming capabilities
inferred← citeshttps://doi.org/10.1002/spe.2213openalex-snapshot
Drawing non-layered tidy trees in linear time
inferred← citeshttps://doi.org/10.1002/spe.4380200705openalex-snapshot
A node‐positioning algorithm for general trees
inferred← citeshttps://doi.org/10.1002/spe.4380230802openalex-snapshot
Aesthetic layout of generalized trees
inferred← citeshttps://doi.org/10.1007/11618058_16openalex-snapshot
Delta-Confluent Drawings
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_49openalex-snapshot
Cabri, an interactive system for graph manipulation
inferred← citeshttps://doi.org/10.1007/3-540-36151-0_32openalex-snapshot
Improving Walker’s Algorithm to Run in Linear Time
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-44969-8_11openalex-snapshot
Software Packages
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_12openalex-snapshot
On the complexity of optimal drawings of graphs
inferred← citeshttps://doi.org/10.1007/3-540-52698-6_1openalex-snapshot
Nice drawings of graphs are computationally hard
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_42openalex-snapshot
Optimal upward planarity testing of single-source digraphs
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_386openalex-snapshot
Optimal-area upward drawings of AVL trees
inferred← citeshttps://doi.org/10.1007/3-540-62495-3_50openalex-snapshot
Constrained graph layout
inferred← citeshttps://doi.org/10.1007/978-0-387-35175-9_8openalex-snapshot
Constructing memorable asymmetric information diagrams in three dimensions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3166-3_26openalex-snapshot
Geometrization for Interactive Software Development
inferred← citeshttps://doi.org/10.1007/978-1-4615-4121-9_13openalex-snapshot
Networks and Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81885-2_3openalex-snapshot
Tree Traversal
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_25openalex-snapshot
On Upward Drawings of Trees on a Given Grid
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_10openalex-snapshot
Drawing Ordered (k − 1)–Ary Trees on k–Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_654-1openalex-snapshot
Symmetric Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_20openalex-snapshot
Drawing Unordered Trees on k-Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-60238-2_9openalex-snapshot
Animation der semantischen Analyse
inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_38openalex-snapshot
PRISMA — Ein Informationssystem für Moderne Kunst im Internet
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_3openalex-snapshot
Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/bf00264230openalex-snapshot
Drawing plane graphs nicely
inferred← citeshttps://doi.org/10.1007/bf00419035openalex-snapshot
Drawing orders using less ink
inferred← citeshttps://doi.org/10.1007/bf01931294openalex-snapshot
A linear time and space algorithm for finding isomorphic subtrees of a binary tree
inferred← citeshttps://doi.org/10.1007/bf02086608openalex-snapshot
The realization problem for Euclidean minimum spanning trees is NP-hard
inferred← citeshttps://doi.org/10.1007/bf02187850openalex-snapshot
Area requirement and symmetry display of planar upward drawings
inferred← citeshttps://doi.org/10.1007/bfb0022103openalex-snapshot
Knowledge-based editors for directed graphs
inferred← citeshttps://doi.org/10.1007/bfb0038193openalex-snapshot
Trees — a personal view
inferred← citeshttps://doi.org/10.1007/s00236-004-0138-yopenalex-snapshot
On the complexity of drawing trees nicely: corrigendum
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90038-yopenalex-snapshot
A layout tool for Glotos
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90110-xopenalex-snapshot
Fixed edge-length graph drawing is NP-hard
inferred← citeshttps://doi.org/10.1016/0166-3615(93)90004-kopenalex-snapshot
Graphical and natural language interface with a knowledge-based concurrent engineering environment
inferred← citeshttps://doi.org/10.1016/0196-6774(82)90011-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90021-jopenalex-snapshot
A note on optimal area algorithms for upward drawings of binary trees
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-0-12-037101-3.50011-9openalex-snapshot
Attribute Graph Grammars with Applications to Hichart Program Chart Editors* *This Research is partially supported by Ichimaru Corporation.
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
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/s0020-0190(98)00068-4openalex-snapshot
Depth-first layout algorithm for trees
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70553-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00013-8openalex-snapshot
Linear area upward drawings of AVL trees
inferred← citeshttps://doi.org/10.1016/s1045-926x(05)80049-7openalex-snapshot
Visual logic programming
inferred← citeshttps://doi.org/10.1017/s0956796800001842openalex-snapshot
Functional Pearls
inferred← citeshttps://doi.org/10.1023/a:1009771921595openalex-snapshot
Constrained Graph Layout
inferred← citeshttps://doi.org/10.1080/00207168808803629openalex-snapshot
On circular layouts∗
inferred← citeshttps://doi.org/10.1080/0025570x.1990.11977510openalex-snapshot
How Hard Can It Be to Draw a Pie Chart?
inferred← citeshttps://doi.org/10.1109/21.87055openalex-snapshot
Automatic graph drawing and readability of diagrams
inferred← citeshttps://doi.org/10.1109/cmpsac.1993.404192openalex-snapshot
A method of drawing tree-structured program diagrams on the Euclidian plane
inferred← citeshttps://doi.org/10.1109/iccsse.1989.72717openalex-snapshot
Holistic displays
inferred← citeshttps://doi.org/10.1109/icdim.2016.7829773openalex-snapshot
Attribute graph grammar method for research information collection and sharing
inferred← citeshttps://doi.org/10.1109/iemc.1995.524609openalex-snapshot
Designing tree structure diagrams for management
inferred← citeshttps://doi.org/10.1109/iv.2002.1028778openalex-snapshot
A visualization system of relationships among papers based on the graph drawing problem
inferred← citeshttps://doi.org/10.1109/lfa.1988.24961openalex-snapshot
Akrti: a system for drawing data structure
inferred← citeshttps://doi.org/10.1109/mcs.1987.1105300openalex-snapshot
Interactive graphics for the computer-aided design of dynamic systems
inferred← citeshttps://doi.org/10.1109/ropec50909.2020.9258774openalex-snapshot
Understandability in class diagrams
inferred← citeshttps://doi.org/10.1109/snpd.2012.109openalex-snapshot
O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams
inferred← citeshttps://doi.org/10.1109/snpd.2013.76openalex-snapshot
Optimality and Complexity for Drawing Problems of Tree-Structured Diagrams
inferred← citeshttps://doi.org/10.1109/topoinvis57755.2022.00015openalex-snapshot
Untangling Force-Directed Layouts Using Persistent Homology
inferred← citeshttps://doi.org/10.1109/tse.1981.234519openalex-snapshot
Tidier Drawings of Trees
inferred← citeshttps://doi.org/10.1111/j.1467-8659.1990.tb00386.xopenalex-snapshot
Top Draw: A Structure Network Visualiser for PHIGS
inferred← citeshttps://doi.org/10.1137/s0097539792235724openalex-snapshot
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
inferred← citeshttps://doi.org/10.1137/s0097539794279626openalex-snapshot
Optimal Upward Planarity Testing of Single-Source Digraphs
inferred← citeshttps://doi.org/10.1142/9789812773289_0016openalex-snapshot
NP-Completeness of Minimal Width Unordered Tree Layout
inferred← citeshttps://doi.org/10.1145/142675.142728openalex-snapshot
A framework for dynamic graph drawing
inferred← citeshttps://doi.org/10.1145/160985.161165openalex-snapshot
Area-efficient upward tree drawings
inferred← citeshttps://doi.org/10.1145/177424.177507openalex-snapshot
The realization problem for Euclidean minimum spanning trees is NP-hard
inferred← citeshttps://doi.org/10.1145/323233.323254openalex-snapshot
A method for drawing graphs
inferred← citeshttps://doi.org/10.1145/345513.345354openalex-snapshot
A meta heuristic for graph drawing
inferred← citeshttps://doi.org/10.1145/3759427.3760370openalex-snapshot
How to Fold a Tree: Programming Exercises on Calder’s Mobiles
inferred← citeshttps://doi.org/10.1145/73833.73839openalex-snapshot
Area requirement and symmetry display in drawing graphs
inferred← citeshttps://doi.org/10.1287/isre.4.1.55openalex-snapshot
Reframing Decision Problems: A Graph-Grammar Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4408openalex-snapshot
Embedding Graphs under Centrality Constraints for Network Visualization
inferred← citeshttps://doi.org/10.5220/0007307700002108openalex-snapshot
Combining Interactive Hierarchy Visualizations in a Web-based Application
inferred← citeshttps://doi.org/10.7155/jgaa.00090openalex-snapshot
Computing and Drawing Isomorphic Subgraphs
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.