Mira Lee

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 Herman J. Haverkort

> Home > Persons > Mira Lee

Publications

2008
[j3]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/comgeo/CheongHL08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/CheongHL08
Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008)
2007
[c2]
- view
  - electronic edition @ westernsydney.edu.au (open access)
  - details & citations
- export record
  dblp key:
  - conf/cats/CheongHL07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cats/CheongHL07
Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0703023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0703023
Otfried Cheong, Herman J. Haverkort, Mira Lee:
Computing a Minimum-Dilation Spanning Tree is NP-hard. CoRR abs/cs/0703023 (2007)

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.