On the combinatorics of suffix arrays. - Gregory Kucherov; Lilla Tóthmérész; Stéphane Vialette (Inf. Process. Lett., 2013)

Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph. - Viktor Kiss; Lilla Tóthmérész (CoRR, 2014)

Rotor-routing orbits in directed graphs and the Picard group. - Lilla Tóthmérész (CoRR, 2015)

Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph. - Viktor Kiss; Lilla Tóthmérész (Discret. Appl. Math., 2015)

On Ryser's Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs. - Zoltán Király; Lilla Tóthmérész (Electron. J. Comb., 2017)

Algorithmic aspects of rotor-routing and the notion of linear equivalence. - Lilla Tóthmérész (Discret. Appl. Math., 2018)

Chip-firing based methods in the Riemann-Roch theory of directed graphs. - Bálint Hujter; Lilla Tóthmérész (Eur. J. Comb., 2019)

Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology. - Gergo Gombos; Dávid Kis; Lilla Tóthmérész; Tamás Király; Szilveszter Nádas; Sándor Laki (IEEE Access, 2022)

Rotor-routing reachability is easy, chip-firing reachability is hard. - Lilla Tóthmérész (Eur. J. Comb., 2022)

The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action. - Támás Kalmán; Seunghun Lee; Lilla Tóthmérész (Comb., 2022)

On approximating the rank of graph divisors. - Kristóf Bérczi; Hung P. Hoang 001; Lilla Tóthmérész (Discret. Math., 2023)

A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids. - Lilla Tóthmérész (J. Comb. Theory, Ser. A, 2024)

Degrees of Interior Polynomials and Parking Function Enumerators. - Támás Kalmán; Lilla Tóthmérész (SIAM J. Discret. Math., 2025)

The devil's staircase for chip-firing on random graphs and on graphons. - Viktor Kiss; Lionel Levine; Lilla Tóthmérész (Random Struct. Algorithms, 2025)