Graphs with no induced C4 and 2K2. - Zoltán Blázsik; Mihály Hujter; András Pluhár; Zsolt Tuza (Discret. Math., 1993)

A Note on Connection Between PNS and Set Covering Problems. - Zoltán Blázsik; Balázs Imreh (Acta Cybern., 1996)

On Decision-Mappings Related to Process Network Synthesis Problem. - Zoltán Blázsik; Cs. Holló; Balázs Imreh (Acta Cybern., 1998)

On Merging Reduction of the Process Network Synthesis Problem. - Cs. Holló; Zoltán Blázsik; Csanád Imreh; Zoltán Kovács (Acta Cybern., 1999)

Heuristic algorithms for a complex parallel machine scheduling problem. - Zoltán Blázsik; Csanád Imreh; Zoltán Kovács (Central Eur. J. Oper. Res., 2008)

Maximal Complexity of Finite Words - Mira-Cristiana Anisiu; Zoltán Blázsik; Zoltán Kása (CoRR, 2010)

Cospectral regular graphs with and without a perfect matching. - Zoltán Blázsik; Jay Cummings; Willem H. Haemers (Discret. Math., 2015)

Compositions of Complements of Graphs. - Péter Árendás; Ferenc Bencs; Zoltán Blázsik; Csaba Szabó (Integers, 2016)

A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem. - Zoltán Blázsik; Zoltán Imre Fajfrik (Central Eur. J. Oper. Res., 2017)

Partition dimension of projective planes. - Zoltán Blázsik; Zoltán Lóránt Nagy (Eur. J. Comb., 2017)

On the Complexity and Topology of Scoring Games: of Pirates and Treasure. - Péter Árendás; Zoltán L. Blázsik; Bertalan Bodor; Csaba Szabó (Integers, 2017)

Spreading linear triple systems and expander triple systems. - Zoltán L. Blázsik; Zoltán Lóránt Nagy (Eur. J. Comb., 2020)

Communicating Digital Evolutionary Machines. - Istvan Elek; Zoltán Blázsik; Tamás Héger; Dániel Lenger; Dániel Sindely (SAI (2), 2021)

On the balanced upper chromatic number of finite projective planes. - Zoltán L. Blázsik; Aart Blokhuis; Stefko Miklavic; Zoltán Lóránt Nagy; Tamás Szonyi (Discret. Math., 2021)

Upper bounds for the necklace folding problems. - Endre Csóka; Zoltán L. Blázsik; Zoltán Király; Dániel Lenger (J. Comb. Theory B, 2022)

Crumby colorings - Red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen. - János Barát; Zoltán L. Blázsik; Gábor Damásdi (Discret. Math., 2023)

General sharp upper bounds on the total coalition number. - János Barát; Zoltán Blázsik (Discuss. Math. Graph Theory, 2024)

Improved upper bound on the Frank number of 3-edge-connected graphs. - János Barát; Zoltán L. Blázsik (Eur. J. Comb., 2024)

Quest for graphs of Frank number 3. - János Barát; Zoltán L. Blázsik (Australas. J Comb., 2024)

General sharp upper bounds on the transversal coalition number. - Zoltán L. Blázsik (Discret. Appl. Math., 2026)

Characterization of graphs with orientable total domination number equal to |V|-1. - Zoltán L. Blázsik; Leila Vivien Nagy (Discret. Appl. Math., 2026)