Johann Hagauer

13 papers A 1B 2Journal 10
YearRankTypeTitle / Venue / Authors
1999 J jnl
Recognizing Median Graphs in Subquadratic Time.
Theor. Comput. Sci.
Johann Hagauer, Wilfried Imrich, Sandi Klavzar
1997 J jnl
Three-clustering of Points in the Plane.
Comput. Geom.
Johann Hagauer, Günter Rote
1996 J jnl
Clique-gated graphs.
Discret. Math.
Johann Hagauer, Sandi Klavzar
1996 J jnl
On independence numbers of the cartesian product of graphs.
Ars Comb.
Johann Hagauer, Sandi Klavzar
1995 J jnl
Recognizing Binary Hamming Graphs in O(n² log n) Time.
Math. Syst. Theory
Franz Aurenhammer, Johann Hagauer
1995 J jnl
Skeletons, recognition algorithm and distance matrix of quasi-median graphs.
Int. J. Comput. Math.
Johann Hagauer
1993 A conf
Three-Clustering of Points in the Plane.
ESA
Johann Hagauer, Günter Rote
1992 J jnl
Cartesian Graph Factorization at Logarithmic Cost per Edge.
Comput. Complex.
Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
1992 J jnl
Computing equivalence classes among the edges of a graph with applications.
Discret. Math.
Franz Aurenhammer, Johann Hagauer
1990 B conf
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.
IPCO
Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
1990 B conf
Recognizing Binary Hamming Graphs in O(n² log n) Time.
WG
Franz Aurenhammer, Johann Hagauer
1983 J jnl
It is Decidable Whether a Regular Language is Pure Context-Free.
Theor. Comput. Sci.
Walter Bucher, Johann Hagauer
1982 J jnl
On Form-Equivalence of Deterministic pure Grammar Forms.
Theor. Comput. Sci.
Johann Hagauer