Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Oswin Aichholzer

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 Kolja B. Knauer

> Home > Persons > Oswin Aichholzer

Publications

2021
[j99]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AichholzerCHKMS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AichholzerCHKMS21
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. Algorithmica 83(1): 116-143 (2021)
2019
[c69]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/AichholzerCHKMS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/AichholzerCHKMS19
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. WG 2019: 120-134
[i39]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1902-06103
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-06103
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip distances between graph orientations. CoRR abs/1902.06103 (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.