default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJane Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j9]John Haslegrave, Alex D. Scott, Youri Tamitegama, Jane Tan:
Boundary rigidity of 3D CAT(0) cube complexes. Eur. J. Comb. 124: 104077 (2025)- 2024
- [j8]António Girão, Freddie Illingworth
, Emil Powierski, Michael Savery, Alex Scott, Youri Tamitegama, Jane Tan:
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number. Comb. 44(1): 37-62 (2024) - [j7]Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. Comb. Probab. Comput. 33(3): 351-376 (2024) - 2023
- [j6]Paul Balister, Emil Powierski, Alex Scott, Jane Tan:
Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions. Random Struct. Algorithms 62(3): 564-584 (2023) - [j5]Carla Groenland, Tom Johnston, Dániel Korándi, Alexander Roberts, Alex D. Scott, Jane Tan:
Decomposing Random Permutations into Order-Isomorphic Subpermutations. SIAM J. Discret. Math. 37(2): 1252-1261 (2023) - 2022
- [j4]Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan:
Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory B 157: 283-293 (2022) - [j3]Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan:
A Note on Infinite Antichain Density. SIAM J. Discret. Math. 36(1): 573-577 (2022) - [c3]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. SoCG 2022: 38:1-38:14 - [i3]Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt:
On Comparable Box Dimension. CoRR abs/2203.07686 (2022) - [i2]Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. CoRR abs/2206.02395 (2022) - [i1]Jane Tan, Yong Tan:
Crypto Rewards in Fundraising: Evidence from Crypto Donations to Ukraine. CoRR abs/2207.07490 (2022) - 2020
- [j2]Jane Tan:
Small 4-regular planar graphs that are not circle representable. Australas. J Comb. 76: 428-435 (2020) - [c2]Jane Tan, Fujie Jin, Alan R. Dennis:
Attention or Appreciation? The Impact of Feedback on Online Volunteering. HICSS 2020: 1-10 - [c1]Jane Tan, Lu Lucy Yan, Alfonso J. Pedraza Martinez:
How to Share Prosocial Behavior without Being Considered a Braggart? HICSS 2020: 1-10
2010 – 2019
- 2019
- [j1]Jane Tan, Kartik K. Iyer, Alexander D. Tang, Asif Jamil, Ralph N. Martins, Hamid R. Sohrabi, Michael A. Nitsche, Mark R. Hinder, Hakuei Fujiyama:
Modulating functional connectivity with non-invasive brain stimulation for the investigation and alleviation of age-associated declines in response inhibition: A narrative review. NeuroImage 185: 490-512 (2019)
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-31 21:08 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:
