Peter Tittmann

According to our database, Peter Tittmann authored at least 21 papers between 1990 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Graph operations and neighborhood polynomials.

Maryam Alipour, Peter Tittmann

Discuss. Math. Graph Theory, 2021

2018

Neighborhood and Domination Polynomials of Graphs.

Irene Heinrich, Peter Tittmann

Graphs Comb., 2018

2017

A recursive formula for the two-edge connected and biconnected reliability of a complete graph.

Thomas Lange, Manja Reinwardt, Peter Tittmann

Networks, 2017

2015

Bipartition polynomials, the Ising model and domination in graphs.

Markus Dod, Tomer Kotek, James Preen, Peter Tittmann

Discuss. Math. Graph Theory, 2015

2014

Subset-Sum Representations of Domination Polynomials.

Tomer Kotek, James Preen, Peter Tittmann

Graphs Comb., 2014

Einführung in die Kombinatorik (2. Aufl.).

Peter Tittmann

Springer, ISBN: 978-3-642-54588-7, 2014

2012

Recurrence Relations and Splitting Formulas for the Domination Polynomial.

Tomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks

Electron. J. Comb., 2012

Domination Reliability.

Klaus Dohmen, Peter Tittmann

Electron. J. Comb., 2012

Reliability and Maintenance - Networks and Systems.

Frank Beichelt, Peter Tittmann

CRC Press, ISBN: 978-1-439-82635-5, 2012

2011

The enumeration of vertex induced subgraphs with respect to the number of components.

Peter Tittmann, Ilya Averbouch, Johann A. Makowsky

Eur. J. Comb., 2011

Counting Connected Set Partitions of Graphs.

Frank Simon, Peter Tittmann, Martin Trinks

Electron. J. Comb., 2011

2010

Bonferroni-type inequalities and binomially bounded functions.

Klaus Dohmen, Peter Tittmann

Discret. Math., 2010

Random Information Spread in Networks

Raymond Lapus, Frank Simon, Peter Tittmann

CoRR, 2010

2009

A Graph Polynomial Arising from Community Structure (Extended Abstract).

Ilya Averbouch, Johann A. Makowsky, Peter Tittmann

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2007

Improved Bonferroni Inequalities and Binomially Bounded Functions.

Klaus Dohmen, Peter Tittmann

Electron. Notes Discret. Math., 2007

2004

Bonferroni-Galambos Inequalities for Partition Lattices.

Klaus Dohmen, Peter Tittmann

Electron. J. Comb., 2004

2003

A new two-variable generalization of the chromatic polynomial.

Klaus Dohmen, André Poenitz, Peter Tittmann

Discret. Math. Theor. Comput. Sci., 2003

2000

Improved Upper Bounds for Self-Avoiding Walks in Zd.

André Poenitz, Peter Tittmann

Electron. J. Comb., 2000

1999

Partitions and Network Reliability.

Peter Tittmann

Discret. Appl. Math., 1999

1991

Reliability Bounds Based on Network Splitting.

Peter Tittmann, Andrea Blechschmidt

J. Inf. Process. Cybern., 1991

1990

Dekompositions- und Reduktionsmethoden zur Zuverlässigkeitsanalyse stochastischer Netzstrukturen.

Peter Tittmann

PhD thesis, 1990