Lilla Tóthmérész

18 papers Journal 18
YearRankTypeTitle / Venue / Authors
2025 J jnl
Degrees of Interior Polynomials and Parking Function Enumerators.
SIAM J. Discret. Math.
Támás Kalmán, Lilla Tóthmérész
2025 J jnl
Extremal Number of Arborescences.
Electron. J. Comb.
Aditya Bandekar, Péter Csikvári, Benjamin Mascuch, Damján Tárkányi, Márton Telekes, Lilla Tóthmérész
2025 J jnl
The devil's staircase for chip-firing on random graphs and on graphons.
Random Struct. Algorithms
Viktor Kiss, Lionel Levine, Lilla Tóthmérész
2024 J jnl
A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids.
J. Comb. Theory, Ser. A
Lilla Tóthmérész
2023 J jnl
On approximating the rank of graph divisors.
Discret. Math.
Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
2022 J jnl
Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology.
IEEE Access
Gergo Gombos, Dávid Kis, Lilla Tóthmérész, Tamás Király, Szilveszter Nádas, Sándor Laki
2022 J jnl
On approximating the rank of graph divisors.
CoRR
Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
2022 J jnl
Rotor-routing reachability is easy, chip-firing reachability is hard.
Eur. J. Comb.
Lilla Tóthmérész
2022 J jnl
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action.
Comb.
Támás Kalmán, Seunghun Lee, Lilla Tóthmérész
2019 J jnl
Chip-firing based methods in the Riemann-Roch theory of directed graphs.
Eur. J. Comb.
Bálint Hujter, Lilla Tóthmérész
2018 J jnl
Algorithmic aspects of rotor-routing and the notion of linear equivalence.
Discret. Appl. Math.
Lilla Tóthmérész
2017 J jnl
On Ryser's Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs.
Electron. J. Comb.
Zoltán Király, Lilla Tóthmérész
2015 J jnl
Algorithmic aspects of rotor-routing and the notion of linear equivalence.
CoRR
Lilla Tóthmérész
2015 J jnl
Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph.
Discret. Appl. Math.
Viktor Kiss, Lilla Tóthmérész
2015 J jnl
Rotor-routing orbits in directed graphs and the Picard group.
CoRR
Lilla Tóthmérész
2014 J jnl
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph.
CoRR
Viktor Kiss, Lilla Tóthmérész
2013 J jnl
On the combinatorics of suffix arrays.
Inf. Process. Lett.
Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette
2012 J jnl
On the combinatorics of suffix arrays
CoRR
Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette