Publications

1. Published in peer-reviewed journals

1. Regularizing and Normalizing DAGs and Phylogenetic Networks. Hellmuth M, Lindeberg A, Moulton V. Bulletin of Mathematical Biology. 2026. (to appear)
   arXiv:2605.21725

2. Inferring DAGs and Phylogenetic Networks from Least Common Ancestors. Lindeberg A, Alfonsson A, Moulton V, Scholz GE, Hellmuth M. Theoretical Computer Science. 2026; 1082.
   DOI:10.1016/j.tcs.2026.116114

3. Global Least Common Ancestor (LCA) Networks. Lindeberg A, Schmidt BJ, Changat M, Shanavas AV, Stadler PF, Hellmuth M. Annals of Combinatorics. 2026. (to appear)
   arXiv:2503.16186

4. Characterizing and transforming DAGs within the I-lca framework. Hellmuth M, Lindeberg A. Discrete Applied Mathematics. 2026; 378.
   DOI:10.1016/j.dam.2025.08.037

5. Orthology and Near-Cographs in the Context of Phylogenetic Networks. Lindeberg A, Scholz GE, Wieseke N, Hellmuth M. Algorithms for Molecular Biology. 2025; 20(1).
   DOI:10.1186/s13015-025-00285-7

6. Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective. Lindeberg A, Scholz GE, Hellmuth M. Vietnam Journal of Mathematics. 2025. Special Issue dedicated to the memory of Andreas Dress
   DOI:10.1007/s10013-025-00747-w

7. Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints. Lindeberg A, Hellmuth M. Bulletin of Mathematical Biology. 2025; 87(3).
   DOI:10.1007/s11538-025-01419-z

8. Construction of k-matchings in graph products. Lindeberg A, Hellmuth M. Art of Discrete Applied Mathematics. 2022; 6(2).
   DOI:10.26493/2590-9770.1462.b03

1. Submitted

1. NOC NOC, who’s there? Clustering systems of tree-child and normal networks. Lindeberg A, Hellmuth M. 2026.
   arXiv:2609.13336

2. Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors. Ebert PA, Lindeberg A, Hellmuth M. 2026.
   arXiv:2606.24415

3. Encoding Phylogenetic Networks with Least Common Ancestor Constraints. Hellmuth M, Lindeberg A, Moulton V. 2026.
   arXiv:2606.16963

1. Others

1. Guards in Galleries: From galleries to geometry and graph theory, then back again. Lindeberg A. 2024. Popular text aimed at non-mathematicians written as part of a course in mathematical communication

2. Isomorphism Testing of Rooted Trees in Linear Time. Lindeberg A. 2024. Article written as part of a course in mathematical communication
   arXiv:2401.07636

3. Fast recognition of H-free graphs. Lindeberg A. 2023. Longer survey-like article on linear-time recognition algorithms for graph classes defined by forbidden induced subgraphs, written as a examination of a half-term individual project.

4. The Structure of Primitive Edge-Colored Graphs: A Galled Tree Perspective. Lindeberg A. Master Thesis in Mathematics. Stockholm University. 2023. Grade: A (excellent)

5. Maximum Matchings in Graph Products. Lindeberg A. Bachelor Thesis in Computer Science. Stockholm University. 2021. Grade: A (excellent)