Perfect independent sets with respect to infinitely many relations. - Martin Dolezal; Wieslaw Kubis (Arch. Math. Log., 2016)

First steps in combinatorial optimization on graphons: Matchings. - Martin Dolezal; Jan Hladký; Ping Hu; Diana Piguet (Electron. Notes Discret. Math., 2017)

Cliques in dense inhomogeneous random graphs. - Martin Dolezal; Jan Hladký; András Máthé (Random Struct. Algorithms, 2017)

Matching Polytons. - Martin Dolezal; Jan Hladký (Electron. J. Comb., 2019)

Cut-norm and entropy minimization over weak⁎ limits. - Martin Dolezal; Jan Hladký (J. Comb. Theory B, 2019)

An Evidence-Driven Model of Voting and Party Competition. - Ruth Meyer; Marco Fölsch; Martin Dolezal; Reinhard Heinisch (ESSA, 2021)

A Turán-Type Theorem for Large-Distance Graphs in Euclidean Spaces, and Related Isodiametric Problems. - Martin Dolezal; Jan Hladký; Jan Kolár; Themis Mitsis; Christos Pelekis; Václav Vlasák (Discret. Comput. Geom., 2021)

Relating the cut distance and the weak* topology for graphons. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory B, 2021)

Cut distance identifying graphon parameters over weak* limits. - Martin Dolezal; Jan Grebík; Jan Hladký; Israel Rocha; Václav Rozhon (J. Comb. Theory A, 2022)

Graph limits: An alternative approach to s-graphons. - Martin Dolezal (J. Graph Theory, 2022)

Politics in Games - An Overview and Classification. - Lisa Gutwenger; Stephan Keller; Martin Dolezal; Bernhard Schnögl; Sebastian Rous; Klaus Poier; Johanna Pirker (GEM, 2024)