Wouter Beek

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 Stanislav Ronzhin

> Home > Persons > Wouter Beek

Publications

2020
[j10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/FolmerRHBL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/FolmerRHBL20
Erwin Folmer, Stanislav Ronzhin, Jos van Hillegersberg, Wouter Beek, Rob Lemmens:
Business Rationale for Linked Data at Governments: A Case Study at the Netherlands' Kadaster Data Platform. IEEE Access 8: 70822-70835 (2020)
2019
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/information/RonzhinFMBBLV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/information/RonzhinFMBBLV19
Stanislav Ronzhin, Erwin Folmer, Pano Maria, Marco Brattinga, Wouter Beek, Rob Lemmens, Rein van 't Veer:
Kadaster Knowledge Graph: Beyond the Fifth Star of Open Data. Inf. 10(10): 310 (2019)
[c33]
- view
  - electronic edition via handle.net (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/hicss/FolmerBRRGH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hicss/FolmerBRRGH19
Erwin Folmer, Wouter Beek, Laurens Rietveld, Stanislav Ronzhin, Rutger Geerling, Davey den Haan:
Enhancing the Usefulness of Open Governmental Data with Linked Data Viewing Techniques. HICSS 2019: 1-10

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.