Martin Fink 0001

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 Antonios Symvonis

> Home > Persons > Martin Fink 0001

Publications

2015
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgaa/BekosCFH0NRS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/BekosCFH0NRS15
Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015)
2013
[c8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/gd/BekosCFHKNRS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/BekosCFHKNRS13
Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BekosCFHKNRS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BekosCFHKNRS13
Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. CoRR abs/1308.6801 (2013)

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.