Alexander Pilz

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 André van Renssen

> Home > Persons > Alexander Pilz

Publications

2019
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/comgeo/AichholzerHKPRR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/AichholzerHKPRR19
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André van Renssen, Marcel Roeloffzen, Günter Rote, Birgit Vogtenhuber:
Packing plane spanning graphs with short edges in complete geometric graphs. Comput. Geom. 82: 1-15 (2019)
2017
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AichholzerHKPRR17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AichholzerHKPRR17
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber:
Packing Short Plane Spanning Graphs in Complete Geometric Graphs. CoRR abs/1703.05863 (2017)
2016
[c14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/isaac/AichholzerHKPRR16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/AichholzerHKPRR16
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber:
Packing Short Plane Spanning Trees in Complete Geometric Graphs. ISAAC 2016: 9:1-9:12

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.