The following pages link to Binhai Zhu (Q243606):
Displaying 50 items.
- (Q4472484) (← links)
- (Q4525742) (← links)
- (Q4538059) (← links)
- (Q4551354) (← links)
- (Q4551359) (← links)
- (Q4608597) (← links)
- Genomic Scaffold Filling: A Progress Report (Q4632164) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model (Q4632199) (← links)
- APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS (Q4652928) (← links)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING (Q4682165) (← links)
- (Q4808663) (← links)
- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies (Q4925255) (← links)
- The Program Download Problem: Complexity and Algorithms (Q4925284) (← links)
- VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE (Q4931733) (← links)
- A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q5088892) (← links)
- Minimum Interval Cover and Its Application to Genome Sequencing (Q5199157) (← links)
- Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem (Q5199158) (← links)
- On the Exact Block Cover Problem (Q5251630) (← links)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
- Genomic Scaffold Filling Revisited. (Q5369550) (← links)
- Guarding a terrain by two watchtowers (Q5370631) (← links)
- Expected Computations on Color Spanning Sets (Q5405923) (← links)
- The Approximability of the Exemplar Breakpoint Distance Problem (Q5434407) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
- (Q5461495) (← links)
- (Q5501791) (← links)
- On Recovering Syntenic Blocks from Comparative Maps (Q5505670) (← links)
- Algorithms and Computation (Q5712150) (← links)
- Computing and Combinatorics (Q5716969) (← links)
- Computing and Combinatorics (Q5716979) (← links)
- The Tandem Duplication Distance Is NP-Hard (Q5874286) (← links)
- (Q5874451) (← links)
- Fundamentals of Computation Theory (Q5900799) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901270) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901285) (← links)
- On a minimum linear classification problem (Q5906983) (← links)
- On a minimum linear classification problem (Q5920647) (← links)
- Guarding a terrain by two watchtowers (Q5961974) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)
- New approximation algorithms for RNA secondary structures prediction problems by local search (Q6150672) (← links)
- Beyond the longest letter-duplicated subsequence problem (Q6496833) (← links)
- Algorithms and hardness for the longest common subsequence of three strings and related problems (Q6545446) (← links)
- On computing a center persistence diagram (Q6546596) (← links)
- Red-black spanners for mixed-charging vehicular networks (Q6591473) (← links)
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals (Q6591644) (← links)
