On Form-Equivalence of Deterministic pure Grammar Forms. - Johann Hagauer (Theor. Comput. Sci., 1982)

It is Decidable Whether a Regular Language is Pure Context-Free. - Walter Bucher; Johann Hagauer (Theor. Comput. Sci., 1983)

Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. - Franz Aurenhammer; Johann Hagauer; Wilfried Imrich (IPCO, 1990)

Cartesian Graph Factorization at Logarithmic Cost per Edge. - Franz Aurenhammer; Johann Hagauer; Wilfried Imrich (Comput. Complex., 1992)

Computing equivalence classes among the edges of a graph with applications. - Franz Aurenhammer; Johann Hagauer (Discret. Math., 1992)

Skeletons, recognition algorithm and distance matrix of quasi-median graphs. - Johann Hagauer (Int. J. Comput. Math., 1995)

Recognizing Binary Hamming Graphs in O(n² log n) Time. - Franz Aurenhammer; Johann Hagauer (Math. Syst. Theory, 1995)

On independence numbers of the cartesian product of graphs. - Johann Hagauer; Sandi Klavzar (Ars Comb., 1996)

Clique-gated graphs. - Johann Hagauer; Sandi Klavzar (Discret. Math., 1996)

Three-clustering of Points in the Plane. - Johann Hagauer; Günter Rote (Comput. Geom., 1997)

Recognizing Median Graphs in Subquadratic Time. - Johann Hagauer; Wilfried Imrich; Sandi Klavzar (Theor. Comput. Sci., 1999)