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 (CoRR, 2014)

Chip-firing games on Eulerian digraphs and -hardness of computing the rank of a divisor on a graph. - Viktor Kiss; Lilla Tóthmérész (Discret. Appl. Math., 2015)

Unions of Regular Polygons with Large Perimeter-to-Area Ratio. - Viktor Kiss; Zoltán Vidnyánszky (Discret. Comput. Geom., 2015)

A Game Characterizing Baire class 1 Functions. - Viktor Kiss (J. Symb. Log., 2020)

The structure of random automorphisms of the random graph. - Udayan B. Darji; Márton Elekes 002; Kende Kalina; Viktor Kiss; Zoltán Vidnyánszky (Ann. Pure Appl. Log., 2022)

Games Characterizing Limsup Functions and Baire Class 1 Functions. - Márton Elekes 002; János Flesch; Viktor Kiss; Donát Nagy; Márk Poór; Arkadi Predtetchinski (J. Symb. Log., 2022)

The devil's staircase for chip-firing on random graphs and on graphons. - Viktor Kiss; Lionel Levine; Lilla Tóthmérész (Random Struct. Algorithms, 2025)