research
∙
09/14/2023
International Competition on Graph Counting Algorithms 2023
This paper reports on the details of the International Competition on Gr...
share
research
∙
05/18/2023
On the Computational Complexity of Generalized Common Shape Puzzles
In this study, we investigate the computational complexity of some varia...
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/20/2022
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions
In this paper, we propose a fast method for exactly enumerating a very l...
research
∙
10/07/2021
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions
A rep-tile is a polygon that can be dissected into smaller copies (of th...
research
∙
01/24/2020
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Given n points in the plane, we propose algorithms to compile connected ...
research
∙
11/18/2019
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
Given graphs G and H, we propose a method to implicitly enumerate topolo...
research
∙
04/20/2019