My research interests lie in combinatorics and graph theory, with results and on-going projects in computational complexity, finite set systems and posets, extremal problems on trees, graph games, graph products, and network modeling. I am particularly enticed by projects motivated by applications in mathematics and other sciences.
Appeared4. I. Miklós and H. Smith. " Sampling and counting genomes rearrangement scenarios." BMC Bioinformatics 16(Suppl 14):S6 (2015).
3. H. Smith, L. A. Székely, and H. Wang. "Eccentricity Sums in Trees," Discrete Applied Mathematics 207 (2016): 120-131.
2. H. Smith and L. A. Székely "Some Remarks on Baranyai's Theorem," Congressus Numerantium 222 (2014): 43-55.
1. R. Hammack and H. Smith. "Zero Divisors among Digraphs," Graphs and Combinatorics 30.1, (2014): 171-181. (Published on-line DOI:10.1007/s00373-012-1248-x, 2012)
Submitted3. M. Ferrara, W. Kay, L. Kramer, R. Martin, B. Reiniger, H. Smith, and E. Sullivan. “The saturation number of induced subposets of the Boolean lattice.” Submitted.
2. I. Miklós and H. Smith. " The computational complexity of calculating partition functions of optimal medians with Hamming distance" Submitted.
1. H. Smith, L. A. Székely, H. Wang, and S. Yuan. "On different 'middle parts' of a tree," Submitted.