default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Tittmann 0001
Person information
- affiliation: Hochschule Mittweida, Germany
Other persons with the same name
- Peter Tittmann 0002 (aka: Peter W. Tittmann) — University of California, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j16]Maryam Alipour, Peter Tittmann:
Graph operations and neighborhood polynomials. Discuss. Math. Graph Theory 41(3): 697-711 (2021)
2010 – 2019
- 2018
- [j15]Irene Heinrich
, Peter Tittmann:
Neighborhood and Domination Polynomials of Graphs. Graphs Comb. 34(6): 1203-1216 (2018) - 2017
- [j14]Thomas Lange, Manja Reinwardt, Peter Tittmann:
A recursive formula for the two-edge connected and biconnected reliability of a complete graph. Networks 69(4): 408-414 (2017) - 2015
- [j13]Markus Dod, Tomer Kotek, James Preen, Peter Tittmann:
Bipartition polynomials, the Ising model and domination in graphs. Discuss. Math. Graph Theory 35(2): 335-353 (2015) - 2014
- [b3]Peter Tittmann:
Einführung in die Kombinatorik (2. Aufl.). Springer 2014, ISBN 978-3-642-54588-7, pp. I-IX, 1-300 - [j12]Tomer Kotek, James Preen, Peter Tittmann:
Subset-Sum Representations of Domination Polynomials. Graphs Comb. 30(3): 647-660 (2014) - 2012
- [b2]Frank Beichelt, Peter Tittmann:
Reliability and Maintenance - Networks and Systems. CRC Press 2012, ISBN 978-1-439-82635-5, pp. I-X, 1-332 - [j11]Klaus Dohmen, Peter Tittmann:
Domination Reliability. Electron. J. Comb. 19(1): 15 (2012) - [j10]Tomer Kotek, James Preen, Frank Simon, Peter Tittmann, Martin Trinks:
Recurrence Relations and Splitting Formulas for the Domination Polynomial. Electron. J. Comb. 19(3): 47 (2012) - 2011
- [j9]Frank Simon, Peter Tittmann, Martin Trinks:
Counting Connected Set Partitions of Graphs. Electron. J. Comb. 18(1) (2011) - [j8]Peter Tittmann, Ilya Averbouch, Johann A. Makowsky:
The enumeration of vertex induced subgraphs with respect to the number of components. Eur. J. Comb. 32(7): 954-974 (2011) - [i2]Klaus Dohmen, Peter Tittmann:
Domination Reliability. CoRR abs/1103.3854 (2011) - 2010
- [j7]Klaus Dohmen, Peter Tittmann:
Bonferroni-type inequalities and binomially bounded functions. Discret. Math. 310(6-7): 1265-1268 (2010) - [i1]Raymond Lapus, Frank Simon, Peter Tittmann:
Random Information Spread in Networks. CoRR abs/1008.2081 (2010)
2000 – 2009
- 2009
- [c1]Ilya Averbouch, Johann A. Makowsky, Peter Tittmann:
A Graph Polynomial Arising from Community Structure (Extended Abstract). WG 2009: 33-43 - 2007
- [j6]Klaus Dohmen, Peter Tittmann:
Improved Bonferroni Inequalities and Binomially Bounded Functions. Electron. Notes Discret. Math. 28: 91-93 (2007) - 2004
- [j5]Klaus Dohmen, Peter Tittmann:
Bonferroni-Galambos Inequalities for Partition Lattices. Electron. J. Comb. 11(1) (2004) - 2003
- [j4]Klaus Dohmen, André Poenitz, Peter Tittmann:
A new two-variable generalization of the chromatic polynomial. Discret. Math. Theor. Comput. Sci. 6(1): 69-90 (2003) - 2000
- [j3]André Poenitz, Peter Tittmann:
Improved Upper Bounds for Self-Avoiding Walks in Zd. Electron. J. Comb. 7 (2000)
1990 – 1999
- 1999
- [j2]Peter Tittmann:
Partitions and Network Reliability. Discret. Appl. Math. 95(1-3): 445-453 (1999) - 1991
- [j1]Peter Tittmann, Andrea Blechschmidt:
Reliability Bounds Based on Network Splitting. J. Inf. Process. Cybern. 27(5/6): 317-326 (1991) - 1990
- [b1]Peter Tittmann:
Dekompositions- und Reduktionsmethoden zur Zuverlässigkeitsanalyse stochastischer Netzstrukturen. Ingenieurhochschule Mittweida, Germany, 1990
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
