Artikel

• How Mathematics Keeps Our Data Safe: The RSA Cryptosystem for Regular Numbers.  NextGen Scientific Review. Annual Perspectives on Next Generation Science. 44-48. 2026

ePaper

Journalartikel

• Privacy-preserving nearest prototype classifier.  Neurocomputing. 132673. 2026
• An Abstraction of Whitney's Broken Circuit Theorem.  The Electronic Journal of Combinatorics. P4.32. 2014
• Lower bounds for the probability of a union via chordal graphs.  Electronic Communications in Probability. 2013
• Domination Reliability.  The Electronic Journal of Combinatorics. P15. 2012
• An inductive proof of Whitney's Broken Circuit Theorem.  Discussiones Mathematicae Graph Theory. 509. 2011
• Improved Bonferroni Inequalities and Binomially Bounded Functions.  Discrete Applied Mathematics. 2010
• Bonferroni-type inequalities and binomially bounded functions.  Discrete Mathematics. 1265-1268. 2010
• Improved Bonferroni Inequalities and Binomially Bounded Functions.  Electronic Notes in Discrete Mathematics. 91-93. 2007
• Bonferroni-Galambos Inequalities for Partition Lattices.  The Electronic Journal of Combinatorics. R85. 2004
• A new two-variable generalization of the chromatic polynomial.  Discrete Mathematics & Theoretical Computer Science. 335. 2003
• Improved Bonferroni Inequalities via Abstract Tubes 2003
• A Note on Zeilberger's Abstract Lace Expansion.  Advances in Applied Mathematics. 272-277. 2002
• Bonferroni-Type Inequalities via Chordal Graphs.  Combinatorics, Probability and Computing. 349-351. 2002
• Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Reliability Applications.  SIAM Journal on Discrete Mathematics. 156-171. 2002
• A Note on Narushima's Principle of Inclusion–Exclusion on Partition Lattices.  Graphs and Combinatorics. 607-610. 2001
• Improved Bonferroni Inequalities via Union-Closed Set Systems.  Journal of Combinatorial Theory, Series A. 61-67. 2000
• Improved inclusion-exclusion identities via closure operators.  Discrete Mathematics & Theoretical Computer Science. 275. 2000
• Inclusion-exclusion: Which terms cancel?.  Archiv der Mathematik. 314-316. 2000
• On the Number of Precolouring Extensions.  European Journal of Combinatorics. 989-992. 2000
• Some remarks on the sieve formula, the Tutte polynomial and Crapo's beta invariant.  Aequationes mathematicae. 108-115. 2000
• An Upper Bound to the Chromatic Number of a Uniform Hypergraph without Cycles of Length Two or Three.  Results in Mathematics. 55-56. 1999
• An improvement of the inclusion-exclusion principle.  Archiv der Mathematik. 298-303. 1999
• Improved Inclusion-Exclusion Identities and Inequalities Based on a Particular Class of Abstract Tubes.  Electronic Journal of Probability. 1999
• On Sums Over Partially Ordered Sets.  The Electronic Journal of Combinatorics. R34. 1999
• Bounds to the Chromatic Polynomial of a Graph.  Results in Mathematics. 87-88. 1998
• Inclusion-Exclusion and Network Reliability.  The Electronic Journal of Combinatorics. R36. 1998
• A Broken-Circuits-Theorem for hypergraphs.  Archiv der Mathematik. 159-162. 1995
• A Contribution to The Chromatic Theory of Uniform Hypergraphs.  Results in Mathematics. 49-52. 1995
• Lower bounds and upper bounds for chromatic polynomials.  Journal of Graph Theory. 75-80. 1993

Konferenzpaper

• Learning of Probability Estimates for System and Network Reliability Analysis by Means of Matrix Learning Vector Quantization.  ESANN 2025 proceedings, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. 11-16. 2025
• Towards Learning Vector Quantization in the Setting of Homomorphic Encryption.  ESANN 2025 proceedings, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. 407-412. 2025

Monographie

• Improved Inclusion-Exclusion Identities and Bonferroni Inequalities with Applications to Reliability Analysis of Coherent Systems