Mikhail Rudoy

Publication Activity (10 Years)

Years Active: 2015-2022
Publications (10 Years): 25

Top Topics

Phase Transition

Computational Complexity

Np Complete Problems

Top Venues

Theor. Comput. Sci.

Publications

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