This paper proposes an algorithmic framework for solving various combinatorial
reconfiguration problems by using zero-suppressed binary decision diagrams (ZDDs), a …

Evaluating influence spread in social networks is a fundamental procedure to estimate the
word-of-mouth effect in viral marketing. There are enormous studies about this topic; …

In this paper, we propose a novel approach to the detection of spatial clusters based on
linkage information of a map dataset. Spatial scan statistic has been widely used for …

This paper considers enumeration of specific subgraphs of a given graph by using a data
structure called a zero-suppressed binary decision diagram (ZDD). A ZDD can represent the …

We consider bandit combinatorial optimization (BCO) problems. A BCO instance generally
has a huge set of all feasible solutions, which we call the action set. To avoid dealing with …

Our contemporary society survives on the services provided by several network
infrastructures, such as communication, power, and transportation, so their reliability should …

This paper reports on the details of the International Competition on Graph Counting
Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs …

We investigate common developments that can fold into plural incongruent orthogonal
boxes. Recently, it was shown that there are infinitely many orthogonal polygons that fold …

In this paper, we propose a new method to compile $ s $-$ t $ simple paths on a graph using
a new compilation method called merging frontier based search. Recently, Nishino et al …

We address Stackelberg models of combinatorial congestion games (CCGs); we aim to
optimize the parameters of CCGs so that the selfish behavior of non-atomic players attains …