Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Wouter Meulemans

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 Jaakko Peltonen

> Home > Persons > Wouter Meulemans

Publications

2022
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tvcg/NickelSMKPN22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tvcg/NickelSMKPN22
Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Multicriteria Optimization for Dynamic Demers Cartograms. IEEE Trans. Vis. Comput. Graph. 28(6): 2376-2387 (2022)
2019
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/gd/NickelSMCKPN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/NickelSMCKPN19
Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. GD 2019: 46-60
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1908-07291
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1908-07291
Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. CoRR abs/1908.07291 (2019)

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.