42 citations · 132 across the 20 of their papers we have counts for
12 papers · 1 filter
Solving Static Permutation Mastermind using Queries
Maxime Larcher, Anders Martinsson, Angelika Steger
Permutation Mastermind is a version of the classical mastermind game in which the number of positions is equal to the number of colors , and repetition of colors is not allo…
Triangle resilience of the square of a Hamilton cycle in random graphs
Manuela Fischer, Nemanja Škorić, Angelika Steger +1
Since first introduced by Sudakov and Vu in 2008, the study of resilience problems in random graphs received a lot of attention in probabilistic combinatorics. Of particular intere…
Resilience of Perfect Matchings and Hamiltonicity in Random Graph Processes
Rajko Nenadov, Angelika Steger, Miloš Trujić
Let be the random graph process: starting with an empty graph with vertices, in every step the graph is formed by taking an edge chosen uniform…
Local resilience of an almost spanning -cycle in random graphs
Nemanja Škorić, Angelika Steger, Miloš Trujić
The famous Pósa-Seymour conjecture, confirmed in 1998 by Komlós, Sárközy, and Szemerédi, states that for any , every graph on vertices with minimum degree $kn/(k + 1)…
Symmetric and asymmetric Ramsey properties in random hypergraphs
Luca Gugelmann, Rajko Nenadov, Yury Person +3
A celebrated result of Rödl and Ruciński states that for every graph , which is not a forest of stars and paths of length , and fixed number of colours there exist p…
Drift Analysis and Evolutionary Algorithms Revisited
Johannes Lengler, Angelika Steger
One of the easiest randomized greedy optimization algorithms is the following evolutionary algorithm which aims at maximizing a boolean function . The…