Nen-Fu Huang

Available identifiers

zbMath Open huang.nenfuMaRDI QIDQ209292

List of research outcomes

Publication	Date of Publication	Type
On the complexity of two circle strongly connecting problems	2018-09-14	Paper
Intelligent handoff for mobile wireless internet	2003-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q4550355	2002-10-24	Paper
The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule	2002-03-18	Paper
On the complexity of two circle connecting problems	1994-11-29	Paper
A sweepline algorithm to solve the two-center problem	1994-04-05	Paper
Complexity of the repeaters allocating problem	1992-06-28	Paper
A divide-and-conquer algorithm for constructing relative neighborhood graph	1990-01-01	Paper
An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs	1990-01-01	Paper
On the complexity of some arborescences finding problems on a multishop radio network	1989-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nen-Fu Huang