default search action
Andrzej Dudek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j71]Andrzej Dudek
, Jaroslaw Grytczuk, Andrzej Rucinski:
Erdős-Szekeres type theorems for ordered uniform matchings. J. Comb. Theory B 170: 225-259 (2025) - 2024
- [j70]Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. Electron. J. Comb. 31(2) (2024) - [j69]Marek Walesiak
A dynamic approach to relative taxonomy and robust measures of central tendency. Commun. Stat. Simul. Comput. 53(6): 2645-2661 (2024) - [j68]Patrick Bennett, Ryan Cushman, Andrzej Dudek
A Note on Non-Isomorphic Edge-Color Classes in Random Graphs. Graphs Comb. 40(6): 126 (2024) - [j67]Patrick Bennett, Ryan Cushman, Andrzej Dudek
The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right. J. Comb. Theory B 169: 253-297 (2024) - [j66]Ewa Roszkowska, Bartlomiej Jefmanski
IFMCDM: An R package for intuitionistic fuzzy multi-criteria decision making methods. SoftwareX 26: 101721 (2024) - 2023
- [j65]Sylwia Antoniuk, Andrzej Dudek
Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection. J. Graph Theory 104(4): 811-835 (2023) - 2022
- [j64]Andrzej Dudek, Sean English
Localization game for random graphs. Discret. Appl. Math. 309: 202-214 (2022) - [j63]Patrick Bennett
A gentle introduction to the differential equation method and dynamic concentration. Discret. Math. 345(12): 113071 (2022) - [c6]Andrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski
Patterns in Ordered (random) Matchings. LATIN 2022: 544-556 - 2021
- [j62]Andrzej Dudek, Jaroslaw Grytczuk
Variations on Twins in Permutations. Electron. J. Comb. 28(3): 3 (2021) - [j61]Patrick Bennett
On the number of alternating paths in random graphs. Discret. Appl. Math. 304: 84-97 (2021) - [j60]Bartlomiej Bosek
Hat chromatic number of graphs. Discret. Math. 344(12): 112620 (2021) - [j59]József Balogh, Andrzej Dudek, Lina Li:
An analogue of the Erdős-Gallai theorem for random graphs. Eur. J. Comb. 91: 103200 (2021) - [j58]Sylwia Antoniuk, Andrzej Dudek
High powers of Hamiltonian cycles in randomly augmented graphs. J. Graph Theory 98(2): 255-284 (2021) - [j57]Patrick Bennett
Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process. SIAM J. Discret. Math. 35(3): 2145-2169 (2021) - 2020
- [j56]Patrick Bennett
Minimizing the number of 5-cycles in graphs with given edge-density. Comb. Probab. Comput. 29(1): 44-67 (2020) - [j55]Patrick Bennett
Large triangle packings and Tuza's conjecture in sparse random graphs. Comb. Probab. Comput. 29(5): 757-779 (2020) - [j54]Andrzej Dudek, Christian Reiher, Andrzej Rucinski
Powers of Hamiltonian cycles in randomly augmented graphs. Random Struct. Algorithms 56(1): 122-141 (2020)
2010 – 2019
- 2019
- [j53]Andrzej Dudek, Alan M. Frieze, Wesley Pegden
A note on the localization number of random graphs: Diameter two case. Discret. Appl. Math. 254: 107-112 (2019) - [j52]Andrzej Dudek, Andrzej Rucinski
Monochromatic loose paths in multicolored k-uniform cliques. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j51]Patrick Bennett
Large monochromatic components and long monochromatic cycles in random hypergraphs. Eur. J. Comb. 76: 123-137 (2019) - [j50]Andrzej Dudek, Sean English
A Random Variant of the Game of Plates and Olives. SIAM J. Discret. Math. 33(3): 1216-1227 (2019) - 2018
- [j49]Andrzej Dudek, Sean English
On Rainbow Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. 25(2): 2 (2018) - [j48]Andrzej Dudek, Pawel Pralat:
Note on the Multicolour Size-Ramsey Number for Paths, . Electron. J. Comb. 25(3): 3 (2018) - [j47]Andrzej Dudek, Laars Helenius:
On offset Hamilton cycles in random hypergraphs. Discret. Appl. Math. 238: 77-85 (2018) - [j46]Andrzej Dudek, Farideh Khoeini, Pawel Pralat:
Size-Ramsey numbers of cycles versus a path. Discret. Math. 341(7): 2095-2103 (2018) - [j45]Andrzej Dudek, Xavier Pérez-Giménez
Randomly twisted hypercubes. Eur. J. Comb. 70: 364-373 (2018) - [c5]Andrzej Dudek, Andrzej Rucinski
Constructive Ramsey Numbers for Loose Hyperpaths. LATIN 2018: 427-436 - 2017
- [j44]Patrick Bennett
On the Number of Alternating Paths in Bipartite Complete Graphs. Graphs Comb. 33(2): 307-320 (2017) - [j43]Patrick Bennett
On the Ramsey-Turán number with small s-independence number. J. Comb. Theory B 122: 690-718 (2017) - [j42]Andrzej Dudek, Alan M. Frieze
Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. J. Comb. Theory B 122: 719-740 (2017) - [j41]Andrzej Dudek, Steve La Fleur, Dhruv Mubayi, Vojtech Rödl:
On the Size-Ramsey Number of Hypergraphs. J. Graph Theory 86(1): 104-121 (2017) - [j40]Andrzej Dudek, Pawel Pralat:
On some Multicolor Ramsey Properties of Random Graphs. SIAM J. Discret. Math. 31(3): 2079-2092 (2017) - 2016
- [j39]Deepak Bal, Patrick Bennett
The Total Acquisition Number of Random Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j38]Patrick Bennett
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. Electron. J. Comb. 23(2): 2 (2016) - [j37]Andrzej Dudek, Dieter Mitsche, Pawel Pralat:
The set chromatic number of random graphs. Discret. Appl. Math. 215: 61-70 (2016) - [j36]Andrzej Dudek, Linda M. Lesniak:
The vertex size-Ramsey number. Discret. Math. 339(6): 1753-1762 (2016) - [j35]Andrzej Dudek, Pawel Pralat:
Acquaintance Time of Random Graphs Near Connectivity Threshold. SIAM J. Discret. Math. 30(1): 555-568 (2016) - 2015
- [j34]Andrzej Dudek, Alan M. Frieze
Loose Hamilton Cycles in Regular Hypergraphs. Comb. Probab. Comput. 24(1): 179-194 (2015) - [j33]Andrzej Dudek, Pawel Pralat:
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths. Comb. Probab. Comput. 24(3): 551-555 (2015) - [j32]Andrzej Dudek, Michael Ferrara:
Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs. Graphs Comb. 31(3): 577-583 (2015) - [j31]Andrzej Dudek, Alan M. Frieze
Rainbow Connection of Random Regular Graphs. SIAM J. Discret. Math. 29(4): 2255-2266 (2015) - 2014
- [j30]Andrzej Dudek:
A Note on a Ramsey-Type Problem for Sequences. Electron. J. Comb. 21(3): 3 (2014) - [j29]Andrzej Dudek:
On balanced colorings of sparse hypergraphs. Discret. Math. 323: 63-68 (2014) - [j28]Deepak Bal, Patrick Bennett
The t-Tone Chromatic Number of Random Graphs. Graphs Comb. 30(5): 1073-1086 (2014) - [j27]Andrzej Dudek, Troy Retter, Vojtech Rödl:
On generalized Ramsey numbers of Erdős and Rogers. J. Comb. Theory B 109: 213-227 (2014) - [j26]Andrzej Dudek, Dhruv Mubayi:
On Generalized Ramsey Numbers for 3-Uniform Hypergraphs. J. Graph Theory 76(3): 217-223 (2014) - [j25]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze
Maker-breaker games on random geometric graphs. Random Struct. Algorithms 45(4): 553-607 (2014) - [c4]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski
Approximate Counting of Matchings in (3, 3)-Hypergraphs. SWAT 2014: 380-391 - [i2]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3, 3)-Hypergraphs. CoRR abs/1402.6190 (2014) - [i1]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3,3)-Hypergraphs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j24]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
Some recent results on Ramsey-type numbers. Discret. Appl. Math. 161(9): 1197-1202 (2013) - [j23]Andrzej Dudek, Oleg Pikhurko, Andrew Thomason:
On Minimum Saturated Matrices. Graphs Comb. 29(5): 1269-1286 (2013) - [j22]Andrzej Dudek, Alan M. Frieze
Approximate counting of regular hypergraphs. Inf. Process. Lett. 113(19-21): 785-788 (2013) - [j21]Andrzej Dudek, Alan M. Frieze
Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42(3): 374-385 (2013) - 2012
- [j20]Andrzej Dudek, Alan M. Frieze, Andrzej Rucinski
Rainbow Hamilton Cycles in Uniform Hypergraphs. Electron. J. Comb. 19(1): 46 (2012) - [j19]Andrzej Dudek, Alan M. Frieze, Po-Shen Loh
Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. Electron. J. Comb. 19(4): 44 (2012) - [j18]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze
Cops and Robbers on Geometric Graphs. Comb. Probab. Comput. 21(6): 816-834 (2012) - [j17]Andrzej Dudek, John R. Schmitt:
On the size and structure of graphs with a constant number of 1-factors. Discret. Math. 312(10): 1807-1811 (2012) - [j16]Andrzej Dudek, Reshma Ramadurai
Some remarks on vertex Folkman numbers for hypergraphs. Discret. Math. 312(19): 2952-2957 (2012) - [j15]Andrzej Dudek, Reshma Ramadurai
On induced Folkman numbers. Random Struct. Algorithms 40(4): 493-500 (2012) - 2011
- [j14]Andrzej Dudek, Vojtech Rödl:
On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers. Comb. 31(1): 39-53 (2011) - [j13]Andrzej Dudek, Alan M. Frieze:
Loose Hamilton Cycles in Random Uniform Hypergraphs. Electron. J. Comb. 18(1) (2011) - [j12]Deepak Bal, Andrzej Dudek, Zelealem B. Yilma
On the maximum number of edges in a hypergraph with a unique perfect matching. Discret. Math. 311(21): 2577-2580 (2011) - [j11]Andrzej Dudek, David Wajc:
On the complexity of vertex-coloring edge-weightings. Discret. Math. Theor. Comput. Sci. 13(3): 45-50 (2011) - [j10]Andrzej Dudek, Reshma Ramadurai
Vertex colorings of graphs without short odd cycles. J. Graph Theory 68(3): 255-264 (2011) - 2010
- [j9]Andrzej Dudek:
On k-partite hypergraphs with the induced epsilon-density property. Discret. Math. 310(10-11): 1524-1530 (2010) - [j8]Andrzej Dudek, Joanna Polcyn
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence. J. Comb. Optim. 19(2): 184-199 (2010) - [j7]Andrzej Dudek, Vojtech Rödl:
An almost quadratic bound on vertex Folkman numbers. J. Comb. Theory B 100(2): 132-140 (2010) - [j6]Tom Bohman
Flips in Graphs. SIAM J. Discret. Math. 24(3): 1046-1055 (2010)
2000 – 2009
- 2009
- [j5]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
A Note on Universal and Canonically Coloured Sequences. Comb. Probab. Comput. 18(5): 683-689 (2009) - [j4]Andrzej Dudek, Esmeralda Nastase, Vojtech Rödl:
On k-chromatically connected graphs. Discret. Math. 309(18): 5547-5550 (2009) - 2008
- [j3]Andrzej Dudek, Vojtech Rödl:
On the Turán Properties of Infinite Graphs. Electron. J. Comb. 15(1) (2008) - [j2]Andrzej Dudek, Vojtech Rödl:
On the Folkman Number f(2, 3, 4). Exp. Math. 17(1): 63-67 (2008) - [j1]Andrzej Dudek, Vojtech Rödl:
Finding Folkman Numbers via MAX CUT Problem. Electron. Notes Discret. Math. 30: 99-104 (2008) - [c3]Andrzej Dudek, Vojtech Rödl:
New Upper Bound on Vertex Folkman Numbers. LATIN 2008: 473-478 - 2007
- [c2]Marek Walesiak
Identification of Noisy Variables for Nonmetric and Symbolic Data in Cluster Analysis. GfKl 2007: 85-92 - 2006
- [c1]Andrzej Dudek:
Cluster Quality Indexes for Symbolic Classification - An Examination. GfKl 2006: 31-38
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: