Johann Hagauer

According to our database, Johann Hagauer authored at least 11 papers between 1982 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1999

Recognizing Median Graphs in Subquadratic Time.

Johann Hagauer, Wilfried Imrich, Sandi Klavzar

Theor. Comput. Sci., 1999

1997

Three-clustering of Points in the Plane.

Johann Hagauer, Günter Rote

Comput. Geom., 1997

1996

Clique-gated graphs.

Johann Hagauer, Sandi Klavzar

Discret. Math., 1996

On independence numbers of the cartesian product of graphs.

Johann Hagauer, Sandi Klavzar

Ars Comb., 1996

1995

Recognizing Binary Hamming Graphs in O(n² log n) Time.

Franz Aurenhammer, Johann Hagauer

Math. Syst. Theory, 1995

Skeletons, recognition algorithm and distance matrix of quasi-median graphs.

Johann Hagauer

Int. J. Comput. Math., 1995

1992

Computing equivalence classes among the edges of a graph with applications.

Franz Aurenhammer, Johann Hagauer

Discret. Math., 1992

Cartesian Graph Factorization at Logarithmic Cost per Edge.

Franz Aurenhammer, Johann Hagauer, Wilfried Imrich

Comput. Complex., 1992

1990

Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.

Franz Aurenhammer, Johann Hagauer, Wilfried Imrich

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1983

It is Decidable Whether a Regular Language is Pure Context-Free.

Walter Bucher, Johann Hagauer

Theor. Comput. Sci., 1983

1982

On Form-Equivalence of Deterministic pure Grammar Forms.

Johann Hagauer

Theor. Comput. Sci., 1982