## Publications

Austin Antoniou, Sarah Nakato, and Roswitha Rissner,

*Irreducible polynomials in \operatornameInt(\mathbbZ)*, in*ITM Web Conf. Volume 20, 2018 International Conference on Mathematics (ICM 2018) Recent Advances in Algebra, Numerical Analysis, Applied Analysis and Statistics*, 2018.Andrei Asinowski, Axel Bacher, Cyril Banderier, and Bernhard Gittenberger,

*Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata*,*Algorithmica*, vol.**82**, no. 3, pp. 386–428, 2020.Andrei Asinowski and Cyril Banderier,

*On Lattice Paths with Marked Patterns: Generating Functions and Multivariate Gaussian Distribution*, in*31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)*, Dagstuhl, Germany, 2020, vol.**159**, pp. 1:1–1:16.Andrei Asinowski, Cyril Banderier, and Valerie Roitner,

*Generating functions for lattice paths with several forbidden patterns*,*Sém. Lothar. Combin.*, vol.**84B**, 2020.Andrei Asinowski, Cyril Banderier, and Benjamin Hackl,

*On Extremal Cases of Pop-Stack Sorting*, in*Proceedings of Permutation Patterns 2019 (Zurich, Switzerland)*, 2019, pp. 33–37.Andrei Asinowski, Gill Barequet, Gil Ben-Shachar, Martha Carolina Osegueda, and Günter Rote,

*On the number of compositions of two polycubes*.Andrei Asinowski, Cyril Banderier, and Benjamin Hackl,

*Flip-sort and combinatorial aspects of pop-stack sorting*,*Discrete Math. Theor. Comput. Sci.*, vol.**22**, no. 2, 2021.Andrei Asinowski, Cyril Banderier, Sara Billey, Benjamin Hackl, and Svante Linusson,

*Pop-stack sorting and its image: permutations with overlapping runs*,*Acta Math. Univ. Comenian. (N.S.)*, vol.**88**, no. 3, pp. 395–402, 2019. MR4012843.Andrei Asinowski, Benjamin Hackl, and Sarah J. Selkirk,

*Down-step statistics in generalized Dyck paths*. arXiv:2007.15562 [math.CO], 2020.Ayman Badawi and Roswitha Rissner,

*Ramsey numbers of partial order graphs and implications in ring theory*,*Open Mathematics*, vol.**18**, pp. 1645–1657, 2020.Christian Elsholtz, Clemens Heuberger, and Daniel Krenn,

*Algorithmic counting of nonequivalent compact Huffman codes*. arXiv:1901.11343 [math.CO], 2019.Sophie Frisch, Sarah Nakato, and Roswitha Rissner,

*Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields*,*J. Algebra*, vol.**528**, pp. 231–249, 2019. MR3933257.Sophie Frisch, Sarah Nakato, and Roswitha Rissner,

*Split absolutely irreducible integer-valued polynomials over discrete valuation domains*. arXiv:2107.14276 [math.AC], 2021.Elisabeth Gaar and Daniel Krenn,

*Metamour-regular Polyamorous Relationships and Graphs*. arXiv:2005.14121 [math.CO], 2020.Elisabeth Gaar, Daniel Krenn, Susan Margulies, and Angelika Wiegele,

*Towards a Computational Proof of Vizing’s Conjecture using Semidefinite Programming and Sums-of-Squares*,*J. Symbolic Comput.*, vol.**107**, pp. 67–105, 2021.Benjamin Hackl and Helmut Prodinger,

*The Necklace Process: A Generating Function Approach*,*Statist. Probab. Lett.*, vol.**142**, pp. 57–61, 2018.Benjamin Hackl and Helmut Prodinger,

*A hypergeometric proof for a binomial identity related to 1/\pi*. arXiv:1907.08680 [math.NT], 2019.Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger,

*Counting Ascents in Generalized Dyck Paths*, in*29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)*, 2018, vol.**110**, pp. 26:1–26:15. MR3826145.Benjamin Hackl, Clemens Heuberger, and Stephan Wagner,

*Reducing Simply Generated Trees by Iterative Leaf Cutting*, in*Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)*, Philadelphia PA, 2019, pp. 36–44. MR3909439.Benjamin Hackl,

*A Combinatorial Identity for Rooted Labelled Forests*,*Aequationes Math.*, vol.**94**, pp. 253–257, 2020.Clemens Heuberger, Daniel Krenn, and Gabriel F. Lipnik,

*Asymptotic Analysis of q-Recursive Sequences*. arXiv:2105.04334 [math.CO], 2021.Clemens Heuberger, Daniel Krenn, and Helmut Prodinger,

*Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal’s Rhombus*, in*Proceedings of the 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms*, 2018, vol.**110**, pp. 27:1–27:18. MR3826146.Clemens Heuberger and Daniel Krenn,

*Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences*, in*2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)*, 2019, pp. 27–35. MR3909438.Clemens Heuberger and Daniel Krenn,

*Asymptotic Analysis of Regular Sequences*,*Algorithmica*, vol.**82**, no. 3, pp. 429–508, 2020. MR4058416.Clemens Heuberger and Dunja Pucher,

*An Algorithm for Optimal Joint Expansion with Odd Digits*, in*Book of Abstracts. 20th Central European Conference on Cryptology*, A. Dujella, Ed. 2020.Daniel Krenn and Jeffrey Shallit,

*Decidability and k-regular sequences*. arXiv:2005.09507 [cs.FL], 2021.Daniel Krenn, Vorapong Suppakitpaisarn, and Stephan Wagner,

*On the minimal Hamming weight of a multi-base representation*,*J. Number Theory*, vol.**208**, pp. 168–179, 2020.Daniel Krenn,

*k-Regular sequences in SageMath: Meta ticket*. https://trac.sagemath.org/ticket/21202, 2016.Roswitha Rissner and Daniel Windisch,

*Absolute irreducibility of the binomial polynomials*,*J. Algebra*, vol.**578**, pp. 92–114, 2021. MR4234798.