We propose to study important problems in several areas of theory of algorithms. In streaming algorithms we focus on quantile estimation and on streams of geometric data. In online algorithms we focus on edit distance, throughput scheduling and bin packing. For integer programming we focus on strengthening techniques for block-structured matrices such as proximity scaling. Finally, we propose to study the power of combinatorial algorithms for network flow problems.