Peter Tittmann - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2018

Neighborhood and Domination Polynomials of GraphsIrene Heinrich, Peter Tittmann. gc, 34(6):1203-1216, 2018. [doi]

2017

A recursive formula for the two-edge connected and biconnected reliability of a complete graphThomas Lange, Manja Reinwardt, Peter Tittmann. networks, 69(4):408-414, 2017. [doi]

2015

Bipartition polynomials, the Ising model and domination in graphsMarkus Dod, Tomer Kotek, James Preen, Peter Tittmann. dmgt, 35(2):335-353, 2015. [doi]

2014

Subset-Sum Representations of Domination PolynomialsTomer Kotek, James Preen, Peter Tittmann. gc, 30(3):647-660, 2014. [doi]

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

2012

Reliability and Maintenance - Networks and SystemsFrank Beichelt, Peter Tittmann. CRC Press, 2012. [doi]

Domination ReliabilityKlaus Dohmen, Peter Tittmann. combinatorics, 19(1):15, 2012. [doi]

Recurrence Relations and Splitting Formulas for the Domination PolynomialTomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks. combinatorics, 19(3):47, 2012. [doi]

2011

The enumeration of vertex induced subgraphs with respect to the number of componentsPeter Tittmann, Ilya Averbouch, Johann A. Makowsky. ejc, 32(7):954-974, 2011. [doi]

2010

Bonferroni-type inequalities and binomially bounded functionsKlaus Dohmen, Peter Tittmann. DM, 310(6-7):1265-1268, 2010. [doi]

Counting Connected Set Partitions of GraphsFrank Simon, Peter Tittmann, Martin Trinks. combinatorics, 18(1), 2010. [doi]

2009

A Graph Polynomial Arising from Community Structure (Extended Abstract)Ilya Averbouch, Johann A. Makowsky, Peter Tittmann. wg 2010: 33-43 [doi]

2007

Improved Bonferroni Inequalities and Binomially Bounded FunctionsKlaus Dohmen, Peter Tittmann. endm, 28:91-93, 2007. [doi]

2004

Bonferroni-Galambos Inequalities for Partition LatticesKlaus Dohmen, Peter Tittmann. combinatorics, 11(1), 2004. [doi]

2003

A new two-variable generalization of the chromatic polynomialKlaus Dohmen, André Poenitz, Peter Tittmann. dmtcs, 6(1):69-90, 2003. [doi]

2000

Improved Upper Bounds for Self-Avoiding Walks in ZdAndré Poenitz, Peter Tittmann. combinatorics, 7, 2000. [doi]

1999

Partitions and Network ReliabilityPeter Tittmann. DAM, 95(1-3):445-453, 1999. [doi]

1991

Reliability Bounds Based on Network SplittingPeter Tittmann, Andrea Blechschmidt. eik, 27(5/6):317-326, 1991.

1990

Dekompositions- und Reduktionsmethoden zur Zuverlässigkeitsanalyse stochastischer NetzstrukturenPeter Tittmann. PhD thesis, Ingenieurhochschule Mittweida, Germany, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL