Search

Your search keyword '"Zhu, Daming"' showing total 62 results

Search Constraints

Start Over You searched for: Author "Zhu, Daming" Remove constraint Author: "Zhu, Daming" Journal computing and combinatorics : 24th international conference, cocoon 2018, qing dao, china, july 2-4, 2018, proceedings Remove constraint Journal: computing and combinatorics : 24th international conference, cocoon 2018, qing dao, china, july 2-4, 2018, proceedings
62 results on '"Zhu, Daming"'

Search Results

1. Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem

2. More Routes for Evacuation

3. Approximating Global Optimum for Probabilistic Truth Discovery

4. Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem

5. New Bounds for Energy Complexity of Boolean Functions

6. Hitting and Covering Partially

7. Contextual Dependent Click Bandit Algorithm for Web Recommendation

8. Approximation Algorithms for a Two-Phase Knapsack Problem

9. Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem

10. SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

11. Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion Primitive

12. A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time

13. On a Fixed Haplotype Variant of the Minimum Error Correction Problem

14. Geometric Spanners in the MapReduce Model

15. Amplitude Amplification for Operator Identification and Randomized Classes

16. LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering

17. Minimum Transactions Problem

18. Approximation Algorithms on Multiple Two-Stage Flowshops

19. Minimum Membership Hitting Sets of Axis Parallel Segments

20. Lower Bounds for Special Cases of Syntactic Multilinear ABPs

21. A Faster FPTAS for the Subset-Sums Ratio Problem

22. Improved Learning of k-Parities

23. Reconstruction of Boolean Formulas in Conjunctive Normal Form

24. Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces

25. The Path Set Packing Problem

26. Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

27. An Approximation Framework for Bounded Facility Location Problems

28. A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications

29. Characterizing Star-PCGs

30. Minimum Spanning Tree of Line Segments

31. Liar’s Dominating Set in Unit Disk Graphs

32. Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage

33. Maximum Colorful Cliques in Vertex-Colored Graphs

34. Efficient Enumeration of Bipartite Subgraphs in Graphs

35. Bipartite Graphs of Small Readability

36. Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators

37. Reconfiguring Spanning and Induced Subgraphs

38. Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds

39. On Colorful Bin Packing Games

40. Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality

41. Partial Homology Relations - Satisfiability in Terms of Di-Cographs

42. An Efficiently Recognisable Subset of Hypergraphic Sequences

43. Solving the Gene Duplication Feasibility Problem in Linear Time

44. An FPT Algorithm for Contraction to Cactus

45. Manipulation Strategies for the Rank-Maximal Matching Problem

46. Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search

47. Exact Algorithms for Finding Partial Edge-Disjoint Paths

48. Generalized Graph k-Coloring Games

49. Directed Path-Width and Directed Tree-Width of Directed Co-graphs

50. Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph

Catalog

Books, media, physical & digital resources