Drawing (Complete) binary tanglegrams hardness, approximation, fixed-parameter tractability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5417 LNCS, Issue , 2009, Pages 324-335

  Buchin, Kevin ^a   Buchin, Maike ^a   Byrka, Jaroslaw ^b,c   Nöllenburg, Martin ^d   Okamoto, Yoshio ^e   Silveira, Rodrigo I ^a   Wolff, Alexander ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c CWI   (Netherlands)

^d UNIVERSITY OF KARLSRUHE   (Germany)

^e TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DRAWING (GRAPHICS); TREES (MATHEMATICS);

COMPLETE BINARY TREE; CONSTANT FACTOR APPROXIMATION; DUAL PROBLEM; EDGE CROSSING; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; PHYLOGENETICS; UNIQUE GAMES CONJECTURE;

BINARY TREES;

EID: 68749086483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00219-9_32     Document Type: Conference Paper

References (17)

1. Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward pla-narity testing of single-source digraphs. SIAM J. Comput. 27(1), 132-169 (1998)
2. Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability (2008), http://arxiv.org/abs/0806. 0920 Arxiv report
3. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: Proc. 18th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA 1997), pp. 427-436 (1997)
4. Dujmović, V., Fernau, H., Kaufmann, M.: Fixed Parameter Algorithms for ONESIDED CROSSING MINIMIZATION Revisited. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 332-344. Springer, Heidelberg (2004)
5. Dwyer, T., Schreiber, F.: Optimal leaf ordering for two and a half dimensional phylogenetic tree visualization. In: Proc. Australasian Sympos. Inform. Visual (In-Vis.au 2004). CRPIT, vol. 35, pp. 109-115. Australian Comput. Soc. (2004)
6. Eades, P., Wormald, N.: Edge crossings in drawings of bipartite graphs. Algorithmica 10, 379-403 (1994)
7. Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 457-469. Springer, Heidelberg (2005)
8. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115-1145 (1995)
9. Hafner, M.S., Sudman, P.D., Villablanca, F.X., Spradling, T.A., Demastes, J.W., Nadler, S.A.: Disparate rates of molecular evolution in cospeciating hosts and parasites. Science 265, 1087-1090 (1994)
10. Holten, D., van Wijk, J.J.: Visual comparison of hierarchically organized data. In: Proc. 10th Eurographics/IEEE-VGTC Sympos. Visualization (Euro Vis 2008), pp. 759-766 (2008)
11. Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th Annu. ACM Sympos. Theory Comput (STOC 2002), pp. 767-775 (2002)
12. 1. In: Proc. 46th Annu. IEEE Sympos. Foundat. Comput. Sci. (FOCS 2005), pp. 53-62 (2005)
13. Lozano, A., Pinter, R.Y., Rokhlenko, O., Valiente, G., Ziv-Ukelson, M.: Seeded tree alignment and planar tanglegram layout. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol. 4645, pp. 98-110. Springer, Heidelberg (2007)
14. Nagamochi, H.: An improved bound on the one-sided minimum crossing number in two-layered drawings. Discrete Comput. Geom. 33(4), 565-591 (2005)
15. Nöllenburg, M., Holten, D., Völker, M., Wolff, A.: Drawing binary tanglegrams: An experimental evaluation. Arxiv report (2008), http://arxiv.org/abs/0806.0928
16. Page, R.D.M. (ed.): Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University of Chicago Press (2002)
17. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11(2), 109-125 (1981)