A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley series in computer science and information processing. Addison-Wesley Publishing Company, Michigan University, 1st edition, 1974.

Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. Edge crossings in random linear arrangements. Journal of Statistichal Mechanics, 2020:023403, 2020.

Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. Fast calculation of the variance of edge crossings. Arxiv, 2021.

Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees. 2022.

Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. Linear-time calculation of the expected sum of edge lengths in projective linearizations of trees. Computational Linguistics, pages 1–25, 04 2022.

Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. The Maximum Linear Arrangement for trees under projectivity and planarity. Arxiv, 2022.

Lluís Alemany-Puig, Juan Luis Esteban, and Ramon Ferrer-i-Cancho. Minimum projective linearizations of trees in linear time. Information Processing Letters, 174:106204, 2022.

Lluís Alemany-Puig. Edge crossings in linear arrangements: from theory to algorithms and applications. Master Thesis (M. Sc.), 2019. https://upcommons.upc.edu/handle/2117/168124.

Patrick Bennett, Sean English, and Maria Talanda-Fisher. Weighted Turán problems with applications. Discrete Mathematics, 342(8):2165–2172, 2019.

Terry Beyer and Sandra Mitchell Hedetniemi. Constant time generation of rooted trees. SIAM Journal on Computing, 9(4):706–712, 1980.

Fan R. K. Chung. On optimal linear arrangements of trees. Computers and Mathematics with Applications, 10(1):43–60, 1984.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, Cambridge, MA, USA, 2nd edition, 2001.

Juan Luis Esteban and Ramon Ferrer-i-Cancho. A correction on Shiloach's algorithm for minimum linear arrangements of trees. Society for Industrial and Applied Mathematics, 46(3):1146–1151, 2017.

Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, and Juan Luis Esteban. Are crossing dependencies really scarce? Physica A: Statistical Mechanics and its Applications, 493:311–329, 2018.

Ramon Ferrer-i-Cancho. Euclidean distance between syntactically linked words. Physical Review E, 70(5):5, 2004.

Ramon Ferrer-i-Cancho. A stronger null hypothesis for crossing dependencies. CoRR, abs/1410.5485, 2014.

Ramon Ferrer-i-Cancho. The sum of edge lengths in random linear arrangements. Journal of Statistical Mechanics: Theory and Experiment, 2019:053401, 05 2019.

Richard Futrell, Kyle Mahowald, and Edward Gibson. Large-scale evidence of dependency length minimization in 37 languages. Proceedings of the National Academy of Sciences, 112(33):10336–10341, 2015.

Daniel Gildea and David Temperley. Optimizing Grammars for Minimum Dependency Length. In Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 184–191, Prague, Czech Republic, June 2007. Association for Computational Linguistics.

The GNU Multiple Precision Arithmetic Library. https://gmplib.org/. Accessed: 2020-03-24.

Carlos Gómez-Rodríguez, John Carroll, and David Weir. Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing. Computational Linguistics, 37:541–586, 2011.

Frank Harary and Allen J. Schwenk. The number of caterpillars. Discrete Mathematics, 6:359–365, 1973.

Frank Harary. Graph Theory. CRC Press, Boca Raton, FL, USA, 2nd edition, 1969.

Robert A. Hochberg and Matthias F. Stallmann. Optimal one-page tree embeddings in linear time. Information Processing Letters, 87(2):59–66, 2003.

Yingqi Jing and Haitao Liu. Mean Hierarchical Distance: Augmenting Mean Dependency Distance. Proceedings of the Third International Conference on Dependency Linguistics (Depling 2015), (Depling):161–170, 2015.

Sylvain Kahane, Chunxiao Yan, and Marie-Amélie Botalla. What are the limitations on the flux of syntactic dependencies? Evidence from UD treebanks. pages 73–82, 9 2017.

Haitao Liu. Dependency direction as a means of word-order typology: a method based on dependency treebanks. Lingua, 120(6):1567–1578, 2010.

Luka Marohnić. Graph theory package for Giac/Xcas - Reference manual. https://usermanual.wiki/Document/graphtheoryusermanual.346702481/view, 2018. Accessed: 2020-01-13.

Spider Graph – Wolfram Math World. https://mathworld.wolfram.com/SpiderGraph.html. Accessed: 2022-10-04.

Albert Nijenhuis and Herbert S. Wilf. Combinatorial Algorithms: For Computers and Hard Calculators. Academic Press, Inc., Orlando, FL, USA, 2nd edition, 1978.

Richard Otter. Annals of Mathematics The Number of Trees. 49(3):583–599, 1948.

H. Prüfer. Neuer Beweis eines Satzes über Permutationen. Arch. Math. Phys, 27:742–744, 1918.

Giorgio Satta, Emily Pitler, Sampath Kannan, and Mitchell Marcus. Finding Optimal 1-Endpoint-Crossing Trees. pages 13–24, 2013.

Yossi Shiloach. A minimum linear arrangement algorithm for undirected trees. Society for Industrial and Applied Mathematics, 8(1):15–32, 1979.

N. J. A. Sloane. The On-line Encyclopedia of Integer Sequences - A000055 - Number of trees with n unlabeled nodes. https://oeis.org/A000055. Accessed: 2019-12-28.

N. J. A. Sloane. The On-line Encyclopedia of Integer Sequences - A000081 - Number of unlabeled rooted trees with n nodes (or connected functions with a fixed point). https://oeis.org/A000081. Accessed: 2019-03-31.

Neil James Alexander Sloane. The On-Line Encyclopedia of Integer Sequences - A338706 - Number of 2-linear trees on n nodes. https://oeis.org/A338706, 1964-2022. Accessed: 2022-10-07.

Tanay Wakhare, Eric Wityk, and Charles R. Johnson. The proportion of trees that are linear. Discrete Mathematics, 343(10):112008, 2020.

Herbert S. Wilf. The uniform selection of free trees. Journal of Algorithms, 2:204–207, 1981.

Robert Alan Wright, Bruce Richmond, Andrew Odlyzko, and Brendan D. McKay. Constant Time Generation of Free Trees. SIAM Journal on Computing, 15:540–548, 05 1986.