1: Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs
2: Online MAP Inference and Learning for Nonsymmetric Determinantal Point Processes
3: Fast algorithms for solving the Hamilton Cycle problem with high probability
4: A fast algorithm on average for solving the Hamilton Cycle problem
5: Online metric allocation
6: Servicing Timed Requests on a Line
7: cliquematch: Finding correspondence via cliques in large graphs