Hamiltonian Alternating Paths on Bicolored Double-Chains. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (GD, 2008)

Solution of Peter Winkler's Pizza Problem. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (IWOCA, 2009)

On Three Parameters of Invisibility Graphs. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (COCOON, 2010)

Separated Matchings and Small Discrepancy Colorings. - Viola Mészáros (EGC, 2011)

Universal Sets for Straight-Line Embeddings of Bicolored Graphs - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (CoRR, 2011)

An upper bound on the size of separated matchings. - Viola Mészáros (Electron. Notes Discret. Math., 2011)

Graph sharing games: Complexity and connectivity. - Josef Cibulka; Jan Kyncl; Viola Mészáros; Rudolf Stolar; Pavel Valtr 001 (Theor. Comput. Sci., 2013)

Advantage in the discrete Voronoi game. - Dániel Gerbner; Viola Mészáros; Dömötör Pálvölgyi; Alexey Pokrovskiy; Günter Rote (J. Graph Algorithms Appl., 2014)

Proper colouring Painter-Builder game. - Malgorzata Bednarska-Bzdega; Michael Krivelevich; Viola Mészáros; Clément Requilé (Discret. Math., 2018)

Connected matchings. - Oswin Aichholzer; Sergio Cabello; Viola Mészáros; Patrick Schnider; Jan Soukup (Comput. Geom., 2025)