The following pages link to Fenghui Zhang (Q440013):
Displaying 22 items.
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- On the planarization of wireless sensor networks (Q548669) (← links)
- Local algorithms for edge colorings in UDGs (Q638541) (← links)
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Finding pathway structures in protein interaction networks (Q995774) (← links)
- On the pseudo-achromatic number problem (Q1006054) (← links)
- Probability distribution of terrestrial planets in habitable zones around host stars (Q1037258) (← links)
- Parameterized top-\(K\) algorithms (Q1935815) (← links)
- On the independence number of graphs with maximum degree 3 (Q1951559) (← links)
- (Q2934608) (← links)
- Algorithms for Cut Problems on Trees (Q2942406) (← links)
- 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size (Q2999343) (← links)
- On the Independence Number of Graphs with Maximum Degree 3 (Q3104780) (← links)
- Iterative Expansion and Color Coding (Q3189047) (← links)
- On the Effective Enumerability of NP Problems (Q3499739) (← links)
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms (Q3654388) (← links)
- Multicut in Trees Viewed through the Eyes of Vertex Cover (Q5199244) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- Algorithmic Applications in Management (Q5710142) (← links)
- Local Algorithms for Edge Colorings in UDGs (Q5851106) (← links)
