Cluster Quality Indexes for Symbolic Classification - An Examination. - Andrzej Dudek (GfKl, 2006)

Identification of Noisy Variables for Nonmetric and Symbolic Data in Cluster Analysis. - Marek Walesiak; Andrzej Dudek (GfKl, 2007)

New Upper Bound on Vertex Folkman Numbers. - Andrzej Dudek; Vojtech Rödl (LATIN, 2008)

On the Turán Properties of Infinite Graphs. - Andrzej Dudek; Vojtech Rödl (Electron. J. Comb., 2008)

On the Folkman Number f(2, 3, 4). - Andrzej Dudek; Vojtech Rödl (Exp. Math., 2008)

Finding Folkman Numbers via MAX CUT Problem. - Andrzej Dudek; Vojtech Rödl (Electron. Notes Discret. Math., 2008)

A Note on Universal and Canonically Coloured Sequences. - Andrzej Dudek; Peter Frankl; Vojtech Rödl (Comb. Probab. Comput., 2009)

On k-chromatically connected graphs. - Andrzej Dudek; Esmeralda Nastase; Vojtech Rödl (Discret. Math., 2009)

On k-partite hypergraphs with the induced epsilon-density property. - Andrzej Dudek (Discret. Math., 2010)

Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence. - Andrzej Dudek; Joanna Polcyn; Andrzej Rucinski 001 (J. Comb. Optim., 2010)

An almost quadratic bound on vertex Folkman numbers. - Andrzej Dudek; Vojtech Rödl (J. Comb. Theory B, 2010)

Flips in Graphs. - Tom Bohman; Andrzej Dudek; Alan M. Frieze; Oleg Pikhurko (SIAM J. Discret. Math., 2010)

On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. - Andrzej Dudek; Vojtech Rödl (Comb., 2011)

Loose Hamilton Cycles in Random Uniform Hypergraphs. - Andrzej Dudek; Alan M. Frieze (Electron. J. Comb., 2011)

On the maximum number of edges in a hypergraph with a unique perfect matching. - Deepak Bal; Andrzej Dudek; Zelealem B. Yilma (Discret. Math., 2011)

On the complexity of vertex-coloring edge-weightings. - Andrzej Dudek; David Wajc (Discret. Math. Theor. Comput. Sci., 2011)

Vertex colorings of graphs without short odd cycles. - Andrzej Dudek; Reshma Ramadurai (J. Graph Theory, 2011)

Rainbow Hamilton Cycles in Uniform Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001 (Electron. J. Comb., 2012)

Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Po-Shen Loh; Shelley Speiss (Electron. J. Comb., 2012)

Cops and Robbers on Geometric Graphs. - Andrew Beveridge; Andrzej Dudek; Alan M. Frieze; Tobias Müller 001 (Comb. Probab. Comput., 2012)

Some remarks on vertex Folkman numbers for hypergraphs. - Andrzej Dudek; Reshma Ramadurai (Discret. Math., 2012)

On the size and structure of graphs with a constant number of 1-factors. - Andrzej Dudek; John R. Schmitt (Discret. Math., 2012)

On induced Folkman numbers. - Andrzej Dudek; Reshma Ramadurai; Vojtech Rödl (Random Struct. Algorithms, 2012)

Some recent results on Ramsey-type numbers. - Andrzej Dudek; Peter Frankl; Vojtech Rödl (Discret. Appl. Math., 2013)

On Minimum Saturated Matrices. - Andrzej Dudek; Oleg Pikhurko; Andrew Thomason 001 (Graphs Comb., 2013)

Approximate counting of regular hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Inf. Process. Lett., 2013)

Tight Hamilton cycles in random uniform hypergraphs. - Andrzej Dudek; Alan M. Frieze (Random Struct. Algorithms, 2013)

Approximate Counting of Matchings in (3, 3)-Hypergraphs. - Andrzej Dudek; Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (SWAT, 2014)

A Note on a Ramsey-Type Problem for Sequences. - Andrzej Dudek (Electron. J. Comb., 2014)

On balanced colorings of sparse hypergraphs. - Andrzej Dudek (Discret. Math., 2014)

Approximate Counting of Matchings in (3,3)-Hypergraphs. - Andrzej Dudek; Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (Electron. Colloquium Comput. Complex., 2014)

The t-Tone Chromatic Number of Random Graphs. - Deepak Bal; Patrick Bennett; Andrzej Dudek; Alan M. Frieze (Graphs Comb., 2014)

On generalized Ramsey numbers of Erdős and Rogers. - Andrzej Dudek; Troy Retter; Vojtech Rödl (J. Comb. Theory B, 2014)

On Generalized Ramsey Numbers for 3-Uniform Hypergraphs. - Andrzej Dudek; Dhruv Mubayi (J. Graph Theory, 2014)

Maker-breaker games on random geometric graphs. - Andrew Beveridge; Andrzej Dudek; Alan M. Frieze; Tobias Müller 001; Milos Stojakovic (Random Struct. Algorithms, 2014)

Loose Hamilton Cycles in Regular Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Comb. Probab. Comput., 2015)

An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths. - Andrzej Dudek; Pawel Pralat (Comb. Probab. Comput., 2015)

Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs. - Andrzej Dudek; Michael Ferrara (Graphs Comb., 2015)

Rainbow Connection of Random Regular Graphs. - Andrzej Dudek; Alan M. Frieze; Charalampos E. Tsourakakis (SIAM J. Discret. Math., 2015)

The Total Acquisition Number of Random Graphs. - Deepak Bal; Patrick Bennett; Andrzej Dudek; Pawel Pralat (Electron. J. Comb., 2016)

Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. - Patrick Bennett; Andrzej Dudek; Alan M. Frieze; Laars Helenius (Electron. J. Comb., 2016)

The set chromatic number of random graphs. - Andrzej Dudek; Dieter Mitsche; Pawel Pralat (Discret. Appl. Math., 2016)

The vertex size-Ramsey number. - Andrzej Dudek; Linda M. Lesniak (Discret. Math., 2016)

Acquaintance Time of Random Graphs Near Connectivity Threshold. - Andrzej Dudek; Pawel Pralat (SIAM J. Discret. Math., 2016)

On the Number of Alternating Paths in Bipartite Complete Graphs. - Patrick Bennett; Andrzej Dudek; Elliot Laforge (Graphs Comb., 2017)

On the Ramsey-Turán number with small s-independence number. - Patrick Bennett; Andrzej Dudek (J. Comb. Theory B, 2017)

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (J. Comb. Theory B, 2017)

On the Size-Ramsey Number of Hypergraphs. - Andrzej Dudek; Steve La Fleur; Dhruv Mubayi; Vojtech Rödl (J. Graph Theory, 2017)

On some Multicolor Ramsey Properties of Random Graphs. - Andrzej Dudek; Pawel Pralat (SIAM J. Discret. Math., 2017)

Constructive Ramsey Numbers for Loose Hyperpaths. - Andrzej Dudek; Andrzej Rucinski 001 (LATIN, 2018)

On Rainbow Hamilton Cycles in Random Hypergraphs. - Andrzej Dudek; Sean English; Alan M. Frieze (Electron. J. Comb., 2018)

Note on the Multicolour Size-Ramsey Number for Paths, . - Andrzej Dudek; Pawel Pralat (Electron. J. Comb., 2018)

On offset Hamilton cycles in random hypergraphs. - Andrzej Dudek; Laars Helenius (Discret. Appl. Math., 2018)

Size-Ramsey numbers of cycles versus a path. - Andrzej Dudek; Farideh Khoeini; Pawel Pralat (Discret. Math., 2018)

Randomly twisted hypercubes. - Andrzej Dudek; Xavier Pérez-Giménez; Pawel Pralat; Hao Qi 001; Douglas B. West; Xuding Zhu (Eur. J. Comb., 2018)

A note on the localization number of random graphs: Diameter two case. - Andrzej Dudek; Alan M. Frieze; Wesley Pegden (Discret. Appl. Math., 2019)

Monochromatic loose paths in multicolored k-uniform cliques. - Andrzej Dudek; Andrzej Rucinski 001 (Discret. Math. Theor. Comput. Sci., 2019)

Large monochromatic components and long monochromatic cycles in random hypergraphs. - Patrick Bennett; Louis DeBiasio; Andrzej Dudek; Sean English (Eur. J. Comb., 2019)

A Random Variant of the Game of Plates and Olives. - Andrzej Dudek; Sean English; Alan M. Frieze (SIAM J. Discret. Math., 2019)

Minimizing the number of 5-cycles in graphs with given edge-density. - Patrick Bennett; Andrzej Dudek; Bernard Lidický; Oleg Pikhurko (Comb. Probab. Comput., 2020)

Large triangle packings and Tuza's conjecture in sparse random graphs. - Patrick Bennett; Andrzej Dudek; Shira Zerbib (Comb. Probab. Comput., 2020)

Powers of Hamiltonian cycles in randomly augmented graphs. - Andrzej Dudek; Christian Reiher; Andrzej Rucinski 001; Mathias Schacht (Random Struct. Algorithms, 2020)

Variations on Twins in Permutations. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Electron. J. Comb., 2021)

On the number of alternating paths in random graphs. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (Discret. Appl. Math., 2021)

Hat chromatic number of graphs. - Bartlomiej Bosek; Andrzej Dudek; Michal Farnik; Jaroslaw Grytczuk; Przemyslaw Mazur (Discret. Math., 2021)

An analogue of the Erdős-Gallai theorem for random graphs. - József Balogh; Andrzej Dudek; Lina Li (Eur. J. Comb., 2021)

High powers of Hamiltonian cycles in randomly augmented graphs. - Sylwia Antoniuk; Andrzej Dudek; Christian Reiher; Andrzej Rucinski 001; Mathias Schacht (J. Graph Theory, 2021)

Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (SIAM J. Discret. Math., 2021)

Patterns in Ordered (random) Matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (LATIN, 2022)

Localization game for random graphs. - Andrzej Dudek; Sean English; Alan M. Frieze; Calum MacRury; Pawel Pralat (Discret. Appl. Math., 2022)

A gentle introduction to the differential equation method and dynamic concentration. - Patrick Bennett; Andrzej Dudek (Discret. Math., 2022)

Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection. - Sylwia Antoniuk; Andrzej Dudek; Andrzej Rucinski 001 (J. Graph Theory, 2023)

Outliers in intermittent demand forecasting. - Mariusz Doszyn; Andrzej Dudek (KES, 2024)

Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Electron. J. Comb., 2024)

The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right. - Patrick Bennett; Ryan Cushman; Andrzej Dudek; Pawel Pralat (J. Comb. Theory B, 2024)

IFMCDM: An R package for intuitionistic fuzzy multi-criteria decision making methods. - Ewa Roszkowska; Bartlomiej Jefmanski; Andrzej Dudek; Marta Kusterka-Jefmanska (SoftwareX, 2024)

A dynamic approach to relative taxonomy and robust measures of central tendency. - Marek Walesiak; Grazyna Dehnel; Andrzej Dudek (Commun. Stat. Simul. Comput., 2024)

A Note on Non-Isomorphic Edge-Color Classes in Random Graphs. - Patrick Bennett; Ryan Cushman; Andrzej Dudek; Elizabeth Sprangel (Graphs Comb., 2024)

Generalized Ramsey Numbers at the Linear and Quadratic Thresholds. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (Electron. J. Comb., 2025)

A Random Coloring Process Gives Improved Bounds for the Erdős-Gyárfás Problem on Generalized Ramsey Numbers. - Patrick Bennett; Andrzej Dudek; Sean English (Electron. J. Comb., 2025)

Twins in ordered hyper-matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Discuss. Math. Graph Theory, 2025)

Erdős-Szekeres type theorems for ordered uniform matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (J. Comb. Theory B, 2025)

Proposal of a new metaheuristic for the picker's route designation in warehouse management. - Krzysztof Dmytrów; Andrzej Dudek (Oper. Res. Decis., 2025)