146 results on '"ONO, HIROTAKA"'
Search Results
2. Structural Parameterizations of Vertex Integrity [Best Paper]
3. On the Computational Complexity of Generalized Common Shape Puzzles
4. Faster Winner Determination Algorithms for (Colored) Arc Kayles
5. Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs
6. Shortest Longest-Path Graph Orientations
7. Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond
8. Sequentially Swapping Tokens: Further on Graph Classes
9. Reallocation Problems with Minimum Completion Time
10. Fair Ride Allocation on a Line
11. Optical Amplification Technologies
12. Winner Determination Algorithms for Graph Games with Matching Structures
13. Computing L(p, 1)-Labeling with Combined Parameters
14. Parameterized Complexity of -Path Packing
15. Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium
16. Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem
17. Computational Complexity of Hedonic Games on Sparse Graphs
18. Independent Set Reconfiguration Parameterized by Modular-Width
19. Graph Orientation with Edge Modifications
20. Parameterized Complexity of Safe Set
21. A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs
22. Optimal Partition of a Tree with Social Distance
23. Graph Orientation with Splits
24. A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection
25. On the Maximum Weight Minimal Separator
26. An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication
27. The Complexity of Dominating Set Reconfiguration
28. Reconfiguration of Cliques in a Graph
29. Robustness Analysis of Evolutionary Algorithms to Portfolio Optimization Against Errors in Asset Means
30. (Total) Vector Domination for Graphs with Bounded Branchwidth
31. Fixed-Parameter Tractability of Token Jumping on Planar Graphs
32. Depth-First Search Using Bits
33. Polynomial-Time Algorithm for Sliding Tokens on Trees
34. Subexponential Fixed-Parameter Algorithms for Partial Vector Domination
35. Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
36. Approximability of Latin Square Completion-Type Puzzles
37. On the Parameterized Complexity for Token Jumping on Graphs
38. Base Location Problems for Base-Monotone Regions
39. Reconfiguration of List L(2,1)-Labelings in a Graph
40. Graph Orientations Optimizing the Number of Light or Heavy Vertices
41. Finding Longest Common Segments in Protein Structures in Nearly Linear Time
42. Minimum Certificate Dispersal with Tree Structures
43. Approximability of the Path-Distance-Width for AT-free Graphs
44. On the Approximability of Minimum Topic Connected Overlay and Its Special Instances
45. The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2
46. Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol
47. Pattern Formation through Optimum Matching by Oblivious CORDA Robots
48. The (p,q)-total Labeling Problem for Trees
49. Route-Enabling Graph Orientation Problems
50. How to Design a Linear Cover Time Random Walk on a Finite 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.