Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Johann Hagauer" ( http://dblp.L3S.de/Authors/Johann_Hagauer )

URL (Homepage):  http://much.iicm.edu:88/much/people/by_name/h/hagauer_johann/index.htm/  Author page on DBLP  Author page in RDF  Community of Johann Hagauer in ASPL-2

Publication years (Num. hits)
1982-1999 (12)
Publication types (Num. hits)
article(9) inproceedings(3)
Venues (Conferences, Journals, ...)
Theor. Comput. Sci.(3) Discrete Mathematics(2) Ars Comb.(1) Comput. Geom.(1) Computational Complexity(1) ESA(1) IPCO(1) Mathematical Systems Theory(1) WG(1)
Authors
Johann Hagauer(12) Franz Aurenhammer(5) Sandi Klavzar(3) Wilfried Imrich(3) Günter Rote(2) Walter Bucher(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Johann Hagauer, Wilfried Imrich, Sandi Klavzar Recognizing Median Graphs in Subquadratic Time. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Johann Hagauer, Günter Rote Three-clustering of Points in the Plane. Search on Bibsonomy Comput. Geom. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Johann Hagauer, Sandi Klavzar Clique-gated graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Johann Hagauer, Sandi Klavzar On independence numbers of the cartesian product of graphs. Search on Bibsonomy Ars Comb. The full citation details ... 1996 DBLP  BibTeX  RDF
1Franz Aurenhammer, Johann Hagauer Recognizing Binary Hamming Graphs in O(n² log n) Time. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Johann Hagauer, Günter Rote Three-Clustering of Points in the Plane. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Franz Aurenhammer, Johann Hagauer Computing equivalence classes among the edges of a graph with applications. Search on Bibsonomy Discrete Mathematics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Franz Aurenhammer, Johann Hagauer, Wilfried Imrich Cartesian Graph Factorization at Logarithmic Cost per Edge. Search on Bibsonomy Computational Complexity The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Franz Aurenhammer, Johann Hagauer Recognizing Binary Hamming Graphs in O(n² log n) Time. Search on Bibsonomy WG The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Franz Aurenhammer, Johann Hagauer, Wilfried Imrich Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. Search on Bibsonomy IPCO The full citation details ... 1990 DBLP  BibTeX  RDF
1Walter Bucher, Johann Hagauer It is Decidable Whether a Regular Language is Pure Context-Free. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Johann Hagauer On Form-Equivalence of Deterministic pure Grammar Forms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.