Oliver Korten

According to our database1, Oliver Korten authored at least 10 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Reconfiguration of connected graph partitions.
J. Graph Theory, 2023

2022
Reconfiguration of connected graph partitions via recombination.
Theor. Comput. Sci., 2022

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

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
Discret. Comput. Geom., 2022

Derandomization from Time-Space Tradeoffs.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
Total Functions in the Polynomial Hierarchy.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

The Hardest Explicit Construction.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
J. Inf. Process., 2020

2019
On the Complexity of 2-Player Packing Games.
CoRR, 2019


  Loading...