Minimal Cycle Bases of Outerplanar Graphs. - Josef Leydold; Peter F. Stadler (Electron. J. Comb., 1998)

A sweep-plane algorithm for generating random tuples in simple polytopes. - Josef Leydold; Wolfgang Hörmann (Math. Comput., 1998)

A Rejection Technique for Sampling from log-Concave Multivariate Distributions. - Josef Leydold (ACM Trans. Model. Comput. Simul., 1998)

Random-number and random-variate generation: automatic random variate generation for simulation input. - Wolfgang Hörmann; Josef Leydold (WSC, 2000)

Interchangeability of Relevant Cycles in Graphs. - Petra M. Gleiss; Josef Leydold; Peter F. Stadler (Electron. J. Comb., 2000)

A Note on Transformed Density Rejection. - Josef Leydold (Computing, 2000)

Automatic sampling with the ratio-of-uniforms method. - Josef Leydold (ACM Trans. Math. Softw., 2000)

A simple universal generator for continuous and discrete univariate T-concave distributions. - Josef Leydold (ACM Trans. Math. Softw., 2001)

The geometry of regular trees with the Faber?Krahn property. - Josef Leydold (Discret. Math., 2002)

Circuit bases of strongly connected digraphs. - Petra M. Gleiss; Josef Leydold; Peter F. Stadler (Discuss. Math. Graph Theory, 2003)

An automatic code generator for nonuniform random variate generation. - Josef Leydold; Gerhard Derflinger; Günter Tirler; Wolfgang Hörmann (Math. Comput. Simul., 2003)

Short universal generators via generalized ratio-of-uniforms method. - Josef Leydold (Math. Comput., 2003)

Continuous random variate generation by fast numerical inversion. - Wolfgang Hörmann; Josef Leydold (ACM Trans. Model. Comput. Simul., 2003)

An error in the Kinderman-Ramage method and how to fix it. - Günter Tirler; Peter Dalgaard; Wolfgang Hörmann; Josef Leydold (Comput. Stat. Data Anal., 2004)

Counterexamples in Chemical Ring Perception. - Franziska Berger; Christoph Flamm; Petra M. Gleiss; Josef Leydold; Peter F. Stadler (J. Chem. Inf. Model., 2004)

Smoothed Transformed Density Rejection. - Josef Leydold; Wolfgang Hörmann (Monte Carlo Methods Appl., 2004)

Minimum path bases and relevant paths. - Petra M. Gleiss; Josef Leydold; Peter F. Stadler (Networks, 2005)

Black-box algorithms for sampling from continuous distributions. - Josef Leydold; Wolfgang Hörmann (WSC, 2006)

Faber-Krahn type inequalities for trees. - Türker Bíyíkoglu; Josef Leydold (J. Comb. Theory B, 2007)

Inverse transformed density rejection for unbounded monotone densities. - Wolfgang Hörmann; Josef Leydold; Gerhard Derflinger (ACM Trans. Model. Comput. Simul., 2007)

Better confidence intervals for importance sampling. - Halis Sak; Josef Leydold (WSC, 2008)

Graphs with Given Degree Sequence and Maximal Spectral Radius. - Türker Bíyíkoglu; Josef Leydold (Electron. J. Comb., 2008)

A note on quasi-robust cycle bases. - Philipp-Jens Ostermeier; Marc Hellmuth; Josef Leydold; Konstantin Klemm; Peter F. Stadler (Ars Math. Contemp., 2009)

Efficient risk simulations for linear asset portfolios in the t-copula model. - Halis Sak; Wolfgang Hörmann; Josef Leydold (Eur. J. Oper. Res., 2010)

Random variate generation by numerical inversion when only the density is known. - Gerhard Derflinger; Wolfgang Hörmann; Josef Leydold (ACM Trans. Model. Comput. Simul., 2010)

Generating generalized inverse Gaussian random variates by fast inversion. - Josef Leydold; Wolfgang Hörmann (Comput. Stat. Data Anal., 2011)

Transformed density rejection with inflection points. - Carsten H. Botts; Wolfgang Hörmann; Josef Leydold (Stat. Comput., 2013)

Convex cycle bases. - Marc Hellmuth; Josef Leydold; Peter F. Stadler (Ars Math. Contemp., 2014)

Generating generalized inverse Gaussian random variates. - Wolfgang Hörmann; Josef Leydold (Stat. Comput., 2014)