Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Johannes Keizer

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Irene Onyancha

> Home > Persons > Johannes Keizer

Publications

2008
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/oir/SubiratsOSKAK08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/oir/SubiratsOSKAK08
Imma Subirats, Irene Onyancha, Gauri Salokhe, Stefka Kaloyanova, Stefano Anibaldi, Johannes Keizer:
Towards an architecture for open archive networks in agricultural sciences and technology. Online Inf. Rev. 32(4): 478-487 (2008)
2004
[c5]
- view
  - electronic edition @ dublincore.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dc/OnyanchaWSKK04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dc/OnyanchaWSKK04
Irene Onyancha, James Weinheimer, Gauri Salokhe, Stephen Katz, Johannes Keizer:
Metadata Exchange without pain: the AGRIS AP to harvest and exchange quality metadata. Dublin Core Conference 2004
2001
[c1]
- view
  - electronic edition @ dublincore.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dc/OnyanchaKK01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dc/OnyanchaKK01
Irene Onyancha, Johannes Keizer, Stephen Katz:
A Dublin Core Application Profile in the Agricultural Domain. Dublin Core Conference 2001: 185-192

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.