Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Jan H. M. Korst

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 Ramon Clout

> Home > Persons > Jan H. M. Korst

Publications

2012
[c28]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/iir/MustoNLSGBKPC12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iir/MustoNLSGBKPC12
Cataldo Musto, Fedelucio Narducci, Pasquale Lops, Giovanni Semeraro, Marco de Gemmis, Mauro Barbieri, Jan H. M. Korst, Verus Pronk, Ramon Clout:
TV-Show Retrieval and Classification. IIR 2012: 179-182
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/um/MustoNLSGBKPC12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/um/MustoNLSGBKPC12
Cataldo Musto, Fedelucio Narducci, Pasquale Lops, Giovanni Semeraro, Marco de Gemmis, Mauro Barbieri, Jan H. M. Korst, Verus Pronk, Ramon Clout:
Enhanced Semantic TV-Show Representation for Personalized Electronic Program Guides. UMAP 2012: 188-199
2009
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/compgeom/JovanoviuKCPT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/JovanoviuKCPT09
Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen:
Candle in the woods: asymptotic bounds on minimum blocking sets. SCG 2009: 148-152

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.