The following pages link to Guohui Lin (Q166205):
Displaying 41 items.
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
- (Q4636539) (← links)
- Computing Phylogenetic Roots with Bounded Degrees and Errors (Q4706236) (← links)
- (Q4778572) (← links)
- Approximating the Minimum Independent Dominating Set in Perturbed Graphs (Q4925243) (← links)
- (Q4938658) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights (Q5251645) (← links)
- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems (Q5410647) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473988) (← links)
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667) (← links)
- Computing and Combinatorics (Q5716931) (← links)
- Parameterized algorithms for the happy set problem (Q5896128) (← links)
- Algorithms - ESA 2003 (Q5897278) (← links)
- Algorithms and Computation (Q5897906) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918266) (← links)
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918364) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918607) (← links)
- A randomized approximation algorithm for metric triangle packing (Q5918818) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919645) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5927652) (← links)
- Grade of service Steiner minimum trees in the Euclidean plane (Q5953596) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines (Q5963694) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- Corrigendum to: ``Complexity and approximability of the happy set problem'' (Q6076349) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
- Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6496843) (← links)
- Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6546417) (← links)
- On computing a center persistence diagram (Q6546596) (← links)
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops (Q6546990) (← links)
- Planar graphs are acyclically edge \((\Delta + 5)\)-colorable (Q6571271) (← links)
- Approximation algorithms for covering vertices by long paths (Q6584055) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)
- Approximation algorithms for the longest run subsequence problem (Q6622004) (← links)
