Publications
| [1] | K. Dohmen. On the number of regular elements in Zn, 2023. [ arXiv ] |
| [2] | K. Dohmen. The orbital chromatic polynomial of a cycle, 2020. [ arXiv ] |
| [3] | K. Dohmen. Closed-form expansions for the universal edge elimination polynomial. Australas. J. Combin., 63(2):196–201, 2015. [ pdf ] |
| [4] | K. Dohmen and M. Trinks. An abstraction of Whitney's broken circuit theorem. Electron. J. Combin., 21:#P4.32, 2014. [ DOI ] |
| [5] | K. Dohmen. Lower bounds for the probability of a union via chordal graphs. Electron. Commun. Probab., 18(70):1–4, 2013. [ DOI ] |
| [6] | K. Dohmen and P. Tittmann. Domination reliability. Electron. J. Combin., 19:#P15, 2012. [ DOI ] |
| [7] | K. Dohmen. An inductive proof of Whitney's broken circuit theorem. Discuss. Math. Graph Theory, 31(3):509–517, 2011. [ DOI ] |
| [8] | K. Dohmen and P. Tittmann. Bonferroni-type inequalities and binomially bounded functions. Discrete Math., 310(6/7):1265–1268, 2010. [ DOI ] |
| [9] | K. Dohmen. Dual-screen presentations with the LATEX beamer class under X. PracTEX J., 5(1), 2010. [ abstract | pdf ] |
| [10] | K. Dohmen and P. Tittmann. Improved Bonferroni inequalities and binomially bounded functions. Electron. Notes Discrete Math., 28:91–93, 2007. [ DOI ] |
| [11] | K. Dohmen and P. Tittmann. Inequalities of Bonferroni-Galambos type with applications to the Tutte polynomial and the chromatic polynomial. JIPAM, J. Inequal. Pure Appl. Math., 5(3):Article No. 64, 2004. [ pdf ] |
| [12] | K. Dohmen and P. Tittmann. Bonferroni-Galambos inequalities for partition lattices. Electron. J. Combin., 11(1):#R85, 2004. [ DOI ] |
| [13] | K. Dohmen, A. Pönitz, and P. Tittmann. A new two-variable generalization of the chromatic polynomial. Discrete Math. Theor. Comput. Sci., 6(1):69–90, 2003. [ DOI | examples ] |
| [14] | K. Dohmen. Improved inclusion-exclusion identities and Bonferroni inequalities with reliability applications. SIAM J. Discrete Math., 16(1):156–171, 2003. [ DOI ] |
| [15] | K. Dohmen. Improved Bonferroni Inequalities via Abstract Tubes, volume 1826 of Lecture Notes in Mathematics. Springer-Verlag, 2003. [ DOI ] |
| [16] | K. Dohmen. On dependent families of sets. Util. Math., 61:125–128, 2002. |
| [17] | K. Dohmen. Kernel operators and improved inclusion-exclusion bounds. Australas. J. Combin., 26:219–224, 2002. [ pdf ] |
| [18] | K. Dohmen. Improved inclusion-exclusion for valuations on distributive lattices. Ars Combin., 64:225–230, 2002. |
| [19] | K. Dohmen. Bonferroni-type inequalities via chordal graphs. Comb. Probab. Comput., 11(4):349–351, 2002. [ DOI ] |
| [20] | K. Dohmen. A note on Zeilberger's abstract lace expansion. Adv. Appl. Math., 28(2):272–277, 2002. [ DOI ] |
| [21] | K. Dohmen. Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Applications to Reliability Analysis of Coherent Systems. Habilitationsschrift (Habilitation Thesis), Humboldt-Universität zu Berlin, Feb. 2001. [ DOI ] |
| [22] | K. Dohmen. A note on Narushima's principle of inclusion-exclusion on partition lattices. Graphs Combin., 17(4):607–610, 2001. [ DOI ] |
| [23] | K. Dohmen. A note on inclusion-exclusion on semilattices. Util. Math., 59:125–127, 2001. |
| [24] | K. Dohmen. A new perspective on the union-closed sets conjecture. Ars Combin., 58:183–185, 2001. |
| [25] | K. Dohmen. A combinatorial approach to improved Bonferroni inequalities. Ars Combin., 59:245–251, 2001. |
| [26] | K. Dohmen. Some remarks on the sieve formula, the Tutte polynomial and Crapo's beta invariant. Aequationes Math., 60(1):108–115, 2000. [ DOI ] |
| [27] | K. Dohmen. On the number of precolouring extensions. European J. Combin., 21(8):989–992, 2000. [ DOI ] |
| [28] | K. Dohmen. On closure operators and the sieve formula. Util. Math., 58:203–207, 2000. |
| [29] | K. Dohmen. Inclusion-exclusion: Which terms cancel? Arch. Math., 74(4):314–316, 2000. [ DOI ] |
| [30] | K. Dohmen. Improved inclusion-exclusion identities via closure operators. Discrete Math. Theor. Comput. Sci., 4(1):61–66, 2000. [ DOI ] |
| [31] | K. Dohmen. Improved Bonferroni inequalities via union-closed set systems. J. Combin. Theory Ser. A, 92(1):61–67, 2000. [ DOI ] |
| [32] |
K. Dohmen.
On sums over partially ordered sets.
Electron. J. Combin., 6:#R34, 1999.
[ DOI ]
Printed version: J. Combin . 6 (1999), 459–468 |
| [33] | K. Dohmen. On partial sums of chromatic polynomials. Ars Combin., 52:125–127, 1999. [ DOI ] |
| [34] | K. Dohmen. Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes. Electron. J. Probab., 4:Article No. 5, 1999. [ DOI ] |
| [35] | K. Dohmen. Improved Bonferroni bounds for the reliability of a communication network. In G. I. Schuëller and P. Kafka, editors, Safety and Reliability, volume 1, pages 67–71. Balkema Publishers, 1999. |
| [36] | K. Dohmen. Convex geometric inclusion-exclusion identities and Bonferroni inequalities with applications to system reliability analysis and reliability covering problems. Informatik-Bericht Nr. 132, Humboldt-Universität zu Berlin, 1999. [ pdf ] |
| [37] | K. Dohmen. An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three. Result. Math., 36(1):55–56, 1999. [ DOI ] |
| [38] | K. Dohmen. An improvement of the inclusion-exclusion principle. Arch. Math., 72(4):298–303, 1999. [ DOI ] |
| [39] | K. Dohmen. An improved inclusion-exclusion algorithm for counting Hamiltonian paths. Informatik-Bericht Nr. 125, Humboldt-Universität zu Berlin, 1999. [ pdf ] |
| [40] |
K. Dohmen.
Inclusion-exclusion and network reliability.
Electron. J. Combin., 5:#R36, 1998.
[ DOI ]
Printed version: J . Combin . 5 (1998), 537–544. |
| [41] | K. Dohmen. Improved Bonferroni inequalities for the reliability of a communication network. Informatik-Bericht Nr. 114, Humboldt-Universität zu Berlin, 1998. [ pdf ] |
| [42] | K. Dohmen. Bounds to the chromatic polynomial of a graph. Result. Math., 33(1/2):87–88, 1998. [ DOI ] |
| [43] | K. Dohmen. A note on Möbius inversion over power set lattices. Comment. Math. Univ. Carolin., 38(1):121–124, 1997. [ abstract | pdf ] |
| [44] | K. Dohmen. On graph invariants satisfying the deletion-contraction formula. J. Graph Theory, 21(3):311–316, 1996. [ DOI ] |
| [45] | K. Dohmen. A contribution to the chromatic theory of uniform hypergraphs. Result. Math., 28(1/2):49–52, 1995. [ DOI ] |
| [46] | K. Dohmen. A broken-circuits-theorem for hypergraphs. Arch. Math., 64(2):159–162, 1995. [ DOI ] |
| [47] | K. Dohmen. Chromatische Polynome von Graphen und Hypergraphen. Dissertation (PhD Thesis), Heinrich-Heine-Universität Düsseldorf, Nov. 1993. |
| [48] | K. Dohmen. Lower bounds and upper bounds for chromatic polynomials. J. Graph Theory, 17(1):75–80, 1993. [ DOI ] |
| [49] | K. Dohmen. Von Band zu Band. Chip, Nr. 5:169–170, 1985. |
This file was generated by bibtex2html 1.99.