Yuma Tamura

Keisuke Okumura

CoRR, May, 2026

On (In)approximability of MaxMin Independent Set Reconfiguration.

[BibT_eX]

[DOI]

CoRR, April, 2026

Finding Shortest Reconfiguration Sequences on Independent Set Polytopes.

[BibT_eX]

[DOI]

CoRR, April, 2026

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

Spanning Trees with a Small Vertex Cover: The Complexity on Specific Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2025

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2025

Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

Coloring Reconfiguration Under Color Swapping.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024

Absolute Zeta functions and periodicity of quantum walks on cycles.

[BibT_eX]

[DOI]

Quantum Inf. Comput., October, 2024

On the Complexity of List H-Packing for Sparse Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Parameterized Complexity of Weighted Target Set Selection.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2024

Finding Induced Subgraphs from Graphs with Small Mim-Width.

[BibT_eX]

[DOI]

Yota Otachi

Akira Suzuki

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Card-Based Zero-Knowledge Proof Protocols for the 15-Puzzle and the Token Swapping Problem.

[BibT_eX]

[DOI]

Akira Suzuki

Takaaki Mizuki

Proceedings of the 11th ACM Asia Public-Key Cryptography Workshop, 2024

2023

Decremental optimization of vertex-colouring under the reconfiguration framework.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, January, 2023

Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

On the Routing Problems in Graphs with Ordered Forbidden Transitions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Happy Set Problem on Subclasses of Co-comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

2021

Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Minimization and Parameterized Variants of Vertex Partition Problems on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2015

Algorithms for the Independent Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014

Deterministic Algorithms for the Independent Feedback Vertex Set Problem.

[BibT_eX]

[DOI]