Nen-Fu Huang

MaRDI QIDQ209292zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the complexity of two circle strongly connecting problems IEEE Transactions on Computers	2018-09-14	Paper
Intelligent handoff for mobile wireless internet Mobile Networks & Applications	2003-02-17	Paper
scientific article; zbMATH DE number 1787333 (Why is no real title available?)	2002-10-24	Paper
The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule Information Sciences	2002-03-18	Paper
On the complexity of two circle connecting problems Discrete Applied Mathematics	1994-11-29	Paper
A sweepline algorithm to solve the two-center problem Information Processing Letters	1994-04-05	Paper
Complexity of the repeaters allocating problem Information Processing Letters	1992-06-28	Paper
A divide-and-conquer algorithm for constructing relative neighborhood graph BIT	1990-01-01	Paper
An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs Information Processing Letters	1990-01-01	Paper
On the complexity of some arborescences finding problems on a multishop radio network BIT	1989-01-01	Paper

Research outcomes over time

This page was built for person: Nen-Fu Huang