default search action
Thomas C. Hull
Person information
- affiliation: Western New England University, Springfield, MA, USA
- affiliation (PhD 1997): University of Rhode Island, Kingston, RI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i7]Thomas C. Hull, Inna Zakharevich:
Flat origami is Turing Complete. CoRR abs/2309.07932 (2023) - 2022
- [j7]Thomas C. Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov:
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms. J. Graph Algorithms Appl. 26(1): 503-517 (2022) - [c4]Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec:
Quasi-Twisting Convex Polyhedra. CCCG 2022: 270-276 - [i6]Thomas C. Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov:
Maximal origami flip graphs of flat-foldable vertices: properties and algorithms. CoRR abs/2203.14173 (2022) - 2021
- [j6]Alvin Chiu, William Hoganson, Thomas C. Hull
, Sylvia Wu:
Counting Locally Flat-Foldable Origami Configurations Via 3-Coloring Graphs. Graphs Comb. 37(1): 241-261 (2021) - [c3]Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt:
Folding Points to a Point and Lines to a Line. CCCG 2021: 271-278 - 2020
- [j5]Hugo A. Akitaya
Rigid foldability is NP-hard. J. Comput. Geom. 11(1): 93-124 (2020) - [j4]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull
Face flips in origami tessellations. J. Comput. Geom. 11(1): 397-417 (2020)
2010 – 2019
- 2019
- [i5]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw:
Face flips in origami tessellations. CoRR abs/1910.05667 (2019) - 2018
- [i4]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
- [i3]Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Y. Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami:
Minimal forcing sets for 1D origami. CoRR abs/1703.06373 (2017) - 2016
- [j3]Zachary Abel, Jason H. Cantarella
Rigid origami vertices: conditions and forcing sets. J. Comput. Geom. 7(1): 171-184 (2016) - [i2]Thomas C. Hull:
Coloring connections with counting mountain-valley assignments. CoRR abs/1601.02727 (2016) - 2015
- [c2]Hugo A. Akitaya
Box Pleating is Hard. JCDCGG 2015: 167-179 - [c1]Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull:
Minimum Forcing Sets for Miura Folding Patterns. SODA 2015: 136-147 - 2014
- [j2]Jessica Ginepro, Thomas C. Hull:
Counting Miura-ori Foldings. J. Integer Seq. 17(10): 14.10.8 (2014) - [i1]Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull:
Minimum Forcing Sets for Miura Folding Patterns. CoRR abs/1410.2231 (2014) - 2011
- [j1]Thomas C. Hull
Solving Cubics With Creases: The Work of Beloch and Lill. Am. Math. Mon. 118(4): 307-315 (2011)
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:34 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: