Search the dblp DataBase
Johann Hagauer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Johann Hagauer, Günter Rote
Three-Clustering of Points in the Plane. [Citation Graph (0, 0)][DBLP]
ESA, 1993, pp:192-199 [Conf] - Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. [Citation Graph (0, 0)][DBLP]
IPCO, 1990, pp:29-44 [Conf] - Franz Aurenhammer, Johann Hagauer
Recognizing Binary Hamming Graphs in O(n² log n) Time. [Citation Graph (0, 0)][DBLP]
WG, 1990, pp:90-98 [Conf] - Johann Hagauer, Sandi Klavzar
On independence numbers of the cartesian product of graphs. [Citation Graph (0, 0)][DBLP]
Ars Comb., 1996, v:43, n:, pp:- [Journal] - Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
Cartesian Graph Factorization at Logarithmic Cost per Edge. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 1992, v:2, n:, pp:331-349 [Journal] - Johann Hagauer, Günter Rote
Three-clustering of Points in the Plane. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1997, v:8, n:, pp:87-95 [Journal] - Franz Aurenhammer, Johann Hagauer
Recognizing Binary Hamming Graphs in O(n² log n) Time. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1995, v:28, n:5, pp:387-395 [Journal] - Walter Bucher, Johann Hagauer
It is Decidable Whether a Regular Language is Pure Context-Free. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1983, v:26, n:, pp:233-241 [Journal] - Johann Hagauer
On Form-Equivalence of Deterministic pure Grammar Forms. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:18, n:, pp:69-87 [Journal] - Johann Hagauer, Wilfried Imrich, Sandi Klavzar
Recognizing Median Graphs in Subquadratic Time. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1999, v:215, n:1-2, pp:123-136 [Journal] - Johann Hagauer, Sandi Klavzar
Clique-gated graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1996, v:161, n:1-3, pp:143-149 [Journal] - Franz Aurenhammer, Johann Hagauer
Computing equivalence classes among the edges of a graph with applications. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1992, v:109, n:1-3, pp:3-12 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002