| Publication | Date of Publication | Type |
|---|
| Efficient sampling from the PKBD distribution | 2024-01-05 | Paper |
| watson | 2023-06-01 | Software |
| Continuous random variate generation by fast numerical inversion | 2018-06-12 | Paper |
| Inverse transformed density rejection for unbounded monotone densities | 2018-06-12 | Paper |
| Random variate generation by numerical inversion when only the density is known | 2018-04-16 | Paper |
| Generating generalized inverse Gaussian random variates | 2015-11-12 | Paper |
| Transformed density rejection with inflection points | 2015-10-16 | Paper |
| Convex cycle bases | 2014-10-02 | Paper |
| Dendrimers are the unique chemical trees with maximum spectral radius | 2013-10-30 | Paper |
| Generating generalized inverse Gaussian random variates by fast inversion | 2012-09-15 | Paper |
| Graphs of given order and size and minimum algebraic connectivity | 2012-04-19 | Paper |
| BETTER CONFIDENCE INTERVALS FOR IMPORTANCE SAMPLING | 2011-01-20 | Paper |
| A note on quasi-robust cycle bases | 2010-04-15 | Paper |
| Semiregular trees with minimal Laplacian spectral radius | 2010-04-06 | Paper |
| Efficient Numerical Inversion for Financial Simulations | 2010-02-15 | Paper |
| Efficient risk simulations for linear asset portfolios in the \(t\)-copula model | 2009-11-27 | Paper |
| Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences | 2009-09-07 | Paper |
| Semiregular Trees with Minimal Index | 2009-06-08 | Paper |
| Graphs with given degree sequence and maximal spectral radius | 2009-04-07 | Paper |
| Algebraic connectivity and degree sequences of trees | 2008-12-12 | Paper |
| An error in the Kinderman-Ramage method and how to fix it | 2008-11-26 | Paper |
| Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems | 2007-08-16 | Paper |
| Faber-Krahn type inequalities for trees | 2007-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5469422 | 2006-05-18 | Paper |
| Minimum path bases and relevant paths | 2006-01-23 | Paper |
| A simple universal generator for continuous and discrete univariate T-concave distributions | 2005-07-20 | Paper |
| Smoothed Transformed Density Rejection * | 2005-03-10 | Paper |
| Graph Laplacians, nodal domains, and hyperplane arrangements | 2004-11-18 | Paper |
| Circuit bases of strongly connected digraphs | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4435446 | 2003-11-11 | Paper |
| Automatic sampling with the ratio-of-uniforms method | 2003-06-25 | Paper |
| An automatic code generator for nonuniform random variate generation | 2003-05-19 | Paper |
| Short universal generators via generalized ratio-of-uniforms method | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549513 | 2002-10-08 | Paper |
| Discrete nodal domain theorems | 2002-08-07 | Paper |
| The geometry of regular trees with the Faber-Krahn property | 2002-05-15 | Paper |
| A note on transformed density rejection | 2001-11-29 | Paper |
| A rejection technique for sampling from log-concave multivariate distributions | 2000-10-29 | Paper |
| Interchangeability of relevant cycles in graphs | 2000-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934384 | 2000-01-17 | Paper |
| A sweep-plane algorithm for generating random tuples in simple polytopes | 1998-09-10 | Paper |
| A Faber-Krahn-type inequality for regular trees | 1998-07-27 | Paper |
| Minimal cycle bases of outerplanar graphs | 1998-04-01 | Paper |
| On the number of nodal domains of spherical harmonics | 1996-05-14 | Paper |
