糖心TV

We are pleased to report that members of the department's Theory and Foundations research theme have had 6 papers accepted to the SODA is the top international conference on algorithms research. The papers are:

• "A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy" by , , Oded Lachish;
• "On a combinatorial generation problem of Knuth" by Arturo Merino, Ond艡ej Mi膷ka,
• "Dynamic Set Cover: Improved Amortized and Worst-Case Update Times" by , Monika Henzinger, Danupon Nanongkai, Xiaowei Wu;
• "Online Edge Coloring Algorithms via the Nibble Method" by , Fabrizio Grandoni, David Wajc;
• "FPT Approximation for FPT Problems" by Daniel Lokshtanov, Pranabendu Misra, , Saket Saurabh, Meirav Zehavi.
• "Polyhedral value iteration for discounted games and energy games" -