Mikhail Rudoy

28 papers A* 1A 2Misc 3Journal 17Unranked 5
YearRankTypeTitle / Venue / Authors
2022 J jnl
Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
Discret. Comput. Geom.
Hugo A. Akitaya, Matias Korman, Oliver Korten, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth
2022 A conf
Hardness of Token Swapping on Trees.
ESA
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2021 J jnl
Hardness of Token Swapping on Trees.
CoRR
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2021 — conf
Yin-Yang Puzzles are NP-complete.
CCCG
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2021 J jnl
Yin-Yang Puzzles are NP-complete.
CoRR
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
2020 J jnl
Cookie Clicker.
Graphs Comb.
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2020 — conf
New Results in Sona Drawing: Hardness and TSP Separation.
CCCG
Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
2020 J jnl
New Results in Sona Drawing: Hardness and TSP Separation.
CoRR
Man-Kwun Chiu, Erik D. Demaine, Jenny Diomidova, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, Mikhail Rudoy
2020 J jnl
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
Theor. Comput. Sci.
Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen
2019 A* conf
Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
SoCG
Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth
2019 J jnl
Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
CoRR
Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth
2018 J jnl
A simple proof that the (
Theor. Comput. Sci.
Erik D. Demaine, Mikhail Rudoy
2018 Misc conf
Computational Complexity of Generalized Push Fight.
FUN
Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy
2018 J jnl
Computational Complexity of Generalized Push Fight.
CoRR
Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy
2018 Misc conf
Computational Complexity of Motion Planning of a Robot through Simple Gadgets.
FUN
Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
2018 J jnl
Computational Complexity of Motion Planning of a Robot through Simple Gadgets.
CoRR
Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy
2018 J jnl
Cookie Clicker.
CoRR
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
2018 A conf
Solving the Rubik's Cube Optimally is NP-complete.
STACS
Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
2018 — conf
Tree-Residue Vertex-Breaking: a new tool for proving hardness.
SWAT
Erik D. Demaine, Mikhail Rudoy
2018 Misc conf
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
FUN
Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
2018 J jnl
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.
CoRR
Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy
2017 J jnl
A simple proof that the $(n^2-1)$-puzzle is hard.
CoRR
Erik D. Demaine, Mikhail Rudoy
2017 J jnl
Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs.
CoRR
Erik D. Demaine, Mikhail Rudoy
2017 J jnl
Solving the Rubik's Cube Optimally is NP-complete.
CoRR
Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy
2017 J jnl
Tree-Residue Vertex-Breaking: a new tool for proving hardness.
CoRR
Erik D. Demaine, Mikhail Rudoy
2015 — conf
Computational complexity of numberless Shakashaka.
CCCG
Aviv Adler, Michael Biro, Erik D. Demaine, Mikhail Rudoy, Christiane Schmidt
2015 — conf
Dissection with the Fewest Pieces is Hard, Even to Approximate.
JCDCGG
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee
2015 J jnl
Dissection with the Fewest Pieces is Hard, Even to Approximate.
CoRR
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee