Anna Lindeberg

Mathematician and computer scientist

Publications

  1. Published in peer-reviewed journal

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

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

    3. Lindeberg A, Scholz GE, Wieseke N, Hellmuth M. Orthology and Near-Cographs in the Context of Phylogenetic Networks. Algorithms for Molecular Biology. 2025; (to appear, preprint: arXiv:2502.08746 )

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

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

  1. Submitted

    1. Lindeberg A, Schmidt BJ, Changat M, Shanavas AV, Stadler PF, Hellmuth M. Global Least Common Ancestor (LCA) Networks. 2025. arXiv:2503.16186

  1. Others

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

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

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

    4. Lindeberg A. Fast recognition of H-free graphs. 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.

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