Akira Suzuki

Yuma Tamura

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]

Yuma Tamura

Takaaki Mizuki

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

2023

Feedback vertex set reconfiguration in planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., November, 2023

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints.

[BibT_eX]

[DOI]

Algorithmica, September, 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

Reconfiguration of Time-Respecting Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence, 2023

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 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

Reconfiguring <i>k</i>-Path Vertex Covers.

[BibT_eX]

[DOI]

Duc A. Hoang

Tsuyoshi Yagita

IEICE Trans. Inf. Syst., 2022

Path Cover Problems with Length Cost.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Happy Set Problem on Subclasses of Co-comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Algorithms for Coloring Reconfiguration Under Recolorability Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Sorting Balls and Water: Equivalence and Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 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

Parameterized complexity of independent set reconfiguration problems.

[BibT_eX]

[DOI]

Takehiro Ito

Marcin Jakub Kaminski

Discret. Appl. Math., 2020

Trichotomy for the Reconfiguration Problem of Integer Linear Systems.

[BibT_eX]

[DOI]

Kei Kimura

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

Reconfiguring k-path Vertex Covers.

[BibT_eX]

[DOI]

Duc A. Hoang

Tsuyoshi Yagita

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

Shortest Reconfiguration of Colorings Under Kempe Changes.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Fixed-Parameter Algorithms for Graph Constraint Logic.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Decremental Optimization of Dominating Sets Under the Reconfiguration Framework.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Reconfiguration of Spanning Trees with Many or Few Leaves.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Decremental Optimization of Dominating Sets Under Reachability Constraints.

[BibT_eX]

[DOI]

CoRR, 2019

Incremental Optimization of Independent Sets Under the Reconfiguration Framework.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Max-Min 3-Dispersion Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Diameter of Colorings Under Kempe Changes.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Computational Power of Threshold Circuits of Energy at most Two.

[BibT_eX]

[DOI]

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

Incremental Optimization of Independent Sets under Reachability Constraints.

[BibT_eX]

[DOI]

CoRR, 2018

Algorithms for Coloring Reconfiguration Under Recolorability Constraints.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Reconfiguring Spanning and Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Hitori Numbers.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Complexity of Tiling a Polygon with Trominoes or Bars.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Sequentially Swapping Colored Tokens on Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

The Complexity of (List) Edge-Coloring Reconfiguration Problem.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Complexity of Coloring Reconfiguration under Recolorability Constraints.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2015

Competitive Diffusion on Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

The Complexity of Dominating Set Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

Computational Complexity of Competitive Diffusion on (Un)weighted Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

On the Parameterized Complexity for Token Jumping on Graphs.

[BibT_eX]

[DOI]

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

Swapping Labeled Tokens on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Reconfiguration of Dominating Sets.

[BibT_eX]

[DOI]

Amer E. Mouawad

Naomi Nishimura

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Energy and fan-in of logic circuits computing symmetric Boolean functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays.

[BibT_eX]

[DOI]

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

On the Parameterized Complexity of Reconfiguration Problems.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

On the Minimum Caterpillar Problem in Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Hitori Number.

[BibT_eX]

[DOI]

Takeaki Uno

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Energy and Fan-In of Threshold Circuits Computing Mod Functions.

[BibT_eX]

[DOI]

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

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Energy-Efficient Threshold Circuits Computing Mod Functions.

[BibT_eX]

[DOI]