Homepage of Lilla Tóthmérész



I am a member of the MTA-ELTE Egerváry Research Group (EGRES).

Office: D3-519

 Research interest:

chip-firing, graph theory, algebraic combinatorics, algorithms, complexity


 Papers and preprints

Tamás Kálmán, Seunghun Lee, Lilla Tóthmérész, The sandpile group of a trinity and a canonical definition for the planar Bernardi action, submitted (arXiv) slides

Tamás Kálmán, Lilla Tóthmérész, Hypergraph polynomials and the Bernardi process, submitted (arXiv)

Andreas Gross, Farbod Shokrieh, Lilla Tóthmérész, Effective divisor classes on metric graphs, submitted (arXiv)

Bálint Hujter, Lilla Tóthmérész, Chip-firing based methods in the Riemann-Roch theory of directed graphs, European Journal of Combinatorics 78: pp. 90-104. (2019) (arXiv)

Lilla Tóthmérész, Algorithmic aspects of rotor-routing and the notion of linear equivalence, Discrete Applied Mathematics 236: pp. 428-437. (2018) (arXiv)

Zoltán Király, Lilla Tóthmérész, On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs, Electronic Journal of Combinatorics 24:(4) Paper #P4.40. (2017) (arXiv)

Bálint Hujter, Viktor Kiss, Lilla Tóthmérész, On the complexity of the chip-firing reachability problem,  Proc. Amer. Math. Soc. 145 (2017), 3343-3356 (arXiv)

Viktor Kiss, Lilla Tóthmérész, Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph, Discrete Applied Mathematics 193 (2015) 48-56 (arXiv)

Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette, On the combinatorics of suffix arrays, Information Processing Letters 113 (2013) 915-920 (arXiv)

My thesis