Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
96
click to vote
GD
2008
Springer
139
views
Computer Graphics
»
more
GD 2008
»
Drawing (Complete) Binary Tanglegrams
15 years 3 months ago
Download
www.ii.uni.wroc.pl
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin
Real-time Traffic
Computer Graphics
|
GD 2008
|
claim paper
Related Content
»
Drawing Binary Tanglegrams An Experimental Evaluation
»
Drawing Complete Binary Tanglegrams Hardness Approximation FixedParameter Tractability
»
Exact Bipartite Crossing Minimization under Tree Constraints
»
MinimumArea hv Drawings of Complete Binary Trees
»
When Random Play is Optimal Against an Adversary
»
ETE a python Environment for Tree Exploration
more »
Post Info
More Details (n/a)
Added
09 Nov 2010
Updated
09 Nov 2010
Type
Conference
Year
2008
Where
GD
Authors
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff
Comments
(0)
Researcher Info
Computer Graphics Study Group
Computer Vision