| Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph V Kiss, L Tóthmérész Discrete Applied Mathematics 193, 48-56, 2015 | 24 | 2015 |
| On the combinatorics of suffix arrays G Kucherov, L Tóthmérész, S Vialette Information Processing Letters 113 (22-24), 915-920, 2013 | 24 | 2013 |
| Hypergraph polynomials and the Bernardi process T Kálmán, L Tóthmérész Algebraic Combinatorics 3 (no. 5), pp. 1099-1139, 2020 | 12 | 2020 |
| On the complexity of the chip-firing reachability problem B Hujter, V Kiss, L Tóthmérész Proceedings of the American Mathematical Society 145 (8), 3343-3356, 2017 | 10 | 2017 |
| Effective divisor classes on metric graphs A Gross, F Shokrieh, L Tóthmérész Mathematische Zeitschrift 302 (2), 663-685, 2022 | 9 | 2022 |
| Ehrhart theory of symmetric edge polytopes via ribbon structures T Kálmán, L Tóthmérész arXiv preprint arXiv:2201.10501, 2022 | 8 | 2022 |
| Algorithmic aspects of rotor-routing and the notion of linear equivalence L Tóthmérész Discrete Applied Mathematics 236, 428-437, 2018 | 8 | 2018 |
| The sandpile group of a trinity and a canonical definition for the planar Bernardi action T Kálmán, S Lee, L Tóthmérész Combinatorica 42 (Suppl 2), 1283-1316, 2022 | 5* | 2022 |
| Root polytopes and Jaeger‐type dissections for directed graphs T Kálmán, L Tóthmérész Mathematika 68 (4), 1176-1220, 2022 | 5 | 2022 |
| Chip-firing based methods in the Riemann–Roch theory of directed graphs B Hujter, L Tóthmérész European Journal of Combinatorics 78, 90-104, 2019 | 5 | 2019 |
| On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs Z Király, L Tóthmérész Electronic Journal of Combinatorics 24 (4), #P4.40., 2017 | 4* | 2017 |
| A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids L Tóthmérész Journal of Combinatorial Theory, Series A 206, 105891, 2024 | 3 | 2024 |
| -vectors of graph polytopes using activities of dissecting spanning trees T Kálmán, L Tóthmérész Algebraic Combinatorics 6 (6), 1637-1651, 2023 | 3 | 2023 |
| Degrees of interior polynomials and parking function enumerators T Kálmán, L Tóthmérész arXiv preprint arXiv:2304.03221, 2023 | 2 | 2023 |
| Rotor-routing reachability is easy, chip-firing reachability is hard L Tóthmérész European Journal of Combinatorics 101, 103466, 2022 | 2 | 2022 |
| On approximating the rank of graph divisors K Bérczi, HP Hoang, L Tóthmérész Discrete Mathematics 346 (9), 113528, 2023 | 1 | 2023 |
| Extremal number of arborescences A Bandekar, P Csikvári, B Mascuch, D Tárkányi, M Telekes, L Tóthmérész arXiv preprint arXiv:2409.17893, 2024 | | 2024 |
| A Consistent Sandpile Torsor Algorithm for Regular Matroids C Ding, A McDonough, L Tóthmérész, CH Yuen arXiv preprint arXiv:2407.03999, 2024 | | 2024 |
| The two-variable hypergraph Tutte polynomial via embedding activities L Tóthmérész arXiv preprint arXiv:2310.20639, 2023 | | 2023 |
| Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology G Gombos, D Kis, L Tóthmérész, T Király, S Nádas, S Laki IEEE Access 10, 120312-120328, 2022 | | 2022 |
Stéphane VialetteLIGM, Univ Gustave Eiffel, CNRS, F-77454 Marne-la-Vallée, France在 univ-eiffel.fr 的电子邮件经过验证
