Lilla Tóthmérész
research assistant, member
Address: | Department of Operations Research |
| Eötvös Loránd University |
| 1117 Budapest |
| Pázmány Péter sétány, 1/C, 3-519 |
Tel: | |
Email: | |
Home page: | |
Publication list: | |
|
List of EGRES technical reports
- The two-variable hypergraph Tutte polynomial via embedding activities (Lilla Tóthmérész)
- On approximating the rank of graph divisors (Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész)
- Degrees of interior polynomials and parking function enumerators (Tamás Kálmán, Lilla Tóthmérész)
- $h^*$-vectors of graph polytopes using activities of dissecting spanning trees (Tamás Kálmán, Lilla Tóthmérész)
- Root polytopes and Jaeger-type dissections for directed graphs (Tamás Kálmán, Lilla Tóthmérész)
- A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids (Lilla Tóthmérész)
- Rotor-routing reachability is easy, chip-firing reachability is hard (Lilla Tóthmérész)
- The devil's staircase for chip-firing on random graphs and on graphons (Viktor Kiss, Lionel Levine, Lilla Tóthmérész)
- The sandpile group of a trinity and a canonical definition for the planar Bernardi action (Tamás Kálmán, Seunghun Lee, Lilla Tóthmérész)
- Hypergraph polynomials and the Bernardi process (Tamás Kálmán, Lilla Tóthmérész)
- Effective divisor classes on metric graphs (Andreas Gross, Farbod Shokrieh, Lilla Tóthmérész)
- On some special cases of Ryser's conjecture (Zoltán Király, Lilla Tóthmérész)
- Chip-firing based methods in the Riemann-Roch theory of directed graphs (Bálint Hujter, Lilla Tóthmérész)
- Algorithmic aspects of rotor-routing and the notion of linear equivalence (Lilla Tóthmérész)
- On the complexity of the chip-firing reachability problem (Bálint Hujter, 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 (Viktor Kiss, Lilla Tóthmérész)
List of EGRES quick proofs
Last modification: 21.3.2024. Please email your comments to Tamás Király!
|