# Fenghui Zhang

According to our database

Collaborative distances:

^{1}, Fenghui Zhang authored at least 32 papers between 2005 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

An Optimal Real-Time Distributed Algorithm for Utility Maximization of Mobile Ad Hoc Cloud.

IEEE Communications Letters, 2018

2017

Stochastic Game between Cloud Broker and Cloudlet for Mobile Cloud Computing.

Proceedings of the 86th IEEE Vehicular Technology Conference, 2017

2015

Improved parameterized and exact algorithms for cut problems on trees.

Theor. Comput. Sci., 2015

3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size.

Discrete Math., Alg. and Appl., 2015

2014

Algorithms for Cut Problems on Trees.

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

On the independence number of graphs with maximum degree 3.

Theor. Comput. Sci., 2013

Parameterized top-

*K*algorithms.
Theor. Comput. Sci., 2013

Algorithms for Cut Problems on Trees

CoRR, 2013

2012

Local Construction of Spanners in the 3D Space.

IEEE Trans. Mob. Comput., 2012

Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching.

ACM Trans. Algorithms, 2012

Multicut in trees viewed through the eyes of vertex cover.

J. Comput. Syst. Sci., 2012

2011

Separability and topology control of quasi unit disk graphs.

Wireless Networks, 2011

Local algorithms for edge colorings in UDGs.

Theor. Comput. Sci., 2011

On the Planarization of Wireless Sensor Networks.

Algorithmica, 2011

On the Independence Number of Graphs with Maximum Degree 3.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Multicut in Trees Viewed through the Eyes of Vertex Cover.

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size.

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2010

Identifying Gene Clusters within Localized Regions in Multiple Genomes.

Journal of Computational Biology, 2010

2009

On the pseudo-achromatic number problem.

Theor. Comput. Sci., 2009

Local Algorithms for Edge Colorings in UDGs.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Local Construction of Spanners in the 3-D Space.

Proceedings of the Distributed Computing in Sensor Systems, 2009

2008

Effective algorithms and protocols for wireless networking: a topological approach.

PhD thesis, 2008

On the Pseudo-achromatic Number Problem.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

Sorting Based Data Centric Storage.

Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Robust Planarization of Unlocalized Wireless Sensor Networks.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Finding Pathway Structures in Protein Interaction Networks.

Algorithmica, 2007

Improved algorithms for path, matching, and packing problems.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Face Tracing Based Geographic Routing in Nonplanar Wireless Networks.

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Separability and Topology Control of Quasi Unit Disk Graphs.

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

On product covering in 3-tier supply chain models: Natural complete problems for

*W*[3] and*W*[4].
Theor. Comput. Sci., 2006

On the Effective Enumerability of NP Problems.

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4].

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005