14 citations · 39 across the 17 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.CC2014★ 14 cited
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
Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing t…
math.LO2014★ 6 cited
Ranks on the Baire class functions
Márton Elekes, Viktor Kiss, Zoltán Vidnyánszky
In 1990 Kechris and Louveau developed the theory of three very natural ranks on the Baire class functions. A rank is a function assigning countable ordinals to certain objects,…
math.MG2014
Unions of regular polygons with large perimeter-to-area ratio
Viktor Kiss, Zoltán Vidnyánszky
T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is great…