| Graphentheorie: Eine anwendungsorientierte Einführung P Tittmann Graphentheorie: Eine anwendungsorientierte Einführung, 2011 | 87* | 2011 |
| A new two-variable generalization of the chromatic polynomial K Dohmen, A Pönitz, P Tittmann Discrete Mathematics and Theoretical Computer Science 6, 069-090, 2003 | 86 | 2003 |
| Recurrence relations and splitting formulas for the domination polynomial T Kotek, J Preen, F Simon, P Tittmann, M Trinks The Electronic Journal of Combinatorics 19 (3), 2012 | 72 | 2012 |
| Improved Upper Bounds for Self-Avoiding Walks in A Pönitz, P Tittmann the electronic journal of combinatorics 7, R21-R21, 2000 | 58 | 2000 |
| Graphentheorie P Tittmann Hanser Fachbuchverlag 2, 2003 | 56 | 2003 |
| Einführung in die Kombinatorik P Tittmann Einführung in die Kombinatorik, 2000 | 55* | 2000 |
| The enumeration of vertex induced subgraphs with respect to the number of components P Tittmann, I Averbouch, JA Makowsky European Journal of Combinatorics 32 (7), 954-974, 2011 | 40 | 2011 |
| Domination Reliability K Dohmen, P Tittmann arXiv, 2011 | 26 | 2011 |
| Improved upper bounds for self-avoiding walks in Zd A Pönitz, P Tittmann Electron. J. Combin 7 (1), 2000 | 24 | 2000 |
| A generalized reduction method for the connectedness probability of stochastic networks F Beichelt, P Tittmann IEEE transactions on reliability 40 (2), 198-204, 1991 | 21 | 1991 |
| Partitions and network reliability P Tittmann Discrete applied mathematics 95 (1-3), 445-453, 1999 | 19 | 1999 |
| Subset-sum representations of domination polynomials T Kotek, J Preen, P Tittmann Graphs and Combinatorics 30 (3), 647-660, 2014 | 18 | 2014 |
| Bipartition polynomials, the ising model, and domination in graphs M Dod, T Kotek, J Preen, P Tittmann Discussiones Mathematicae Graph Theory 35 (2), 335-353, 2015 | 13 | 2015 |
| Domination polynomials of graph products T Kotek, J Preen, P Tittmann arXiv preprint arXiv:1305.1475, 2013 | 12 | 2013 |
| Graphs and networks P Tittmann Computer-based diagnostics and systematic analysis of knowledge, 177-188, 2010 | 11 | 2010 |
| Computing network reliability in graphs of restricted pathwidth A Pönitz, P Tittmann Unpublished manuscript, 2001 | 10 | 2001 |
| Neighborhood and domination polynomials of graphs I Heinrich, P Tittmann Graphs and Combinatorics 34 (6), 1203-1216, 2018 | 9 | 2018 |
| Counting Connected Set Partitions of Graphs F Simon, P Tittmann, M Trinks the electronic journal of combinatorics 18 (P14), 1, 2011 | 8 | 2011 |
| Reliability Bounds Based on Network Splitting PTA Blechschmidt Elektronische Informationsverarbeitung und Kybernetik 27 (5/6), 317-326, 1991 | 8* | 1991 |
| Reliability analysis of communication networks by decomposition F Beichelt, P Tittmann Microelectronics Reliability 31 (5), 869-872, 1991 | 7 | 1991 |
Tomer KotekTU WienVerified email at forsyte.at
