default search action

combined dblp search
author search
venue search
publication search

ask others

Tung-Hsin Su

> Home > Persons

Person information

SPARQL queries

run query for this person

or build your own?

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

1990 – 1999

see FAQ

What is the meaning of the colors in the publication lists?

1991
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/computing/SuC91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/SuC91
Tung-Hsin Su, Ruei-Chuan Chang:
On constructing the relative neighborhood graphs in EuclideanK-dimensional spaces. Computing 46(2): 121-130 (1991)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/pr/SuC91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pr/SuC91
Tung-Hsin Su, Ruei-Chuan Chang:
Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean plane. Pattern Recognit. 24(3): 221-230 (1991)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/pr/SuC91a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pr/SuC91a
Tung-Hsin Su, Ruei-Chuan Chang:
Computing the k-relative neighborhood graphs in Euclidean plane. Pattern Recognit. 24(3): 231-239 (1991)
1990
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/sigal/SuC90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigal/SuC90
Tung-Hsin Su, Ruei-Chuan Chang:
The K-Gabriel Graphs and Their Applications. SIGAL International Symposium on Algorithms 1990: 66-75

Coauthor Index

see FAQ

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.