default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail Rudoy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]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): 218-254 (2022)- [c11]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: 3:1-3:15 - 2021
- [c10]Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno:
Yin-Yang Puzzles are NP-complete. CCCG 2021: 97-106 - [i13]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 abs/2103.06707 (2021) - [i12]Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno:
Yin-Yang Puzzles are NP-complete. CoRR abs/2106.15585 (2021) - 2020
- [j3]Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao:
Cookie Clicker. Graphs Comb. 36(2): 269-302 (2020) - [j2]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: 41-102 (2020) - [c9]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: 63-72 - [i11]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 abs/2007.15784 (2020)
2010 – 2019
- 2019
- [c8]Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. SoCG 2019: 9:1-9:17 - [i10]Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, Csaba D. Tóth:
Circumscribing Polygons and Polygonizations for Disjoint Line Segments. CoRR abs/1903.07019 (2019) - 2018
- [j1]Erik D. Demaine, Mikhail Rudoy:
A simple proof that the (n2 - 1)-puzzle is hard. Theor. Comput. Sci. 732: 80-84 (2018) - [c7]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: 3:1-3:21 - [c6]Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy:
Computational Complexity of Generalized Push Fight. FUN 2018: 11:1-11:21 - [c5]Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy:
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. FUN 2018: 18:1-18:21 - [c4]Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy:
Solving the Rubik's Cube Optimally is NP-complete. STACS 2018: 24:1-24:13 - [c3]Erik D. Demaine, Mikhail Rudoy:
Tree-Residue Vertex-Breaking: a new tool for proving hardness. SWAT 2018: 32:1-32:14 - [i9]Jeffrey Bosboom, Erik D. Demaine, Mikhail Rudoy:
Computational Complexity of Generalized Push Fight. CoRR abs/1803.03708 (2018) - [i8]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 abs/1804.10193 (2018) - [i7]Erik D. Demaine, Isaac Grosof, Jayson Lynch, Mikhail Rudoy:
Computational Complexity of Motion Planning of a Robot through Simple Gadgets. CoRR abs/1806.03539 (2018) - [i6]Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao:
Cookie Clicker. CoRR abs/1808.07540 (2018) - 2017
- [i5]Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy:
Solving the Rubik's Cube Optimally is NP-complete. CoRR abs/1706.06708 (2017) - [i4]Erik D. Demaine, Mikhail Rudoy:
Tree-Residue Vertex-Breaking: a new tool for proving hardness. CoRR abs/1706.07900 (2017) - [i3]Erik D. Demaine, Mikhail Rudoy:
Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs. CoRR abs/1706.10046 (2017) - [i2]Erik D. Demaine, Mikhail Rudoy:
A simple proof that the $(n^2-1)$-puzzle is hard. CoRR abs/1707.03146 (2017) - 2015
- [c2]Aviv Adler, Michael Biro, Erik D. Demaine, Mikhail Rudoy, Christiane Schmidt:
Computational complexity of numberless Shakashaka. CCCG 2015 - [c1]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: 37-48 - [i1]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 abs/1512.06706 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
