Dekompositions- und Reduktionsmethoden zur Zuverlässigkeitsanalyse stochastischer Netzstrukturen. - Peter Tittmann 001 (1990)

Reliability Bounds Based on Network Splitting. - Peter Tittmann 001; Andrea Blechschmidt (J. Inf. Process. Cybern., 1991)

Partitions and Network Reliability. - Peter Tittmann 001 (Discret. Appl. Math., 1999)

Improved Upper Bounds for Self-Avoiding Walks in Zd. - André Poenitz; Peter Tittmann 001 (Electron. J. Comb., 2000)

A new two-variable generalization of the chromatic polynomial. - Klaus Dohmen; André Poenitz; Peter Tittmann 001 (Discret. Math. Theor. Comput. Sci., 2003)

Bonferroni-Galambos Inequalities for Partition Lattices. - Klaus Dohmen; Peter Tittmann 001 (Electron. J. Comb., 2004)

Improved Bonferroni Inequalities and Binomially Bounded Functions. - Klaus Dohmen; Peter Tittmann 001 (Electron. Notes Discret. Math., 2007)

A Graph Polynomial Arising from Community Structure (Extended Abstract). - Ilya Averbouch; Johann A. Makowsky; Peter Tittmann 001 (WG, 2009)

Random Information Spread in Networks - Raymond Lapus; Frank Simon; Peter Tittmann 001 (CoRR, 2010)

Bonferroni-type inequalities and binomially bounded functions. - Klaus Dohmen; Peter Tittmann 001 (Discret. Math., 2010)

Counting Connected Set Partitions of Graphs. - Frank Simon; Peter Tittmann 001; Martin Trinks (Electron. J. Comb., 2011)

The enumeration of vertex induced subgraphs with respect to the number of components. - Peter Tittmann 001; Ilya Averbouch; Johann A. Makowsky (Eur. J. Comb., 2011)

Reliability and Maintenance - Networks and Systems. - Frank Beichelt; Peter Tittmann 001 (CRC Press, 2012)

Domination Reliability. - Klaus Dohmen; Peter Tittmann 001 (Electron. J. Comb., 2012)

Recurrence Relations and Splitting Formulas for the Domination Polynomial. - Tomer Kotek; James Preen; Frank Simon; Peter Tittmann 001; Martin Trinks (Electron. J. Comb., 2012)

Einführung in die Kombinatorik (2. Aufl.). - Peter Tittmann 001 (Springer, 2014)

Subset-Sum Representations of Domination Polynomials. - Tomer Kotek; James Preen; Peter Tittmann 001 (Graphs Comb., 2014)

Bipartition polynomials, the Ising model and domination in graphs. - Markus Dod; Tomer Kotek; James Preen; Peter Tittmann 001 (Discuss. Math. Graph Theory, 2015)

A recursive formula for the two-edge connected and biconnected reliability of a complete graph. - Thomas Lange; Manja Reinwardt; Peter Tittmann 001 (Networks, 2017)

Neighborhood and Domination Polynomials of Graphs. - Irene Heinrich; Peter Tittmann 001 (Graphs Comb., 2018)

Graph operations and neighborhood polynomials. - Maryam Alipour; Peter Tittmann 001 (Discuss. Math. Graph Theory, 2021)