On the Complexity of 2-Player Packing Games. - Oliver Korten (CoRR, 2019)

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. - Jeffrey Bosboom; Charlotte Chen; Lily Chung; Spencer Compton; Michael J. Coulombe; Erik D. Demaine; Martin L. Demaine; Ivan Tadeu Ferreira Antunes Filho; Dylan H. Hendrickson; Adam Hesterberg; Calvin Hsu; William Hu; et al. (J. Inf. Process., 2020)

Characterizing Universal Reconfigurability of Modular Pivoting Robots. - Hugo A. Akitaya; Erik D. Demaine; Andrei Gonczi; Dylan H. Hendrickson; Adam Hesterberg; Matias Korman; Oliver Korten; Jayson Lynch; Irene Parada; Vera Sacristán (SoCG, 2021)

The Hardest Explicit Construction. - Oliver Korten (FOCS, 2021)

Total Functions in the Polynomial Hierarchy. - Robert Kleinberg; Oliver Korten; Daniel Mitropolsky; Christos H. Papadimitriou (ITCS, 2021)

Derandomization from Time-Space Tradeoffs. - Oliver Korten (CCC, 2022)

Circumscribing Polygons and Polygonizations for Disjoint Line Segments. - Hugo A. Akitaya; Matias Korman; Oliver Korten; Mikhail Rudoy; Diane L. Souvaine; Csaba D. Tóth (Discret. Comput. Geom., 2022)

Efficient Low-Space Simulations From the Failure of the Weak Pigeonhole Principle. - Oliver Korten (Electron. Colloquium Comput. Complex., 2022)

Reconfiguration of connected graph partitions via recombination. - Hugo A. Akitaya; Matias Korman; Oliver Korten; Diane L. Souvaine; Csaba D. Tóth (Theor. Comput. Sci., 2022)

Reconfiguration of connected graph partitions. - Hugo A. Akitaya; Matthew D. Jones; Matias Korman; Oliver Korten; Christopher Meierfrankenfeld; Michael J. Munje; Diane L. Souvaine; Michael Thramann; Csaba D. Tóth (J. Graph Theory, 2023)

Strong vs. Weak Range Avoidance and the Linear Ordering Principle. - Oliver Korten; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2024)

Range Avoidance and the Complexity of Explicit Constructions. - Oliver Korten (Bull. EATCS, 2025)

Stronger Cell Probe Lower Bounds via Local PRGs. - Oliver Korten; Toniann Pitassi; Russell Impagliazzo (Electron. Colloquium Comput. Complex., 2025)

How to Construct Random Strings. - Oliver Korten; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2025)