Daniel Gonçalves 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 Lucas Isenmann

> Home > Persons > Daniel Gonçalves 0001

Publications

2020
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/ejc/GoncalvesI20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/GoncalvesI20
Daniel Gonçalves, Lucas Isenmann:
Dushnik-Miller dimension of TD-Delaunay complexes. Eur. J. Comb. 88: 103110 (2020)
2018
[c11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/soda/GoncalvesIP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GoncalvesIP18
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun:
Planar Graphs as L-intersection or L-contact graphs. SODA 2018: 172-184
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1803-09576
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1803-09576
Daniel Gonçalves, Lucas Isenmann:
Dushnik-Miller dimension of TD-Delaunay complexes. CoRR abs/1803.09576 (2018)
2017
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GoncalvesIP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GoncalvesIP17
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun:
Planar graphs as L-intersection or L-contact graphs. CoRR abs/1707.08833 (2017)

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.