UNIX in der kommerziellen Datenverarbeitung. - Wolfgang Haas; Reinhard Mohn (it Inf. Technol., 1987)

Lower bounds for q-ary codes of covering radius one. - Wolfgang Haas (Discret. Math., 2000)

Binary and ternary codes of covering radius one: some new lower bounds. - Wolfgang Haas (Discret. Math., 2002)

Lower Bounds for the Football Pool Problem for 7 and 8 Matches. - Wolfgang Haas (Electron. J. Comb., 2007)

On Mixed Codes with Covering Radius 1 and Minimum Distance 2. - Wolfgang Haas; Jörn Quistorff (Electron. J. Comb., 2007)

On the general excess bound for binary codes with covering radius one. - Wolfgang Haas (Electron. Notes Discret. Math., 2007)

On mixed codes with covering radius 1 and minimum distance 2: (extended abstract). - Wolfgang Haas; Jörn Quistorff (Electron. Notes Discret. Math., 2007)

Lower Bounds for Binary Codes of Covering Radius One. - Wolfgang Haas (IEEE Trans. Inf. Theory, 2007)

On the Failing Cases of the Johnson Bound for Error-Correcting Codes. - Wolfgang Haas (Electron. J. Comb., 2008)

Lower Bounds for q-ary Codes with Large Covering Radius. - Wolfgang Haas; Immanuel Halupczok; Jan-Christoph Schlage-Puchta (Electron. J. Comb., 2009)

Lower bounds on covering codes via partition matrices. - Wolfgang Haas; Jan-Christoph Schlage-Puchta; Jörn Quistorff (J. Comb. Theory A, 2009)

Lower bounds for quaternary covering codes. - Wolfgang Haas (Ars Comb., 2011)

Continuous Planning and Forecasting Framework (CPFF) for Agile Project Management: Overcoming the. - Thomas Dilger; Christian Ploder; Wolfgang Haas; Pascal Schöttle; Reinhard Bernsteiner (SIGITE, 2020)