Get started
Author

Lilla Tóthmérész

Observed names: Lilla Tothmeresz, Tóthmérész, Lilla
Observed institutions: Eötvös Loránd University, Centre National de la Recherche Scientifique, Paris-Est Sup, ORCID, Laboratoire d'Informatique Gaspard-Monge, Hungarian Research Network, Pôle de recherche et d'enseignement supérieur Université Paris-Est
ORCID: 0000-0002-8879-5770
Observed ORCID: 0000-0002-8879-5770
OpenAlex ID: A5060945252
On the combinatorics of suffix arrays
2013 · Gregory Kucherov, Lilla Tóthmérész, et al. · Information Processing Letters · 16
PDF
Chip-firing games on Eulerian digraphs and NP -hardness of computing the rank of a divisor on a graph
2015 · Viktor Kiss, Lilla Tóthmérész · Discrete Applied Mathematics · 15
PDF
On the complexity of the chip-firing reachability problem
2016 · Bálint Hujter, Viktor Kiss, et al. · Proceedings of the American Mathematical Society · 7
PDF
Ehrhart theory of symmetric edge polytopes via ribbon structures
2022 · Kálmán, Tamás, Tóthmérész, Lilla · arXiv (Cornell University) · 6
PDF
Effective divisor classes on metric graphs
2022 · Andreas Gross, Farbod Shokrieh, et al. · Mathematische Zeitschrift · 5
PDF
Hypergraph polynomials and the Bernardi process
2020 · Tamás Kálmán, Lilla Tóthmérész · Algebraic Combinatorics · 5
PDF
Algorithmic aspects of rotor-routing and the notion of linear equivalence
2017 · Lilla Tóthmérész · Discrete Applied Mathematics · 5
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action
2022 · Tamás Kálmán, Seunghun Lee, et al. · COMBINATORICA · 4
PDF
Root polytopes and Jaeger‐type dissections for directed graphs
2022 · Tamás Kálmán, Lilla Tóthmérész · Mathematika · 4
PDF
On Ryser’s Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs
2017 · Zoltán Király, Lilla Tóthmérész · The Electronic Journal of Combinatorics · 4
Degrees of Interior Polynomials and Parking Function Enumerators
2025 · Tamás Kálmán, Lilla Tóthmérész · SIAM Journal on Discrete Mathematics · 3
PDF
h * -vectors of graph polytopes using activities of dissecting spanning trees
2024 · Tamás Kálmán, Lilla Tóthmérész · Algebraic Combinatorics · 3
PDF
A consistent sandpile torsor algorithm for regular matroids
2025 · Changxin Ding, Alex McDonough, et al. · European Journal of Combinatorics · 2
A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
2024 · Lilla Tóthmérész · Journal of Combinatorial Theory Series A · 2
Chip-firing based methods in the Riemann–Roch theory of directed graphs
2019 · Bálint Hujter, Lilla Tóthmérész · European Journal of Combinatorics · 2
Characterizing the Functional Similarity of Enzymes with High Co-Citation in Interaction Networks
2013 · Lilla Tothmeresz, Vince Grolmusz · Protein and Peptide Letters · 2
Rotor-routing reachability is easy, chip-firing reachability is hard
2021 · Lilla Tóthmérész · European Journal of Combinatorics · 1
The chip-firing game
2017 · Tóthmérész, Lilla · Eötvös Loránd Tudományegyetem · 1
PDF
Rotor-routing orbits in directed graphs and the Picard group
2015 · Tóthmérész, Lilla · arXiv (Cornell University) · 1
PDF
The Two-Variable Hypergraph Tutte Polynomial via Embedding Activities and Computation-Tree Activities
2026 · Lilla Tóthmérész · The Electronic Journal of Combinatorics
PDF
On canonical sandpile actions of embedded graphs
2026 · Lilla Tóthmérész · Advances in Combinatorics
Graph minors, Ehrhart theory, and a monotonicity property
2024 · Kálmán, Tamás, Tóthmérész, Lilla · arXiv (Cornell University)
PDF
The devil's staircase for chip‐firing on random graphs and on graphons
2024 · Viktor Kiss, Lionel Levine, et al. · Random Structures and Algorithms
The two-variable hypergraph Tutte polynomial via embedding activities
2023 · Tóthmérész, Lilla · arXiv (Cornell University)
PDF
On approximating the rank of graph divisors
2023 · Kristóf Bérczi, Hung P. Hoang, et al. · Discrete Mathematics
Works count: 28
Citation count: 88
H-index: 5
I10-index: 2
Year
Topic
Type