1: Algorithms for Secretary Problems on Graphs and Hypergraphs
2: Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections
3: Online Scheduling to Minimize the Maximum Delay Factor
4: Derandomizing the Lovasz Local Lemma more effectively