| Publication | Date of Publication | Type |
|---|
On the activities and partitions of the vertex subsets of graphs
Enumerative Combinatorics and Applications | 2023-06-09 | Paper |
Edge Contraction and Line Graphs
| 2022-12-17 | Paper |
Edge Contraction and Forbidden Induced Graphs
| 2022-03-07 | Paper |
Graph operations and neighborhood polynomials
Discussiones Mathematicae Graph Theory | 2021-03-11 | Paper |
Introduction to combinatorics
| 2019-05-10 | Paper |
Neighborhood and domination polynomials of graphs
Graphs and Combinatorics | 2019-01-11 | Paper |
A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
Networks | 2018-04-27 | Paper |
Domination polynomials of graph products
| 2017-08-16 | Paper |
Rainbow partitions and rainbow polynomial
| 2017-04-04 | Paper |
The Bipartition Polynomial of a Graph: Reconstruction, Decomposition, and Applications
| 2017-02-12 | Paper |
Counting Dominating Sets of Graphs
| 2017-01-12 | Paper |
Bipartition polynomials, the Ising model, and domination in graphs
Discussiones Mathematicae Graph Theory | 2015-05-11 | Paper |
Einführung in die Kombinatorik
| 2014-10-09 | Paper |
Subset-sum representations of domination polynomials
Graphs and Combinatorics | 2014-06-16 | Paper |
Recurrence relations and splitting formulas for the domination polynomial
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Domination reliability
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Reliability and Maintenance
| 2011-12-02 | Paper |
Counting connected set partitions of graphs
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
Random Information Spread in Networks
| 2010-08-12 | Paper |
Bonferroni-type inequalities and binomially bounded functions
Discrete Mathematics | 2010-04-27 | Paper |
A graph polynomial arising from community structure (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Improved Bonferroni Inequalities and Binomially Bounded Functions
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Bonferroni-Galambos inequalities for partition lattices
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
scientific article; zbMATH DE number 2107574 (Why is no real title available?)
| 2004-10-13 | Paper |
scientific article; zbMATH DE number 2038883 (Why is no real title available?)
| 2004-02-08 | Paper |
Introduction to combinatorics
| 2002-02-05 | Paper |
Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
The Electronic Journal of Combinatorics | 2000-05-11 | Paper |
Partitions and network reliability
Discrete Applied Mathematics | 1999-09-22 | Paper |
scientific article; zbMATH DE number 1218897 (Why is no real title available?)
| 1998-11-03 | Paper |
IEEE Trans. Reliab.,
Communications in Statistics. Stochastic Models | 1992-09-27 | Paper |
Eine Zerlegungsformel für die Zuverlässigkeit komplizierter technischer Systeme/ A decomposition formula for determining the reliability of complex technical systems
at - Automatisierungstechnik | 1992-09-26 | Paper |
scientific article; zbMATH DE number 21369 (Why is no real title available?)
| 1992-06-26 | Paper |
A generalized reduction method for the connectedness probability of stochastic networks
IEEE Transactions on Reliability | 1992-06-26 | Paper |
A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks
Optimization | 1990-01-01 | Paper |
