Andrzej Dudek

According to our database1, Andrzej Dudek authored at least 72 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection.
J. Graph Theory, December, 2023

2022
A gentle introduction to the differential equation method and dynamic concentration.
Discret. Math., 2022

Localization game for random graphs.
Discret. Appl. Math., 2022

Patterns in Ordered (random) Matchings.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process.
SIAM J. Discret. Math., 2021

High powers of Hamiltonian cycles in randomly augmented graphs.
J. Graph Theory, 2021

An analogue of the Erdős-Gallai theorem for random graphs.
Eur. J. Comb., 2021

Hat chromatic number of graphs.
Discret. Math., 2021

On the number of alternating paths in random graphs.
Discret. Appl. Math., 2021

Variations on Twins in Permutations.
Electron. J. Comb., 2021

2020
Powers of Hamiltonian cycles in randomly augmented graphs.
Random Struct. Algorithms, 2020

Large triangle packings and Tuza's conjecture in sparse random graphs.
Comb. Probab. Comput., 2020

Minimizing the number of 5-cycles in graphs with given edge-density.
Comb. Probab. Comput., 2020

2019
A Random Variant of the Game of Plates and Olives.
SIAM J. Discret. Math., 2019

Large monochromatic components and long monochromatic cycles in random hypergraphs.
Eur. J. Comb., 2019

Monochromatic loose paths in multicolored k-uniform cliques.
Discret. Math. Theor. Comput. Sci., 2019

A note on the localization number of random graphs: Diameter two case.
Discret. Appl. Math., 2019

2018
Randomly twisted hypercubes.
Eur. J. Comb., 2018

Size-Ramsey numbers of cycles versus a path.
Discret. Math., 2018

On offset Hamilton cycles in random hypergraphs.
Discret. Appl. Math., 2018

Note on the Multicolour Size-Ramsey Number for Paths, .
Electron. J. Comb., 2018

On Rainbow Hamilton Cycles in Random Hypergraphs.
Electron. J. Comb., 2018

Constructive Ramsey Numbers for Loose Hyperpaths.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
On some Multicolor Ramsey Properties of Random Graphs.
SIAM J. Discret. Math., 2017

On the Size-Ramsey Number of Hypergraphs.
J. Graph Theory, 2017

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity.
J. Comb. Theory, Ser. B, 2017

On the Ramsey-Turán number with small s-independence number.
J. Comb. Theory, Ser. B, 2017

On the Number of Alternating Paths in Bipartite Complete Graphs.
Graphs Comb., 2017

2016
Acquaintance Time of Random Graphs Near Connectivity Threshold.
SIAM J. Discret. Math., 2016

The vertex size-Ramsey number.
Discret. Math., 2016

The set chromatic number of random graphs.
Discret. Appl. Math., 2016

Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs.
Electron. J. Comb., 2016

The Total Acquisition Number of Random Graphs.
Electron. J. Comb., 2016

2015
Rainbow Connection of Random Regular Graphs.
SIAM J. Discret. Math., 2015

Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs.
Graphs Comb., 2015

An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths.
Comb. Probab. Comput., 2015

Loose Hamilton Cycles in Regular Hypergraphs.
Comb. Probab. Comput., 2015

2014
Maker-breaker games on random geometric graphs.
Random Struct. Algorithms, 2014

On Generalized Ramsey Numbers for 3-Uniform Hypergraphs.
J. Graph Theory, 2014

On generalized Ramsey numbers of Erdős and Rogers.
J. Comb. Theory, Ser. B, 2014

The t-Tone Chromatic Number of Random Graphs.
Graphs Comb., 2014

Approximate Counting of Matchings in (3,3)-Hypergraphs.
Electron. Colloquium Comput. Complex., 2014

On balanced colorings of sparse hypergraphs.
Discret. Math., 2014

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

Approximate Counting of Matchings in (3, 3)-Hypergraphs.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013
Tight Hamilton cycles in random uniform hypergraphs.
Random Struct. Algorithms, 2013

Approximate counting of regular hypergraphs.
Inf. Process. Lett., 2013

On Minimum Saturated Matrices.
Graphs Comb., 2013

Some recent results on Ramsey-type numbers.
Discret. Appl. Math., 2013

2012
On induced Folkman numbers.
Random Struct. Algorithms, 2012

On the size and structure of graphs with a constant number of 1-factors.
Discret. Math., 2012

Some remarks on vertex Folkman numbers for hypergraphs.
Discret. Math., 2012

Cops and Robbers on Geometric Graphs.
Comb. Probab. Comput., 2012

Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs.
Electron. J. Comb., 2012

Rainbow Hamilton Cycles in Uniform Hypergraphs.
Electron. J. Comb., 2012

2011
Vertex colorings of graphs without short odd cycles.
J. Graph Theory, 2011

On the complexity of vertex-coloring edge-weightings.
Discret. Math. Theor. Comput. Sci., 2011

On the maximum number of edges in a hypergraph with a unique perfect matching.
Discret. Math., 2011

Loose Hamilton Cycles in Random Uniform Hypergraphs.
Electron. J. Comb., 2011

On <i>K</i><sub><i>s</i></sub>-free subgraphs in <i>K</i><sub><i>s</i>+<i>k</i></sub>-free graphs and vertex Folkman numbers.
Comb., 2011

2010
Flips in Graphs.
SIAM J. Discret. Math., 2010

An almost quadratic bound on vertex Folkman numbers.
J. Comb. Theory, Ser. B, 2010

Subhypergraph counts in extremal and random hypergraphs and the fractional <i>q</i>-independence.
J. Comb. Optim., 2010

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

2009
On k-chromatically connected graphs.
Discret. Math., 2009

A Note on Universal and Canonically Coloured Sequences.
Comb. Probab. Comput., 2009

2008
Finding Folkman Numbers via MAX CUT Problem.
Electron. Notes Discret. Math., 2008

On the Folkman Number <i>f</i>(2, 3, 4).
Exp. Math., 2008

On the Turán Properties of Infinite Graphs.
Electron. J. Comb., 2008

New Upper Bound on Vertex Folkman Numbers.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Identification of Noisy Variables for Nonmetric and Symbolic Data in Cluster Analysis.
Proceedings of the Data Analysis, Machine Learning and Applications, 2007

2006
Cluster Quality Indexes for Symbolic Classification - An Examination.
Proceedings of the Advances in Data Analysis, 2006


  Loading...