Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Dohmen
Person information
- affiliation: Mittweida University of Applied Sciences, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2001
[b1]Klaus Dohmen:
Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Applications to Reliability Analysis of Coherent Systems. HU Berlin, Germany, 2001
Journal Articles
- 2015
- [j24]Klaus Dohmen:
Closed-form expansions for the universal edge elimination polynomial. Australas. J Comb. 63: 196-201 (2015) - 2014
- [j23]Klaus Dohmen, Martin Trinks:
An Abstraction of Whitney's Broken Circuit Theorem. Electron. J. Comb. 21(4): 4 (2014) - 2012
- [j22]Klaus Dohmen, Peter Tittmann:
Domination Reliability. Electron. J. Comb. 19(1): 15 (2012) - 2011
- [j21]Klaus Dohmen
:
An inductive proof of Whitney's Broken Circuit Theorem. Discuss. Math. Graph Theory 31(3): 509-515 (2011) - 2010
- [j20]Klaus Dohmen, Peter Tittmann:
Bonferroni-type inequalities and binomially bounded functions. Discret. Math. 310(6-7): 1265-1268 (2010) - 2007
- [j19]Klaus Dohmen, Peter Tittmann:
Improved Bonferroni Inequalities and Binomially Bounded Functions. Electron. Notes Discret. Math. 28: 91-93 (2007) - 2004
- [j18]Klaus Dohmen, Peter Tittmann:
Bonferroni-Galambos Inequalities for Partition Lattices. Electron. J. Comb. 11(1) (2004) - 2003
- [j17]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) - 2002
- [j16]Klaus Dohmen:
A Note on Zeilberger's Abstract Lace Expansion. Adv. Appl. Math. 28(2): 272-277 (2002) - [j15]Klaus Dohmen:
Kernel operators and improved inclusion-exclusion bounds. Australas. J Comb. 26: 219-224 (2002) - [j14]Klaus Dohmen:
Improved Inclusion-Exclusion for Valuations on Distributive Lattices. Ars Comb. 64: 225- (2002) - [j13]Klaus Dohmen:
Bonferroni-Type Inequalities Via Chordal Graphs. Comb. Probab. Comput. 11(4): 349-351 (2002) - [j12]Klaus Dohmen:
Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Reliability Applications. SIAM J. Discret. Math. 16(1): 156-171 (2002) - 2001
- [j11]Klaus Dohmen:
A New Perspective on the Union-Closed Sets Conjecture. Ars Comb. 58 (2001) - [j10]Klaus Dohmen:
A combinatorial approach to improved Bonferroni inequalities. Ars Comb. 59 (2001) - [j9]Klaus Dohmen:
A Note on Narushima's Principle of Inclusion-Exclusion on Partition Lattices. Graphs Comb. 17(4): 607-610 (2001) - 2000
- [j8]Klaus Dohmen:
Improved inclusion-exclusion identities via closure operators. Discret. Math. Theor. Comput. Sci. 4(1): 61-66 (2000) - [j7]Klaus Dohmen:
On the Number of Precolouring Extensions. Eur. J. Comb. 21(8): 989-992 (2000) - [j6]Klaus Dohmen:
Improved Bonferroni Inequalities via Union-Closed Set Systems. J. Comb. Theory, Ser. A 92(1): 61-67 (2000) - 1999
- [j5]Klaus Dohmen:
On Partial Sums of Chromatic Polynomials. Ars Comb. 52 (1999) - [j4]Klaus Dohmen:
On Sums Over Partially Ordered Sets. Electron. J. Comb. 6 (1999) - 1998
- [j3]Klaus Dohmen:
Inclusion-Exclusion and Network Reliability. Electron. J. Comb. 5 (1998) - 1996
- [j2]Klaus Dohmen:
On graph invariants satisfying the deletion-contraction formula. J. Graph Theory 21(3): 311-316 (1996) - 1993
- [j1]Klaus Dohmen:
Lower bounds and upper bounds for chromatic polynomials. J. Graph Theory 17(1): 75-80 (1993)
Informal and Other Publications
- 2014
- [i2]Klaus Dohmen, Martin Trinks:
An Abstraction of Whitney's Broken Circuit Theorem. CoRR abs/1404.5480 (2014) - 2011
- [i1]Klaus Dohmen, Peter Tittmann:
Domination Reliability. CoRR abs/1103.3854 (2011)
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-25 02:29 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:
