Mikhail Rudoy

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
scientific article; zbMATH DE number 7559209 (Why is no real title available?)2022-07-18Paper
Circumscribing polygons and polygonizations for disjoint line segments
Discrete & Computational Geometry
2022-06-03Paper
Circumscribing polygons and polygonizations for disjoint line segments
Discrete & Computational Geometry
2022-06-03Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
Theoretical Computer Science
2020-09-03Paper
scientific article; zbMATH DE number 7238987 (Why is no real title available?)
(available as arXiv preprint)
2020-08-25Paper
Computational complexity of motion planning of a robot through simple gadgets
(available as arXiv preprint)
2020-08-11Paper
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
(available as arXiv preprint)
2020-08-11Paper
Computational complexity of generalized Push Fight
(available as arXiv preprint)
2020-08-11Paper
Solving the Rubik's Cube Optimally is NP-complete
(available as arXiv preprint)
2020-08-05Paper
Cookie clicker
Graphs and Combinatorics
2020-04-03Paper
Cookie clicker
Graphs and Combinatorics
2020-04-03Paper
A simple proof that the \((n^{2} - 1)\)-puzzle is hard
Theoretical Computer Science
2018-06-07Paper
Dissection with the fewest pieces is hard, even to approximate
Lecture Notes in Computer Science
2017-02-01Paper


Research outcomes over time


This page was built for person: Mikhail Rudoy