 | 1999 |
|---|
| 12 |       | Johann Hagauer,
Wilfried Imrich,
Sandi Klavzar:
Recognizing Median Graphs in Subquadratic Time.
Theor. Comput. Sci. 215(1-2): 123-136 (1999) |
| 1997 |
|---|
| 11 | | Johann Hagauer,
Günter Rote:
Three-clustering of Points in the Plane.
Comput. Geom. 8: 87-95 (1997) |
| 1996 |
|---|
| 10 |  | Johann Hagauer,
Sandi Klavzar:
On independence numbers of the cartesian product of graphs.
Ars Comb. 43: (1996) |
| 9 | | Johann Hagauer,
Sandi Klavzar:
Clique-gated graphs.
Discrete Mathematics 161(1-3): 143-149 (1996) |
| 1995 |
|---|
| 8 | | Franz Aurenhammer,
Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time.
Mathematical Systems Theory 28(5): 387-395 (1995) |
| 1993 |
|---|
| 7 | | Johann Hagauer,
Günter Rote:
Three-Clustering of Points in the Plane.
ESA 1993: 192-199 |
| 1992 |
|---|
| 6 | | Franz Aurenhammer,
Johann Hagauer,
Wilfried Imrich:
Cartesian Graph Factorization at Logarithmic Cost per Edge.
Computational Complexity 2: 331-349 (1992) |
| 5 | | Franz Aurenhammer,
Johann Hagauer:
Computing equivalence classes among the edges of a graph with applications.
Discrete Mathematics 109(1-3): 3-12 (1992) |
| 1990 |
|---|
| 4 | | Franz Aurenhammer,
Johann Hagauer,
Wilfried Imrich:
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.
IPCO 1990: 29-44 |
| 3 | | Franz Aurenhammer,
Johann Hagauer:
Recognizing Binary Hamming Graphs in O(n² log n) Time.
WG 1990: 90-98 |
| 1983 |
|---|
| 2 | | Walter Bucher,
Johann Hagauer:
It is Decidable Whether a Regular Language is Pure Context-Free.
Theor. Comput. Sci. 26: 233-241 (1983) |
| 1982 |
|---|
| 1 | | Johann Hagauer:
On Form-Equivalence of Deterministic pure Grammar Forms.
Theor. Comput. Sci. 18: 69-87 (1982) |
Data released under the ODC-BY 1.0 license — See also our legal information page