 | 2012 |
| 17 |  | Andrzej Dudek,
John R. Schmitt:
On the size and structure of graphs with a constant number of 1-factors.
Discrete Mathematics 312(10): 1807-1811 (2012) |
| 2011 |
| 16 |  | Andrzej Dudek,
Vojtech Rödl:
On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers.
Combinatorica 31(1): 39-53 (2011) |
| 15 |  | Deepak Bal,
Andrzej Dudek,
Zelealem Yilma:
On the maximum number of edges in a hypergraph with a unique perfect matching.
Discrete Mathematics 311(21): 2577-2580 (2011) |
| 14 |  | Andrzej Dudek,
David Wajc:
On the complexity of vertex-coloring edge-weightings.
Discrete Mathematics & Theoretical Computer Science 13(3): 45-50 (2011) |
| 13 |  | Andrzej Dudek,
Alan M. Frieze:
Loose Hamilton Cycles in Random Uniform Hypergraphs.
Electr. J. Comb. 18(1): (2011) |
| 12 |  | Andrzej Dudek,
Reshma Ramadurai:
Vertex colorings of graphs without short odd cycles.
Journal of Graph Theory 68(3): 255-264 (2011) |
| 2010 |
| 11 |  | Andrzej Dudek:
On k-partite hypergraphs with the induced epsilon-density property.
Discrete Mathematics 310(10-11): 1524-1530 (2010) |
| 10 |  | Andrzej Dudek,
Joanna Polcyn,
Andrzej Rucinski:
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence.
J. Comb. Optim. 19(2): 184-199 (2010) |
| 9 |  | Andrzej Dudek,
Vojtech Rödl:
An almost quadratic bound on vertex Folkman numbers.
J. Comb. Theory, Ser. B 100(2): 132-140 (2010) |
| 8 |  | Tom Bohman,
Andrzej Dudek,
Alan M. Frieze,
Oleg Pikhurko:
Flips in Graphs.
SIAM J. Discrete Math. 24(3): 1046-1055 (2010) |
| 2009 |
| 7 |  | Andrzej Dudek,
Peter Frankl,
Vojtech Rödl:
A Note on Universal and Canonically Coloured Sequences.
Combinatorics, Probability & Computing 18(5): 683-689 (2009) |
| 6 |  | Andrzej Dudek,
Esmeralda Nastase,
Vojtech Rödl:
On k-chromatically connected graphs.
Discrete Mathematics 309(18): 5547-5550 (2009) |
| 2008 |
| 5 |  | Andrzej Dudek,
Vojtech Rödl:
New Upper Bound on Vertex Folkman Numbers.
LATIN 2008: 473-478 |
| 4 |  | Andrzej Dudek,
Vojtech Rödl:
On the Turán Properties of Infinite Graphs.
Electr. J. Comb. 15(1): (2008) |
| 3 |  | Andrzej Dudek,
Vojtech Rödl:
Finding Folkman Numbers via MAX CUT Problem.
Electronic Notes in Discrete Mathematics 30: 99-104 (2008) |
| 2007 |
| 2 |  | Marek Walesiak,
Andrzej Dudek:
Identification of Noisy Variables for Nonmetric and Symbolic Data in Cluster Analysis.
GfKl 2007: 85-92 |
| 2006 |
| 1 |  | Andrzej Dudek:
Cluster Quality Indexes for Symbolic Classification - An Examination.
GfKl 2006: 31-38 |