default search action
Timothy Sun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Juvenal F. Barajas, Timothy Sun
:
Index 3 biembeddings of the complete graphs. Discret. Math. 347(1): 113688 (2024) - [j12]Timothy Sun:
Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs. Eur. J. Comb. 120: 103974 (2024) - [j11]Timothy Sun
Commutators in the Rubik's Cube Group. Am. Math. Mon. 131(1): 3-19 (2024) - [c7]Daniel J. Chang, Timothy Sun:
Harborth's Conjecture for 4-Regular Planar Graphs. GD 2024: 38:1-38:9 - 2023
- [j10]Timothy Sun:
Settling the genus of the n-prism. Eur. J. Comb. 110: 103667 (2023) - [j9]Warren Singh, Timothy Sun
Settling the Nonorientable Genus of the Nearly Complete Bipartite Graphs. Graphs Comb. 39(5): 96 (2023) - [c6]Zhuozhuo Joy Liu
AAnim: An Animation Engine for Visualizing Algorithms and Data Structures for Educators. SIGCSE (2) 2023: 1287 - 2022
- [j8]Timothy Sun:
On the bigenus of the complete graphs. Australas. J Comb. 84: 212-219 (2022) - [j7]Xi Chen, Tim Randolph, Rocco A. Servedio
A Lower Bound on Cycle-Finding in Sparse Digraphs. ACM Trans. Algorithms 18(4): 31:1-31:23 (2022) - 2021
- [j6]Timothy Sun
Face distributions of embeddings of complete graphs. J. Graph Theory 97(2): 281-304 (2021) - 2020
- [j5]Timothy Sun:
Simultaneous current graph constructions for minimum triangulations and complete graph embeddings. Ars Math. Contemp. 18(2): 309-337 (2020) - [c5]Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. SODA 2020: 2936-2952
2010 – 2019
- 2019
- [b1]Timothy Sun:
Testing Convexity and Acyclicity, and New Constructions for Dense Graph Embeddings. Columbia University, USA, 2019 - [j4]Timothy Sun:
A simple construction for orientable triangular embeddings of the complete graphs on 12s vertices. Discret. Math. 342(4): 1147-1151 (2019) - [i4]Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. CoRR abs/1907.12106 (2019) - 2017
- [c4]Xi Chen, Adam Freilich, Rocco A. Servedio, Timothy Sun:
Sample-Based High-Dimensional Convexity Testing. APPROX-RANDOM 2017: 37:1-37:20 - [i3]Xi Chen, Adam Freilich, Rocco A. Servedio, Timothy Sun:
Sample-based high-dimensional convexity testing. CoRR abs/1706.09362 (2017) - 2016
- [c3]Changxi Zheng, Timothy Sun, Xiang Chen:
Deployable 3D linkages with collision avoidance. Symposium on Computer Animation 2016: 179-188 - 2015
- [j3]Timothy Sun, Changxi Zheng:
Computational design of twisty joints and puzzles. ACM Trans. Graph. 34(4): 101:1-101:11 (2015) - 2014
- [j2]Jonathan L. Gross, Michal Kotrbcík, Timothy Sun:
Genus distributions of cubic series-parallel graphs. Discret. Math. Theor. Comput. Sci. 16(3): 129-146 (2014) - [j1]Timothy Sun, Papoj Thamjaroenporn, Changxi Zheng:
Fast multipole representation of diffusion curves and points. ACM Trans. Graph. 33(4): 53:1-53:12 (2014) - [i2]Jonathan L. Gross, Michal Kotrbcík, Timothy Sun:
Genus Distributions of cubic series-parallel graphs. CoRR abs/1407.8031 (2014) - 2013
- [c2]Timothy Sun:
Drawing some 4-regular planar graphs with integer edge lengths. CCCG 2013 - 2011
- [c1]Timothy Sun:
Rigidity-Theoretic Constructions of Integral Fary Embeddings. CCCG 2011 - 2010
- [i1]Timothy Sun, Chun Ye:
Rigidity of Graph Joins and Hendrickson's Conjecture. CoRR abs/1011.3208 (2010)
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-10-30 20:34 CET 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: