In this paper, we consider the problems of enumerating minimal vertex co...
Given a directed edge-weighted graph G=(V, E) with beer vertices
B⊆ V, a...
In this study, we investigate the computational complexity of some varia...
In this paper, we give a simple polynomial-time reduction of L(p)-Labeli...
A dominating set S of graph G is called an r-grouped dominating set if
S...
Cram, Domineering, and Arc Kayles are well-studied combinatorial games. ...
We study the following variant of the 15 puzzle. Given a graph and two t...
Reallocation scheduling is one of the most fundamental problems in vario...
The cost-sharing connection game is a variant of routing games on a netw...
Given a graph, an L(p,1)-labeling of the graph is an assignment f from
t...
Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the
(A,ℓ)-Path Pac...
With the advent of the ride-sharing platform, the carpooling has become
...
In this paper, we study a variant of hedonic games, called Seat
Arrangem...
The additively separable hedonic game (ASHG) is a model of coalition
for...
Independent Set Reconfiguration is one of the most well-studied problems...
In this paper we study the problem of finding a small safe set S in a gr...
We study the problem to find a partition of graph G with maximum social
...
Given a sequence of integers, we want to find a longest increasing
subse...