On the Dimension of Partially Ordered Sets. - Oliver Pretzel (J. Comb. Theory A, 1977)

Another proof of dilworth's decomposition theorem. - Oliver Pretzel (Discret. Math., 1979)

A construction for partially ordered sets. - Oliver Pretzel (Discret. Math., 1980)

A non-covering graph of girth six. - Oliver Pretzel (Discret. Math., 1987)

Cycle Lengths and Graph Orientations. - Oliver Pretzel; Dale Youngs (SIAM J. Discret. Math., 1990)

Balanced graphs and noncovering graphs. - Oliver Pretzel; Dale Youngs (Discret. Math., 1991)

Partial geometric codes. - Oliver Pretzel (IEEE Trans. Inf. Theory, 1999)

Extended Classical Goppa Codes. - Oliver Pretzel (Appl. Algebra Eng. Commun. Comput., 2001)

Finding Recursions for Multidimensional Arrays. - Oliver Pretzel (Inf. Comput., 2002)

Characterization of simple edge-firing games. - Oliver Pretzel (Inf. Process. Lett., 2002)

On reorienting graphs by pushing down maximal vertices–II. - Oliver Pretzel (Discret. Math., 2003)

Reconstruction of Partitions. - Oliver Pretzel; Johannes Siemons (Electron. J. Comb., 2005)