On the public citation graph

Comparing Trees Via Crossing Minimization

0 signed · 38 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.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/bf01187020openalex-snapshot
Edge crossings in drawings of bipartite graphs
inferredcites →https://doi.org/10.1016/0304-3975(94)90179-1openalex-snapshot
Drawing graphs in two layers
inferredcites →https://doi.org/10.1016/0304-3975(95)80015-8openalex-snapshot
Alignment of trees — an alternative to tree edit
inferredcites →https://doi.org/10.1016/j.tcs.2004.12.030openalex-snapshot
A survey on tree edit distance and related problems
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1090/conm/089/1006472openalex-snapshot
The Robertson-Seymour theorems: a survey of applications
inferredcites →https://doi.org/10.1093/bioinformatics/17.suppl_1.s22openalex-snapshot
Fast optimal leaf ordering for hierarchical clustering
inferredcites →https://doi.org/10.1137/0218082openalex-snapshot
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
inferredcites →https://doi.org/10.1137/s0097539791218202openalex-snapshot
Ordered and Unordered Tree Inclusion
inferredcites →https://doi.org/10.1137/s0097539794279626openalex-snapshot
Optimal Upward Planarity Testing of Single-Source Digraphs
inferredcites →https://doi.org/10.1145/128749.128752openalex-snapshot
Nonlinear pattern matching in trees
inferredcites →https://doi.org/10.5555/338219.338628openalex-snapshot
A tree-edit-distance algorithm for comparing simple, closed shapes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22370openalex-snapshot
A tanglegram Kuratowski theorem
inferred← citeshttps://doi.org/10.1007/11758471_32openalex-snapshot
Parameterized Algorithms for Hitting Set: The Weighted Case
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_281openalex-snapshot
Parameterized Algorithms for Drawing Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_281openalex-snapshot
Parameterized Algorithms for Drawing Graphs
inferred← citeshttps://doi.org/10.1007/978-1-60327-159-2_24openalex-snapshot
Fixed-Parameter Algorithms in Phylogenetics
inferred← citeshttps://doi.org/10.1007/978-3-540-77537-9_19openalex-snapshot
Matched Drawings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_32openalex-snapshot
Drawing (Complete) Binary Tanglegrams
inferred← citeshttps://doi.org/10.1007/978-3-642-00727-9_13openalex-snapshot
Generalized Binary Tanglegrams: Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-01551-9_10openalex-snapshot
Untangling Tanglegrams: Comparing Trees by Their Drawings
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_3openalex-snapshot
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
inferred← citeshttps://doi.org/10.1007/s00453-010-9456-3openalex-snapshot
Drawing (Complete) Binary Tanglegrams
inferred← citeshttps://doi.org/10.1007/s11083-021-09563-6openalex-snapshot
An Infinite Antichain of Planar Tanglegrams
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.001openalex-snapshot
Parameterized algorithms for d -Hitting Set: The weighted case
inferred← citeshttps://doi.org/10.1109/cscloud.2015.47openalex-snapshot
An Approach to Minimize Crossings in Phylogenetic Trees
inferred← citeshttps://doi.org/10.1109/geoinformatics.2009.5293552openalex-snapshot
Quantitative visualizations of hierarchically organized data in a geographic context
inferred← citeshttps://doi.org/10.1109/tcbb.2010.57openalex-snapshot
Untangling Tanglegrams: Comparing Trees by Their Drawings
inferred← citeshttps://doi.org/10.1137/1.9781611972894.11openalex-snapshot
Drawing Binary Tanglegrams: An Experimental Evaluation
inferred← citeshttps://doi.org/10.1145/1879211.1879238openalex-snapshot
Visual comparison of software architectures
inferred← citeshttps://doi.org/10.1177/1473871612455983openalex-snapshot
Visual comparison of software architectures
inferred← citeshttps://doi.org/10.1186/1471-2148-13-221openalex-snapshot
Looking for trees in the forest: summary tree from posterior samples
inferred← citeshttps://doi.org/10.37236/12194openalex-snapshot
The Largest Crossing Number of Tanglegrams
inferred← citeshttps://doi.org/10.37236/7581openalex-snapshot
Analogies between the Crossing Number and the Tangle Crossing Number
inferred← citeshttps://doi.org/10.48550/arxiv.0806.0920openalex-snapshot
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
inferred← citeshttps://doi.org/10.48550/arxiv.1306.3538openalex-snapshot
Exact and fixed-parameter algorithms for metro-line crossing minimization problems
inferred← citeshttps://doi.org/10.7155/jgaa.00193openalex-snapshot
Matched Drawings of Planar Graphs
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.