The following pages link to Binhai Zhu (Q243606):
Displaying 50 items.
- A 1.5-approximation algorithm for two-sided scaffold filling (Q261348) (← links)
- Computing the optimal bridge between two convex polygons (Q294636) (← links)
- Following a curve with the discrete Fréchet distance (Q300222) (← links)
- Largest area convex hull of imprecise data based on axis-aligned squares (Q386441) (← links)
- Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Minimum common string partition revisited (Q437061) (← links)
- Exact and approximation algorithms for the complementary maximal strip recovery problem (Q437065) (← links)
- A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves (Q441865) (← links)
- Improved algorithms for intermediate dataset storage in a cloud-based dataflow (Q507435) (← links)
- On the red/blue spanning tree problem (Q534557) (← links)
- Guarding polyhedral terrains (Q676572) (← links)
- New approximation algorithms for map labeling with sliding labels (Q702357) (← links)
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← links)
- On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction (Q861287) (← links)
- An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations (Q897944) (← links)
- A simple factor-3 approximation for labeling points with circles (Q1014403) (← links)
- The Canadian Traveller Problem and its competitive analysis (Q1037454) (← links)
- On recovering syntenic blocks from comparative maps (Q1041433) (← links)
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction (Q1041756) (← links)
- A randomized algorithm for the Voronoi diagram of line segments on coarse-grained multiprocessors (Q1125809) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Computing the shortest diagonal of a monotone polygon in linear time (Q1198084) (← links)
- A note on point location in Delaunay triangulations of random points (Q1277376) (← links)
- Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations (Q1286475) (← links)
- (Q1364362) (redirect page) (← links)
- Feasibility of design in stereolithography (Q1364363) (← links)
- Polynomial time algorithms for three-label point labeling. (Q1401261) (← links)
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- On some polyhedra covering problems (Q1592841) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- The connected disk covering problem (Q1702836) (← links)
- A randomized FPT approximation algorithm for maximum alternating-cycle decomposition with applications (Q1790950) (← links)
- Some problems on factorizations with constraints in bipartite graphs (Q1811123) (← links)
- Computing the degree-4 shortest network under a given topology (Q1972318) (← links)
- On the solution bound of two-sided scaffold filling (Q2034400) (← links)
- Computing a consensus trajectory in a vehicular network (Q2091112) (← links)
- Dispersing and grouping points on segments in the plane (Q2110731) (← links)
- Permutation-constrained common string partitions with applications (Q2146123) (← links)
- The complexity of finding common partitions of genomes with predefined block sizes (Q2163952) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- Expected computations on color spanning sets (Q2343982) (← links)
- Weak visibility polygons of NURBS curves inside simple polygons (Q2348953) (← links)
- Complexity analysis and algorithms for the program download problem (Q2354307) (← links)
- Robust optimization for the hazardous materials transportation network design problem (Q2355987) (← links)
