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
2
search results - page 1 / 1
»
Drawing (Complete) Binary Tanglegrams: Hardness, Approximati...
Sort
relevance
views
votes
recent
update
View
thumb
title
86
click to vote
CORR
2008
Springer
83
views
Education
»
more
CORR 2008
»
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
15 years 4 months ago
Download
www1.informatik.uni-wuerzburg.de
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin...
claim paper
Read More »
145
click to vote
ALENEX
2009
106
views
Algorithms
»
more
ALENEX 2009
»
Drawing Binary Tanglegrams: An Experimental Evaluation
15 years 5 months ago
Download
www.win.tue.nl
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »