26 results on '"Matsui, Tomomi"'
Search Results
2. Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
3. Additive approximation algorithms for modularity maximization
4. A doubly nonnegative relaxation for modularity density maximization
5. Uptake mechanisms of polychlorinated biphenyls in Cucurbita pepo via xylem sap containing major latex-like proteins
6. Ergothioneine protects Streptomyces coelicolor A3(2) from oxidative stresses
7. Zinc finger protein genes from Cucurbita pepo are promising tools for conferring non-Cucurbitaceae plants with ability to accumulate persistent organic pollutants
8. Antifungal efficacy of Brazilian green propolis extracts and honey on Tinea capitis and Tinea versicolor
9. A study of the quadratic semi-assignment polytope
10. Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
11. An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
12. A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
13. Semidefinite programming based approaches to the break minimization problem
14. A general construction method for mixed-level supersaturated design
15. Random generation of [formula omitted] contingency tables
16. Asymmetric [2,3] Wittig rearrangement of crotyl furfuryl ethers
17. Fractional programming formulation for the vertex coloring problem
18. A note on generalized rank aggregation
19. A polynomial-time algorithm to find an equitable home–away assignment
20. Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
21. Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
22. A fast bipartite network flow algorithm for selective assembly
23. Algorithms for finding a Kth best valued assignment
24. Adjacency of the best and second best valued solutions in combinatorial optimization problems
25. An algorithm for fractional assignment problems
26. The minimum spanning tree problem on a planar graph
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.