Walsh transform as method of mimo systems identification. - Andrzej Zak (ICINCO, 2005)

Dissection of a Triangle into Similar Triangles. - Andrzej Zak (Discret. Comput. Geom., 2005)

Preface to proceedings. - Waclaw Frydrych; Andrzej Zak (Discuss. Math. Graph Theory, 2006)

Rainbow regular order of graphs. - Zdzislaw Skupien; Andrzej Zak (Australas. J Comb., 2008)

A note on perfect dissections of an equilateral triangle. - Andrzej Zak (Australas. J Comb., 2009)

A Note on Packing Graphs Without Cycles of Length up to Five. - Agnieszka Görlich; Andrzej Zak (Electron. J. Comb., 2009)

Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree. - Artur Fortuna; Zdzislaw Skupien; Andrzej Zak (Discret. Math., 2009)

Harmonious order of graphs. - Andrzej Zak (Discret. Math., 2009)

Hamilton-chain saturated hypergraphs. - Aneta Dudek; Andrzej Zak; Gyula Y. Katona (Discret. Math., 2010)

On vertex stability with regard to complete bipartite subgraphs. - Aneta Dudek; Andrzej Zak (Discuss. Math. Graph Theory, 2010)

Dissections of Polygons into Convex Polygons. - Andrzej Zak (Int. J. Comput. Geom. Appl., 2010)

On Packable Digraphs. - Agnieszka Görlich; Andrzej Zak (SIAM J. Discret. Math., 2010)

On (Cn;k) Stable Graphs. - Sylwia Cichacz; Agnieszka Görlich; Malgorzata Zwonek; Andrzej Zak (Electron. J. Comb., 2011)

A note on k-placeable graphs. - Andrzej Zak (Discret. Math., 2011)

A lower bound on the size of (H; 1)-vertex stable graphs. - Sylwia Cichacz; Agnieszka Görlich; Mateusz Nikodem; Andrzej Zak (Discret. Math., 2012)

Sparse graphs of girth at least five are packable. - Agnieszka Görlich; Andrzej Zak (Discret. Math., 2012)

On Hamilton-chain saturated uniform hypergraphs. - Andrzej Zak; Aneta Dudek (Discret. Math. Theor. Comput. Sci., 2012)

Hamilton Saturated Hypergraphs of Essentially Minimum Size. - Andrzej Rucinski 001; Andrzej Zak (Electron. J. Comb., 2013)

Near Packings of Graphs. - Andrzej Zak (Electron. J. Comb., 2013)

Growth order for the size of smallest hamiltonian chain saturated uniform hypergraphs. - Andrzej Zak (Eur. J. Comb., 2013)

On (Kq;k)-Stable Graphs. - Andrzej Zak (J. Graph Theory, 2013)

A generalization of an independent set with application to (Kp;k)-stable graphs. - Andrzej Zak (Discret. Appl. Math., 2014)

On embedding graphs with bounded sum of size and maximum degree. - Andrzej Zak (Discret. Math., 2014)

On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree. - Andrzej Zak (SIAM J. Discret. Math., 2014)

General lower bound on the size of (H;k)-stable graphs. - Andrzej Zak (J. Comb. Optim., 2015)

On Erdős-Sós Conjecture for Trees of Large Size. - Agnieszka Görlich; Andrzej Zak (Electron. J. Comb., 2016)

Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs. - Andrzej Rucinski 001; Andrzej Zak (Electron. J. Comb., 2016)

Near packings of two graphs. - Jerzy Konarski; Andrzej Zak (Discret. Math., 2017)

Packing large trees of consecutive orders. - Andrzej Zak (Discret. Math., 2017)

Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs. - Andrzej Zak (Discret. Appl. Math., 2019)

On the Minimum Size of Hamilton Saturated Hypergraphs. - Andrzej Rucinski 001; Andrzej Zak (Electron. J. Comb., 2020)

Reduction of the Multipath Propagation Effect in a Hydroacoustic Channel Using Filtration in Cepstrum. - Agnieszka Czapiewska; Andrzej Luksza; Ryszard Studanski; Andrzej Zak (Sensors, 2020)

Application of Diversity Combining with RLS Adaptive Filtering in Data Transmission in a Hydroacoustic Channel. - Agnieszka Czapiewska; Andrzej Luksza; Ryszard Studanski; Andrzej Zak (Sensors, 2020)

Largest Component and Node Fault Tolerance for Grids. - Jakub Przybylo; Andrzej Zak (Electron. J. Comb., 2021)

A Method for Underwater Wireless Data Transmission in a Hydroacoustic Channel under NLOS Conditions. - Jerzy Mizeraczyk; Ryszard Studanski; Andrzej Zak; Agnieszka Czapiewska (Sensors, 2021)

Real-time path planning for Autonomous Navigation Systems of Unmanned Surface Vehicles. - Agnieszka Lazarowska; Andrzej Zak (MMAR, 2022)

A note on packing of uniform hypergraphs. - Jerzy Konarski; Mariusz Wozniak; Andrzej Zak (Discuss. Math. Graph Theory, 2022)

Constructing sparsest ℓ-hamiltonian saturated k-uniform hypergraphs for a wide range of ℓ. - Andrzej Rucinski 001; Andrzej Zak (Eur. J. Comb., 2023)

A note on the integrity of grids. - Andrzej Zak (Discret. Appl. Math., 2023)

Comparison of Doppler Effect Estimation Methods for MFSK Transmission in Multipath Hydroacoustic Channel. - Agnieszka Czapiewska; Andrzej Luksza; Ryszard Studanski; Lukasz Wojewódka; Andrzej Zak (IEEE Access, 2024)

Evaluation of Selected Modulation Techniques in Underwater Multipath Channel. - Agnieszka Czapiewska; Andrzej Luksza; Ryszard Studanski; Lukasz Wojewódka; Andrzej Zak (IEEE Access, 2025)