default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason S. Ku
Person information
- affiliation (PhD 2016): Massachusetts Institute of Technology (MIT), CSAIL, Cambridge, MA, USA
- affiliation: National University of Singapore (NUS), Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j9]Zachary Abel, Erik D. Demaine
, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara:
Continuous flattening of all polyhedral manifolds using countably infinite creases. Comput. Geom. 98: 101773 (2021)- [i10]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara:
Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases. CoRR abs/2105.10774 (2021) - 2020
- [j8]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. 90: 101648 (2020) - [j7]Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku:
Infinite All-Layers Simple Foldability. Graphs Comb. 36(2): 231-244 (2020) - [j6]Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. J. Inf. Process. 28: 841-845 (2020) - [j5]Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi:
Rigid foldability is NP-hard. J. Comput. Geom. 11(1): 93-124 (2020) - [c9]Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth:
2048 Without Merging. CCCG 2020: 285-291 - [c8]Erik D. Demaine, Adam Hesterberg, Jason S. Ku:
Finding Closed Quasigeodesics on Convex Polyhedra. SoCG 2020: 33:1-33:13 - [i9]Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch:
Negative Instance for the Edge Patrolling Beacon Problem. CoRR abs/2006.01202 (2020) - [i8]Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch:
Escaping a Polygon. CoRR abs/2007.08965 (2020) - [i7]Erik D. Demaine, Adam C. Hesterberg, Jason S. Ku:
Finding Closed Quasigeodesics on Convex Polyhedra. CoRR abs/2008.00589 (2020)
2010 – 2019
- 2019
- [c7]Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara:
Rectangular Unfoldings of Polycubes. CCCG 2019: 159-163 - [i6]Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku:
Infinite All-Layers Simple Foldability. CoRR abs/1901.08564 (2019) - 2018
- [j4]Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch:
Pachinko. Comput. Geom. 68: 226-242 (2018) - [c6]Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch:
Negative Instance for the Edge Patrolling Beacon Problem. JCDCGGG 2018: 28-35 - [c5]Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara:
Toward Unfolding Doubly Covered n-Stars. JCDCGGG 2018: 122-135 - [i5]Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi:
Rigid Foldability is NP-Hard. CoRR abs/1812.01160 (2018) - 2017
- [j3]Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku:
Simple Folding is Really Hard. J. Inf. Process. 25: 580-589 (2017) - [j2]Erik D. Demaine, Jason S. Ku:
Folded Structures Satisfying Multiple Conditions. J. Inf. Process. 25: 601-609 (2017) - [c4]Byoungkwon An, Erik D. Demaine, Martin L. Demaine, Jason S. Ku:
Computing 3SAT on a Fold-and-Cut Machine. CCCG 2017: 208-213 - [i4]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR abs/1703.02671 (2017) - 2016
- [j1]Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi:
Rigid origami vertices: conditions and forcing sets. J. Comput. Geom. 7(1): 171-184 (2016) - [i3]Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch:
Pachinko. CoRR abs/1601.05706 (2016) - [i2]Jason S. Ku, Erik D. Demaine:
Folding Flat Crease Patterns with Thick Materials. CoRR abs/1601.05747 (2016) - 2015
- [c3]Jason S. Ku, Stephen Ho, Sanjay E. Sarma:
Landmark mapping from unbiased observations. ISC2 2015: 1-6 - [c2]Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara:
Box Pleating is Hard. JCDCGG 2015: 167-179 - [c1]Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno:
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. JCDCGG 2015: 180-192 - 2014
- [i1]Erik D. Demaine, Jason S. Ku:
Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding. CoRR abs/1410.6520 (2014)
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-07-03 21:36 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:
