| Total functions in the polynomial hierarchy R Kleinberg, O Korten, D Mitropolsky, C Papadimitriou 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021 | 22 | 2021 |
| The hardest explicit construction O Korten 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 13 | 2022 |
| Reconfiguration of connected graph partitions HA Akitaya, MD Jones, M Korman, O Korten, C Meierfrankenfeld, ... Journal of Graph Theory 102 (1), 35-66, 2023 | 11 | 2023 |
| Reconfiguration of connected graph partitions via recombination HA Akitaya, M Korman, O Korten, DL Souvaine, CD Tóth Theoretical Computer Science 923, 13-26, 2022 | 9 | 2022 |
| Characterizing universal reconfigurability of modular pivoting robots HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ... arXiv preprint arXiv:2012.07556, 2020 | 8 | 2020 |
| Edge matching with inequalities, triangles, unknown shape, and two players J Bosboom, C Chen, L Chung, S Compton, M Coulombe, ED Demaine, ... Journal of Information Processing 28, 987-1007, 2020 | 6 | 2020 |
| Derandomization from time-space tradeoffs O Korten 37th Computational Complexity Conference (CCC 2022), 2022 | 5 | 2022 |
| Circumscribing polygons and polygonizations for disjoint line segments HA Akitaya, M Korman, O Korten, M Rudoy, DL Souvaine, CD Tóth Discrete & Computational Geometry 68 (1), 218-254, 2022 | 4 | 2022 |
| Reconfiguration of Connected Graph Partitions via Recombination H A Akitaya, M Korman, O Korten, D L Souvaine, C D Tóth Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021 | 1 | 2021 |
| On the Complexity of 2-Player Packing Games O Korten arXiv preprint arXiv:1911.07793, 2019 | | 2019 |
