@inproceedings{layout, title={Seeded Tree Alignment and Planar Tanglegram Layout}, author={A. Lozano and R. Pinter and O. Rokhlenko and G. Valiente and Michal Ziv-Ukelson}, booktitle={WABI}, year={2007}, pages={98--110}, publisher={Springer Berlin Heidelberg}, address={Berlin, Heidelberg} } @misc {oeis, title = {The On-Line Encyclopedia of Integer Sequences}, author = {{OEIS Foundation Inc.}}, year = {2021}, howpublished = {\url{ http://oeis.org}} } @article {kura, AUTHOR = {Czabarka, \'{E}. and Sz\'{e}kely, L. A. and Wagner, S.}, TITLE = {A tanglegram {K}uratowski theorem}, JOURNAL = {J. Graph Theory}, FJOURNAL = {Journal of Graph Theory}, VOLUME = {90}, YEAR = {2019}, NUMBER = {2}, PAGES = {111--122}, MRCLASS = {05C10 (05C05 05C62 92D15)}, MRNUMBER = {3891929}, MRREVIEWER = {Uma kant Sahoo} } @article {analogy, AUTHOR = {Anderson, R. and Bai, S. and Barrera-Cruz, F. and Czabarka, \'{E}. and Da Lozzo, G. and Hobson, N. L. F. and Lin, J. C.-H. and Mohr, A. and Smith, H. C. and Sz\'{e}kely, L. A. and Whitlatch, H.}, TITLE = {Analogies between the crossing number and the tangle crossing number}, JOURNAL = {Electron. J. Combin.}, FJOURNAL = {Electronic Journal of Combinatorics}, VOLUME = {25}, YEAR = {2018}, NUMBER = {4}, PAGES = {Paper No. 4.24, 15}, MRCLASS = {05C62 (05C05 92D15)}, MRNUMBER = {3891091}, MRREVIEWER = {Robert Cimikowski} } @article{count, AUTHOR = {Billey, S. C. and Konvalinka, M. and Matsen, F. A.}, TITLE = {On the enumeration of tanglegrams and tangled chains}, JOURNAL = {J. Combin. Theory Ser. A}, FJOURNAL = {Journal of Combinatorial Theory. Series A}, VOLUME = {146}, YEAR = {2017}, PAGES = {239--263}, MRCLASS = {05A15 (05A19 05C05)}, MRNUMBER = {3574231}, MRREVIEWER = {Kevin Lawrence McAvaney} } @article {algorithm, AUTHOR = {Buchin, K. and Buchin, M. and Byrka, J. and N\"{o}llenburg, M. and Okamoto, Y. and Silveira, R. I. and Wolff, A.}, TITLE = {Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tract\-ability}, JOURNAL = {Algorithmica}, FJOURNAL = {Algorithmica. An International Journal in Computer Science}, VOLUME = {62}, YEAR = {2012}, NUMBER = {1-2}, PAGES = {309--332}, MRCLASS = {05C62 (05C85)}, MRNUMBER = {2886045}, MRREVIEWER = {Stephen K. Wismath} } @article{insert1, author = {Gutwenger, C. and Mutzel, P. and Weiskircher, R.}, journal={Algorithmica}, volume={41}, year={2001}, pages = {289-308}, title = {Inserting an edge into a planar graph.} } % https://www.researchgate.net/publication/220779813_Inserting_an_edge_into_a_planar_graph (optimal bridge insertion algorithm, linear time) % https://www.researchgate.net/publication/226031756_On_the_Crossing_Number_of_Almost_Planar_Graphs (bounds the bridging minimization problem with respect to the crossing minimization problem) @article{randomtanglegram, title={The shape of random tanglegrams}, author={M. Konvalinka and S. Wagner}, journal={Adv. in Appl. Math.}, year={2016}, volume={78}, pages={76-93} } @article{species, title={Counting tanglegrams with species}, author={I. M. Gessel}, journal={J. Comb. Theory, Ser. A}, year={2021}, volume={184}, pages={105498} } @InProceedings{almostplanar, author="Hlin{\v{e}}n{\'y}, P. and Salazar, G.", title="On the Crossing Number of Almost Planar Graphs", booktitle="Graph Drawing", year="2007", publisher="Springer Berlin Heidelberg", address="Berlin, Heidelberg", pages="162--173", } @article{insertmulti, author = {Chimani, M. and Hlin\v{e}n\'{y}, P.}, year = {2017}, month = {05}, pages = {}, title = {A tighter insertion-based approximation of the crossing number}, volume = {33}, journal = {Journal of Combinatorial Optimization} } @article{CNNP, AUTHOR={Garey, M. R. and Johnson, D. S.}, TITLE={Crossing number is NP-complete}, JOURNAL={SIAM J. Algebraic Discrete Methods}, Volume={4}, YEAR={1983}, NUMBER={3}, PAGES={312-316}, } %Garey, M. R.; Johnson, D. S. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4 (1983), no. 3, 312–316. % https://learn.fmi.uni-sofia.bg/pluginfile.php/160153/mod_resource/content/4/Crossing-Number-Is-NP-Complete_Garey_Johnson.pdf (crossing number is NP-complete for graphs in general) %https://arxiv.org/abs/1104.5039 (approximation algorithm from inserting multiple edges into a graph) @article{reduction, title={Tanglegrams: a reduction tool for mathematical phylogenetics}, author={F. A. Matsen and S. C. Billey and A. Kas and M. Konvalinka}, year={2015}, journal={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume={15}, number={1}, pages={343--349} } @book{knuth, author = {Knuth, D. E.}, title = {The Art of Computer Programming, Volume 1 (3rd Ed.): Fundamental Algorithms}, year = {1997}, publisher = {Addison Wesley Longman Publishing Co., Inc.}, address = {USA} } @article{graphcrossing, title={Towards better approximation of graph crossing number}, author={J. Chuzhoy and S. Mahabadi and Z. Tan}, journal={2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)}, year={2020}, pages={73-84} } @article{tlhard, author = {Fernau, H. and Kaufmann, M. and Poths, M.}, title = {Comparing trees via crossing minimization}, journal={J. Comput. Syst. Sci.}, year={2010}, volume={76}, pages={593-608} } } @InProceedings{countingplanar, author = {D. Ralaivaosaona and J. B. Ravelomanana and S. Wagner}, title = {{Counting Planar Tanglegrams}}, booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)}, pages = {32:1--32:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, year = {2018}, volume = {110}, publisher = {Schloss Dagstuhl-Leibniz-Zentrum f\"{u}r Informatik}, address = {Dagstuhl, Germany} } @misc{liu2022, title={Characterizing planar tanglegram layouts and applications to edge insertion problems}, author={K. Liu}, year={2022}, eprint={2201.10533}, eprinttype={arXiv} }