12 results on '"Yuma Tamura"'
Search Results
2. The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.
3. On the Complexity of List H-Packing for Sparse Graph Classes.
4. Parameterized Complexity of Weighted Target Set Selection.
5. Card-Based Zero-Knowledge Proof Protocols for the 15-Puzzle and the Token Swapping Problem.
6. On the Routing Problems in Graphs with Ordered Forbidden Transitions.
7. Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration.
8. Happy Set Problem on Subclasses of Co-comparability Graphs.
9. Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework.
10. Minimization and Parameterized Variants of Vertex Partition Problems on Graphs.
11. Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs.
12. Deterministic Algorithms for the Independent Feedback Vertex Set Problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.