FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897791
DOI10.1007/11590156zbMath1172.05315OpenAlexW2484051058MaRDI QIDQ5897791
Henning Fernau, Michael Kaufmann, Mathias Poths
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Trees (05C05) Problems related to evolution (92D15) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (6)
Analogies between the crossing number and the tangle crossing number ⋮ Inducibility in Binary Trees and Crossings in Random Tanglegrams ⋮ Unnamed Item ⋮ Drawing (complete) binary tanglegrams ⋮ Parameterized algorithms for \(d\)-hitting set: the weighted case ⋮ A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
