research
∙
05/12/2023
Reconfiguration of Time-Respecting Arborescences
An arborescence, which is a directed analogue of a spanning tree in an u...
share
research
∙
07/28/2022
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems
Given a graph G and two independent sets S, T of G, the independent set ...
research
∙
06/22/2022
Towards Ground Truth for Single Image Deraining
We propose a large-scale dataset of real-world rainy and clean image pai...
research
∙
02/19/2022
Sorting Balls and Water: Equivalence and Computational Complexity
Various forms of sorting problems have been studied over the years. Rece...
research
∙
01/12/2022
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint
We investigate the complexity of finding a transformation from a given s...
research
∙
11/20/2020
Fixed-Parameter Algorithms for Graph Constraint Logic
Non-deterministic constraint logic (NCL) is a simple model of computatio...
research
∙
06/25/2020
Reconfiguration of Spanning Trees with Many or Few Leaves
Let G be a graph and T_1,T_2 be two spanning trees of G. We say that T_1...
research
∙
11/08/2019
Reconfiguring k-path vertex covers
A vertex subset I of a graph G is called a k-path vertex cover if every ...
research
∙
11/07/2019
Trichotomy for the reconfiguration problem of integer linear systems
In this paper, we consider the reconfiguration problem of integer linear...
research
∙
06/12/2019
Decremental Optimization of Dominating Sets Under Reachability Constraints
Given a dominating set, how much smaller a dominating set can we find th...
research
∙
04/25/2018
Incremental Optimization of Independent Sets under Reachability Constraints
We introduce a new framework for reconfiguration problems, and apply it ...
research
∙
03/16/2018
