default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeather C. Smith Blake
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Zhanar Berikkyzy, Beth Bjorkman, Heather C. Smith Blake
, Sogol Jahanbekam, Lauren Keough, Kevin Moss, Danny Rorabaugh, Songling Shan:
Triangle-degree and triangle-distinct graphs. Discret. Math. 347(1): 113695 (2024)- [j17]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and enumeration in models of genome rearrangement. Theor. Comput. Sci. 1022: 114880 (2024) - [c2]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann:
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model. SWAT 2024: 3:1-3:16 - [i6]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann:
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model. CoRR abs/2402.01942 (2024) - 2023
- [c1]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and Enumeration in Models of Genome Rearrangement. COCOON (1) 2023: 3-14 - [i5]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and Enumeration in Models of Genome Rearrangement. CoRR abs/2305.01851 (2023) - 2022
- [j16]Kira V. Adaricheva, Heather C. Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth:
Hamilton Paths in Dominating Graphs of Trees and Cycles. Graphs Comb. 38(6): 174 (2022) - [i4]Piotr Micek, Heather C. Smith Blake, William T. Trotter:
Boolean dimension and dim-boundedness: Planar cover graph with a zero. CoRR abs/2206.06942 (2022) - 2021
- [j15]Csaba Biró, Bartlomiej Bosek, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young:
Planar Posets that are Accessible from Below Have Dimension at Most 6. Order 38(1): 21-36 (2021) - [j14]Heather C. Smith, William T. Trotter:
Fractional Local Dimension. Order 38(2): 329-350 (2021) - 2020
- [j13]Ryan R. Martin, Heather C. Smith, Shanise Walker:
Improved Bounds for Induced Poset Saturation. Electron. J. Comb. 27(2): 2 (2020) - [j12]Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang:
On difference graphs and the local dimension of posets. Eur. J. Comb. 86: 103074 (2020) - [j11]Fidel Barrera-Cruz, Thomas Prag, Heather C. Smith, Libby Taylor, William T. Trotter:
Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension. Order 37(2): 243-269 (2020)
2010 – 2019
- 2019
- [j10]István Miklós, Heather C. Smith:
The computational complexity of calculating partition functions of optimal medians with Hamming distance. Adv. Appl. Math. 102: 18-82 (2019) - [j9]Beth Bjorkman, Garner Cochran, Wei Gao, Lauren Keough, Rachel Kirsch, Mitch Phillipson, Danny Rorabaugh, Heather C. Smith, Jennifer Wise:
k-foldability of words. Discret. Appl. Math. 259: 19-30 (2019) - [j8]Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter:
Separating tree-chromatic number from path-chromatic number. J. Comb. Theory B 138: 206-218 (2019) - [j7]Fidel Barrera-Cruz, Rebecca E. Garcia, Pamela E. Harris, Bethany Kubik, Heather C. Smith, Shannon Talbott, Libby Taylor, William T. Trotter:
The Graph of Critical Pairs of a Crown. Order 36(3): 621-652 (2019) - 2018
- [j6]Heather C. Smith, László A. Székely, Hua Wang, Shuai Yuan:
On Different "Middle Parts" of a Tree. Electron. J. Comb. 25(3): 3 (2018) - [j5]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the Crossing Number and the Tangle Crossing Number. Electron. J. Comb. 25(4): 4 (2018) - [i3]Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang:
On difference graphs and the local dimension of posets. CoRR abs/1803.08641 (2018) - 2017
- [j4]Michael Ferrara, Bill Kay, Lucas Kramer, Ryan R. Martin, Benjamin Reiniger, Heather C. Smith, Eric Sullivan:
The saturation number of induced subposets of the Boolean lattice. Discret. Math. 340(10): 2479-2487 (2017) - [i2]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the crossing number and the tangle crossing number. CoRR abs/1709.08119 (2017) - 2016
- [j3]Heather C. Smith, László A. Székely, Hua Wang:
Eccentricity sums in trees. Discret. Appl. Math. 207: 120-131 (2016) - 2015
- [j2]István Miklós, Heather C. Smith:
Sampling and counting genome rearrangement scenarios. BMC Bioinform. 16(S14): S6 (2015) - [i1]István Miklós, Heather C. Smith:
The computational complexity of calculating partition functions of optimal medians with Hamming distance. CoRR abs/1506.06107 (2015) - 2014
- [j1]Richard H. Hammack, Heather C. Smith:
Zero Divisors Among Digraphs. Graphs Comb. 30(1): 171-181 (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-10-25 21:18 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:
