Publications

Newer publications (2020 and later)

Scientific papers

2019

  1. A tanglegram Kuratowski theorem, Journal of Graph Theory 90/2 (2019), 111-122; with E. Czabarka and L. Székely. Preprint: [pdf]
  2. Reducing Simply Generated Trees by Iterative Leaf Cutting, Proceedings of the ANALCO19 Meeting on Analytic Algorithmics and Combinatorics, San Diego, January 6, 2019, pp. 36-44; with B. Hackl and C. Heuberger. Preprint: [pdf]
  3. The ancestral matrix of a rooted tree, Linear Algebra and its Applications 575 (2019), 35-65; with E. O. D. Andriantiana and K. Dadedzi. Preprint: [pdf]
  4. Compositions with a fixed number of inversions, Aequationes Mathematicae 93/3 (2019), 601-617; with A. Knopfmacher and M. E. Mays. Preprint: [pdf]
  5. Inducibility of Topological Trees, Quaestiones Mathematicae 42/6 (2019), 749-764; with A. A. V. Dossou-Olory. Preprint: [pdf]
  6. A central limit theorem for additive functionals of increasing trees (full version of 110.), Combinatorics, Probability and Computing 28/4 (2019), 618-637; with D. Ralaivaosaona. Preprint: [pdf]
  7. On the centroid of increasing trees, Discrete Mathematics and Theoretical Computer Science 21/4 (2019), #8 (29 pages); with K. Durant. Preprint: [pdf]
  8. On the inducibility of small trees; Discrete Mathematics and Theoretical Computer Science 21/4 (2019), #14 (20 pages); with A. A. V. Dossou-Olory. Preprint: [pdf]

2018

  1. On the distribution of subtree orders of a tree, Ars Mathematica Contemporanea 14/1 (2018), 129-156; with D. Ralaivaosaona.
  2. On the number of nonisomorphic subtrees of a tree, Journal of Graph Theory 87/1 (2018), 89-95; with E. Czabarka and L. Székely. Preprint: [pdf]
  3. Geometrically distributed Stirling words and Stirling compositions, Journal of Mathematical Analysis and Applications 460/1 (2018), 98-120; with A. Knopfmacher, S.-M. Ma and T. Mansour. Preprint: [pdf]
  4. Regularized Gaussian belief propagation, Statistics and Computing 28 (2018), 653-672; with F. Kamper, S. Steel and J.A. du Preez.
  5. Graphs with few total dominating sets, Discrete Mathematics 341/4 (2018), 997-1009; with M. Krzywkowski. Preprint: [pdf]
  6. Maximum star densities, Studia Scientiarum Mathematicarum Hungarica 55/2 (2018), 238-259; with C. Reiher. Preprint: [pdf]
  7. Hofstadter point spectrum trace and the Almost Mathieu operator, Journal of Mathematical Physics 59/7 (2018), 073504, 18 pp.; with S. Ouvry and S. Wu. Preprint: [pdf]
  8. Counting planar tanglegrams, Proceedings of the 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Uppsala, Sweden; Leibniz International Proceedings in Informatics 110, Article 32; with D. Ralaivaosaona and J. B. Ravelomanana.
  9. Asymptotic normality of almost local functionals in conditioned Galton-Watson trees, Proceedings of the 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Uppsala, Sweden; Leibniz International Proceedings in Informatics 110, Article 33; with D. Ralaivaosaona and M. Šileikis.
  10. Subcritical graph classes containing all planar graphs, Combinatorics, Probability and Computing 27/5 (2018), 763-773; with A. Georgakopoulos. Preprint: [pdf]

2017

  1. Hitting Times, Cover Cost, and the Wiener Index of a Tree, Journal of Graph Theory 84/3 (2017), 311-326; with A. Georgakopoulos. Preprint: [pdf]
  2. On the distribution of random walk hitting times in random trees, Proceedings of the ANALCO17 Meeting on Analytic Algorithmics and Combinatorics, Barcelona, January 16-17, 2017, pp. 73-84; with J. Oosthuizen.
  3. Paths vs. stars in the local profile of trees, Electronic Journal of Combinatorics 24/1 (2017), P1.22 (12 pages); with E. Czabarka and L. Székely.
  4. Extremal problems for trees with given segment sequence, Discrete Applied Mathematics 220 (2017), 20-34; with E. O. D. Andriantiana and H. Wang. Preprint: [pdf]
  5. On q-Quasiadditive and q-Quasimultiplicative Functions (full version of 109.), Electronic Journal of Combinatorics 24/1 (2017), P 1.60 (22 pages); with S. Kropf.
  6. Inducibility in binary trees and crossings in random tanglegrams, SIAM Journal on Discrete Mathematics 31/3 (2017), 1732-1750; with E. Czabarka and L. Székely. Preprint: [pdf]
  7. Maximizing the number of independent sets of fixed size in connected graphs with given independence number, Graphs and Combinatorics 33/5 (2017), 1103-1118; with F. Lehner. Preprint: [pdf]
  8. On the distribution of betweenness centrality in random trees (full version of 105.), Theoretical Computer Science 699 (2017), 33-52; with K. Durant. Preprint: [pdf]

2016

  1. Maximum Wiener index of trees with given segment sequence, MATCH Communications in Mathematical and in Computer Chemistry 75/1 (2016), 91-104; with E. O. D. Andriantiana and H. Wang.
  2. On the local and global means of subtree orders, Journal of Graph Theory 81/2 (2016), 154-166; with H. Wang. Preprint: [pdf]
  3. Betweenness Centrality in Random Trees, Proceedings of the ANALCO16 Meeting on Analytic Algorithmics and Combinatorics, Arlington, January 11, 2016, pp. 66-79; with K. Durant.
  4. On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees, Experimental Mathematics 25/3 (2016), 237-245; with M. Gopaladesikan and M. D. Ward. Preprint: [pdf]
  5. The shape of random tanglegrams, Advances in Applied Mathematics 78 (2016), 76-93; with M. Konvalinka. Preprint: [pdf]
  6. The height of multiple edge plane trees, Aequationes Mathematicae 90/3 (2016), 625-645; with C. Heuberger and H. Prodinger. Preprint: [pdf]
  7. q-Quasiadditive Functions, Proceedings of the 27th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms, Kraków, July 4-8, 2016; with S. Kropf.
  8. Additive functionals of d-ary increasing trees, Proceedings of the 27th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms, Kraków, July 4-8, 2016; with D. Ralaivaosaona.
  9. Compositions into powers of b: Asymptotic enumeration and parameters (full version of 86.), Algorithmica 75/4 (2016), 606-631; with D. Krenn. Preprint: [pdf]
  10. Erdős-Surányi sequences and trigonometric integrals, Publicationes Mathematicae Debrecen 89/4 (2016), 469-482; with L. Baker. Preprint: [pdf]
  11. Analysis of Bidirectional Ballot Sequences and Random Walks Ending in their Maximum, Annals of Combinatorics 20/4 (2016), 775-797; with B. Hackl, C. Heuberger and H. Prodinger. Preprint: [pdf]
  12. On the algebraic area of lattice walks and the Hofstadter model, Journal of Physics A: Mathematical and Theoretical 49 (2016), 495205 (22 pages); with S. Ouvry and S. Wu. Preprint: [pdf]
  13. Existence and Region of Critical Probabilities in Bootstrap Percolation on Inhomogeneous Periodic Trees, Proceedings of WAW 2016 - 13th Workshop on Algorithms and Models for the Web Graph, Montreal, December 14-15, 2016, Lecture Notes in Computer Science 10088 (2016), 47-59; with M. Bradonjić. Preprint: [pdf]

2015

  1. Resolution of T. Ward's Question and the Israel-Finch Conjecture. Precise Analysis of an Integer Sequence Arising in Dynamics, Combinatorics, Probability and Computing 24/1 (2015), 195-215; with J. Gaither, G. Louchard and M. D. Ward. Preprint: [pdf]
  2. Central limit theorems for additive tree parameters with small toll functions, Combinatorics, Probability and Computing 24/1 (2015), 329-353. Preprint: [pdf]
  3. Repeated fringe subtrees in random rooted trees, Proceedings of the ANALCO15 Meeting on Analytic Algorithmics and Combinatorics, San Diego, January 4, 2015, pp. 78-88; with D. Ralaivaosaona.
  4. Bootstrapping and double-exponential limit laws; Discrete Mathematics and Theoretical Computer Science 17/1 (2015), 123-144; with H. Prodinger.
  5. The number of cones generated by a Multiresolution Analysis with a sequence of LULU operators, Quaestiones Mathematicae 38/2 (2015), 297-305; with D. Laurie and C. Rohwer. Preprint: [pdf]
  6. Variances and Covariances in the Central Limit Theorem for the Output of a Transducer, European Journal of Combinatorics 49 (2015), 167-187; with C. Heuberger and S. Kropf. Preprint: [pdf]
  7. Enumeration of the adjunctive hierarchy of hereditarily finite sets, Journal of Logic and Computation 25/3 (2015), 943-963; with G. Audrito and A. I. Tomescu. Preprint: [pdf]
  8. Counting subwords in flattened partitions of sets, Discrete Mathematics 338/11 (2015), 1989-2005; with T. Mansour and M. Shattuck. Preprint: [pdf]
  9. On identities by Larcombe-Fennessey and Cassini, The Fibonacci Quarterly 53/3 (2015), 219-220; with H. Prodinger. Preprint: [pdf]
  10. Locally oriented noncrossing trees, Electronic Journal of Combinatorics 22/3 (2015), P3.36 (15 pages); with I. O. Okoth.
  11. Canonical Trees, Compact Prefix-free Codes and Sums of Unit Fractions: A Probabilistic Analysis (full version of 72.), SIAM Journal on Discrete Mathematics 29/3 (2015), 1600-1653; with C. Heuberger and D. Krenn.
  12. Multi-base representations of integers: asymptotic enumeration and central limit theorems (full version of 85.), Applicable Analysis and Discrete Mathematics 9/2 (2015), 285-312; with D. Krenn and D. Ralaivaosaona.

2014

  1. Set partition asymptotics and a conjecture of Gould and Quaintance, Journal of Mathematical Analysis and Applications 416/2 (2014), 672-682; with W. Asakly, A. Blecher, C. Brennan, A. Knopfmacher and T. Mansour. Preprint: [pdf]
  2. Enumeration of highly balanced trees, Ars Combinatoria 114 (2014), 15-32. Preprint: [pdf]
  3. Graphs with maximal Hosoya index and minimal Merrifield-Simmons index, Discrete Mathematics 329 (2014), 77-87; with Z. Zhu, C. Yuan and E. O. D. Andriantiana. Preprint: [pdf]
  4. On the number of multi-base representations of an integer, Proceedings of the 25th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms, Paris, June 16-20, 2014, pp. 229-240; with D. Krenn and D. Ralaivaosaona.
  5. The number of compositions into powers of b, Proceedings of the 25th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms, Paris, June 16-20, 2014, pp. 241-252; with D. Krenn.
  6. Counting glycans revisited, Journal of Mathematical Biology 69/4 (2014), 799-816; with S. Böcker. Preprint: [pdf]
  7. Indistinguishable trees and graphs, Graphs and Combinatorics 30/6 (2014), 1593-1605; with H. Wang. Preprint: [pdf]
  8. A general asymptotic scheme for the analysis of partition statistics, Combinatorics, Probability and Computing 23/6 (2014), 1057-1086; with P. J. Grabner and A. Knopfmacher. Preprint: [pdf]
  9. Uniform spanning trees on Sierpinski graphs, ALEA - Latin American Journal of Probability and Mathematical Statistics 11 (2014), 737-780; with M. Shinoda and E. Teufl. Preprint: [pdf]

2013

  1. Analysis of Parameters of Trees Corresponding to Huffman Codes and Sums of Unit Fractions, Proceedings of the ANALCO13 Meeting on Analytic Algorithmics and Combinatorics, New Orleans, January 6, 2013, pp. 33-42; with C. Heuberger and D. Krenn.
  2. On sums of distinct odd squares arising from a class of totally symmetric plane partitions, Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie 56(104)/2 (2013), 163-171; with A. Blecher, A. Knopfmacher and F. Luca. Preprint: [pdf]
  3. Free Lamplighter Groups and a Question of Atiyah, American Journal of Mathematics 135/3 (2013), 835-849; with F. Lehner. Preprint: [pdf]
  4. Distance-based graph invariants of trees and the Harary index, FILOMAT 27/1 (2013), 41-50; with H. Wang and X. Zhang. Preprint: [pdf]
  5. Asymptotic enumeration of extensional acyclic digraphs (full version of 64.), Algorithmica 66/4 (2013), 829-847. Preprint: [pdf]
  6. Greedy trees, subtrees and antichains, Electronic Journal of Combinatorics 20/3 (2013), P28 (25 pages); with E. O. D. Andriantiana and H. Wang.
  7. Coupon collecting and transversals of hypergraphs, Discrete Mathematics and Theoretical Computer Science 15/2 (2013), 259-270; with M. Wild, S. Janson and D. Laurie. Preprint: [pdf]
  8. The number of fixed points of Wilf's partition involution, Electronic Journal of Combinatorics 20/4 (2013), P13 (7 pages).
  9. A note on the number of dominating sets of a graph, Utilitas Mathematica 92 (2013), 25-31. Preprint: [pdf]
  10. Spectral moments of trees with given degree sequence, Linear Algebra and its Applications 439 (2013), 3980-4002; with E. O. D. Andriantiana. Preprint: [pdf]

2012

  1. Asymptotic enumeration of extensional acyclic digraphs, Proceedings of the ANALCO12 Meeting on Analytic Algorithmics and Combinatorics, Kyoto, January 16, 2012, pp. 1-8.
  2. On the Wiener index of random trees, Discrete Mathematics 312/9 (2012), 1502-1511. Preprint: [pdf]
  3. Successions in words and compositions, Annals of Combinatorics 16/2 (2012), 277-287; with A. Knopfmacher and A. Munagi. Preprint: [pdf]
  4. Greedy trees, caterpillars, and Wiener-type graph invariants, MATCH Communications in Mathematical and in Computer Chemistry 68/1 (2012), 273-292; with N. S. Schmuck and H. Wang.
  5. Decomposing the hypercube Q_n into n isomorphic edge-disjoint trees, Discrete Mathematics 312/10 (2012), 1819-1822; with M. Wild. Preprint: [pdf]
  6. Additive tree functionals with small toll functions and subtrees of random trees, Proceedings of the 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms, Montreal, June 18-22, 2012, pp. 67-80.
  7. Energy Bounds for Graphs with Fixed Cyclomatic Number, MATCH Communications in Mathematical and in Computer Chemistry 68/3 (2012), 661-674.
  8. The matching energy of a graph, Discrete Applied Mathematics 160/15 (2012), 2177-2187; with I. Gutman. Preprint: [pdf]

2011

  1. Fibonacci Integers, Journal of Number Theory 131/3 (2011), 440-457; with F. Luca and C. Pomerance. Preprint: [pdf]
  2. On the number of independent subsets in trees with restricted degrees, Mathematical and Computer Modelling 53/5-6 (2011), 678-683; with E. O. D. Andriantiana. Preprint: [pdf]
  3. Resistance scaling and the number of spanning trees in self-similar lattices, Journal of Statistical Physics 142/4 (2011), 879-897; with E. Teufl. Preprint: [pdf]
  4. Limit distributions of smallest gap and largest repeated part in integer partitions, The Ramanujan Journal 25/2 (2011), 229-246. Preprint: [pdf]
  5. The number of spanning trees in self-similar graphs, Annals of Combinatorics 15/2 (2011), 355-380; with E. Teufl. Preprint: [pdf]
  6. Unicyclic graphs with large energy, Linear Algebra and its Applications 435/6 (2011), 1399-1414; with E. O. D. Andriantiana. Preprint: [pdf]
  7. Unfair Permutations, European Journal of Combinatorics 32 (2011), 1282-1298; with H. Prodinger and C. Schneider. Preprint: [pdf]
  8. The number of maximum matchings in a tree, Discrete Mathematics 311/21 (2011), 2512-2542; with C. Heuberger. Preprint available as report 2010-14: [pdf]
  9. Labeled trees, functions, and an algebraic identity, Electronic Journal of Combinatorics 18(1) (2011), P188 (5 pages); Preprint: [pdf]
  10. Separation of the maxima in samples of geometric random variables, Applicable Analysis and Discrete Mathematics 5/2 (2011), 271-282; with C. Brennan, A. Knopfmacher and T. Mansour.

2010

  1. Determinant identities for Laplace matrices, Linear Algebra and its Applications 432/1 (2010), 441-457; with E. Teufl. Preprint: [pdf]
  2. Deterministic edge-weights in increasing tree families, Combinatorics, Probability and Computing 19/1 (2010), 99-119; with M. Kuba. Preprint: [pdf]
  3. Bijections for a class of labeled plane trees, European Journal of Combinatorics 31/3 (2010), 720-732; with N.S.S. Gu and H. Prodinger. Preprint: [pdf]
  4. Enumeration of matchings in families of self-similar graphs, Discrete Applied Mathematics 158/14 (2010), 1524-1535; with E. Teufl. Preprint: [pdf]
  5. A central limit theorem for integer partitions, Monatshefte für Mathematik 161/1 (2010), 85-114; with M. Madritsch. Preprint: [pdf]
  6. A note on the inverse problem for the Wiener index, MATCH Communications in Mathematical and in Computer Chemistry 64/3 (2010), 639-646.
  7. Records in set partitions, Electronic Journal of Combinatorics 17(1) (2010), R109 (14 pages); with A. Knopfmacher and T. Mansour.
  8. Asymptotics of the extremal values of certain graph parameters in trees with bounded degree, Publicationes Mathematicae Debrecen 77/3-4 (2010), 347-367; with C. Heuberger. Preprint available as report 2007-12: [pdf]
  9. Enumerating set partitions by the number of positions between adjacent occurrences of a letter, Applicable Analysis and Discrete Mathematics 4 (2010), 284-308; with T. Mansour and M. Shattuck.
  10. On unary nodes in tries, Proceedings of the 21st International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Vienna, June 28 - July 2, 2010, pp. 577-590.
  11. On the number of spanning trees on various lattices, Journal of Physics A: Mathematical and Theoretical 43 (2010), 415001 (8 pages); with E. Teufl. Preprint: [pdf]
  12. On the distribution of depths in increasing trees, Electronic Journal of Combinatorics 17(1) (2010), R137 (9 pages); with M. Kuba.
  13. Maxima and minima of the Hosoya index and the Merrifield-Simmons index: A survey of results and techniques, Acta Applicandae Mathematicae 112/3 (2010), 323-346; with I. Gutman. Preprint: [pdf]
  14. Counting all parity realizable trees, Journal of Combinatorial Mathematics and Combinatorial Computing 75 (2010), 11-32. Preprint: [pdf]

2009

  1. Asymptotic enumeration on self-similar graphs with two boundary vertices, Discrete Mathematics and Theoretical Computer Science 11/1 (2009), 11-32; with E. Teufl. Preprint: [pdf]
  2. Molecular graphs and the inverse Wiener index problem, Discrete Applied Mathematics 157/7 (2009), 1544-1554; with H. Wang and G. Yu. Preprint: [pdf]; see also Mathematica files
  3. On the parity of the Wiener index, European Journal of Combinatorics 30/4 (2009), 996-1004; with H. Wang. Preprint: [pdf]
  4. On tries, contention trees and their analysis, Annals of Combinatorics 12/4 (2009), 493-507. Preprint: [pdf]
  5. On a Class of Extremal Trees for Various Indices, MATCH Communications in Mathematical and in Computer Chemistry 62/3 (2009), 437-464; with C. Heuberger.
  6. Chemical Trees Minimizing Energy and Hosoya Index, Journal of Mathematical Chemistry 46/1 (2009), 214-230; with C. Heuberger. Preprint available as report 2008-6: [pdf]
  7. Some new results on distance-based graph invariants, European Journal of Combinatorics 30/5 (2009), 1149-1163; with M. H. Khalifeh, H. Yousefi-Azari and A. R. Ashrafi. Preprint: [pdf]
  8. The digit generating function of a polynomial, Journal of Number Theory 129/6 (2009), 1325-1337; with H. Prodinger. Preprint: [pdf]
  9. Waring's problem with restrictions on q-additive functions, Mathematica Slovaca 59/3 (2009), 339-348. Preprint: [pdf]
  10. An asymptotic independence theorem for the number of matchings in graphs, Graphs and Combinatorics 25/2 (2009), 239-251; with E. Teufl. Preprint: [pdf]
  11. Almost all trees have an even number of independent sets, Electronic Journal of Combinatorics 16(1) (2009), R93 (10 pages).
  12. On a problem of Ahlswede and Katona, Studia Scientiarum Mathematicarum Hungarica 46/3 (2009), 423-435; with H. Wang. Preprint: [pdf]
  13. The inverse problem for certain tree parameters, Discrete Applied Mathematics 157/15 (2009), 3314 - 3319; with E. Czabarka and L. Székely. Preprint: [pdf]; see also Mathematica file
  14. Spanning forests, electrical networks, and a determinant identity, Proceedings of the 21st International Conference on Formal Power Series and Algebraic Combinatorics, Hagenberg, July 20-24, 2009, pp. 847-858; with E. Teufl.
  15. On the distribution of the longest run in number partitions, The Ramanujan Journal 20/2 (2009), 189-206. Preprint: [pdf]
  16. Exact and asymptotic enumeration of perfect matchings in self-similar graphs, Discrete Mathematics 309/23-24 (2009), 6612-6625; with E. Teufl. Preprint: [pdf]

2008

  1. Algorithmic generation of molecular graphs with large Merrifield-Simmons index, MATCH Communications in Mathematical and in Computer Chemistry 59/1 (2008), 239-252; with R.F. Tichy. See also programs
  2. Maximizing the number of independent subsets over trees with bounded degree, Journal of Graph Theory 58/1 (2008), 49-68; with C. Heuberger. Preprint available as report 2007-3: [pdf]
  3. The distribution of ascents of size d or more in partitions of n, Combinatorics, Probability and Computing 17/4 (2008), 495-509; with C. Brennan and A. Knopfmacher. Preprint: [pdf]
  4. Combinatorial properties of a general domination problem with parity constraints, Discrete Mathematics 308/24 (2008), 6355-6367; with J. Hatzl. Preprint: [pdf]
  5. Positional number systems with digits forming an arithmetic progression, Monatshefte für Mathematik 155/3-4 (2008), 349-375; with C. Heuberger and H. Prodinger. Preprint available as report 2007-10: [pdf]
  6. Subset counting in trees, Ars Combinatoria 89 (2008), 127-139. Preprint: [pdf]
  7. Joint distributions for movements of elements in Sattolo's and the Fisher-Yates algorithm, Quaestiones Mathematicae 31/4 (2008), 307-344; with G. Louchard and H. Prodinger. Preprint: [pdf]

2007

  1. Extremal trees with respect to Hosoya Index and Merrifield-Simmons Index, MATCH Communications in Mathematical and in Computer Chemistry 57 (2007), 221-233.
  2. Correlation of graph-theoretical indices, SIAM Journal on Discrete Mathematics 21/1 (2007), 33-46. Preprint: [pdf]; see also proof details
  3. On the average Wiener index of degree-restricted trees, Australasian Journal of Combinatorics 37 (2007), 187-203. Preprint: [pdf]
  4. On the number of matchings of a tree, European Journal of Combinatorics 28/4 (2007), 1322-1330. Preprint: [pdf]
  5. Numbers with fixed sum of digits in linear recurrent number systems, The Ramanujan Journal 14/1 (2007), 43-68. Preprint: [pdf]
  6. Graphs, Partitions and Fibonacci Numbers, Discrete Applied Mathematics 155/10 (2007), 1175-1187; with A. Knopfmacher, R.F. Tichy. and V. Ziegler. Preprint: [pdf]
  7. Enumeration problems for classes of self-similar graphs, Journal of Combinatorial Theory, Series A 114/7 (2007), 1254-1277; with E. Teufl. Preprint: [pdf]
  8. Perfect matchings and k-decomposability of increasing trees, Séminaire Lotharingien de Combinatoire B57a (2007), 14 pages; with M. Kuba.
  9. The Fibonacci Number of Fibonacci trees and a related family of polynomial recurrence systems, The Fibonacci Quarterly 45/3 (2007), 247-253. Preprint: [pdf]
  10. Minimal and maximal plateau lengths in Motzkin paths, Proceedings of the 2007 Conference on Analysis of Algorithms, Juan les pins, June 17-22, 2007, pp. 353-362; with H. Prodinger.

2006

  1. A class of trees and its Wiener index, Acta Applicandae Mathematicae 91/2 (2006), 119-132. Preprint: [pdf]
  2. On the number of decomposable trees, Proceedings of the Fourth Colloquium on Mathematics and Computer Science, Nancy, September 18-22, 2006, pp. 301-308.
  3. The number of spanning trees of finite Sierpinski graphs, Proceedings of the Fourth Colloquium on Mathematics and Computer Science, Nancy, September 18-22, 2006, pp. 411-414; with E. Teufl.
  4. On an identity for the cycle indices of rooted tree automorphism groups, Electronic Journal of Combinatorics 13(1) (2006), N14 (7 pages).
  5. The Fibonacci Number of generalized Petersen graphs, The Fibonacci Quarterly 44/4 (2006), 362-367. Preprint: [pdf]

2005

  1. Extremal Problems for Topological Indices in Combinatorial Chemistry, Journal of Computational Biology 12/7 (2005), 1004-1013; with R.F. Tichy. Preprint: [pdf]

Book chapters

  • Greedy trees, caterpillars, and Wiener-type graph invariants, in Distance in Molecular Graphs - Theory (I. Gutman, B. Furtula, eds.), Mathematical Chemistry Monographs 12, 2012, pp. 195-214; with N. S. Schmuck and H. Wang. (identical to journal paper 67.)
  • Problems Related to Graph Indices in Trees, in Recent Trends in Combinatorics (A. Beveridge, J. R. Griggs, L. Hogben, G. Musiker, P. Tetali, eds.), pp. 3-30, Springer, 2016; with L. Székely and H. Wang.
  • Laplacian-Energy-Like Invariant: Laplacian Coefficients, Extremal Graphs and Bounds, in Energies of Graphs - Theory and Applications (I. Gutman, X. Li, eds.), pp. 81-110, Mathematical Chemistry Monographs No. 17, 2016; with D. Stevanović.
  • Upper and Lower Bounds for Merrifield-Simmons Index and Hosoya Index, in Bounds in Chemical Graph Theory - Basics (I. Gutman, B. Furtula, K. C. Das, E. Milovanović, I. Milovanović, eds.), pp. 155-187, Mathematical Chemistry Monographs No. 19, 2017.
  • On the monoid generated by a Lucas sequence, in Number Theory - Diophantine problems, uniform distribution and applications (C. Elsholtz, P. Grabner, eds.), pp. 281-301, Springer 2017; with C. Heuberger. Preprint: [pdf]

    • Book

    Introduction to Chemical Graph Theory, Chapman and Hall/CRC Press, 2018, with H. Wang.

    Theses

  • Ph.D. thesis: Graph-theoretical enumeration and digital expansions - an analytic approach [pdf]
  • Diploma thesis on applications of the Hardy-Littlewood-method: Anwendungen der Hardy-Littlewood-Methode - Partitionen und das Problem von Waring (German) [pdf]
  • "Fachbereichsarbeit" (small scientific work for the school exit exam) on game theory: Spieltheorie (German) [pdf]

    • Mathematical Olympiad

  • Combinatorics notes (English) [pdf]
  • Kombinatorik-Skriptum (German) [pdf]

    • Mathematics teaching

    Teaching mathematical problem solving, in Proceedings of the 22nd Annual National Congress of the Association for Mathematics Education of South Africa (B. Goba and J. Naidoo, eds.), pp.73-84, 2016. (plenary paper)

    Please note: All items are copyrighted either by the author or the publisher!