Zobrazeno 1 - 10
of 71
pro vyhledávání: '"van der Zanden, Tom"'
Discrete Choice Experiments (DCEs) investigate the attributes that influence individuals' choices when selecting among various options. To enhance the quality of the estimated choice models, researchers opt for Bayesian optimal designs that utilize e
Externí odkaz:
http://arxiv.org/abs/2402.18533
Autor:
Gomes, Guilherme C. M., Legrand-Duchesne, Clément, Mahmoud, Reem, Mouawad, Amer E., Okamoto, Yoshio, Santos, Vinicius F. dos, van der Zanden, Tom C.
We study the problem of reconfiguring one minimum $s$-$t$-separator $A$ into another minimum $s$-$t$-separator $B$ in some $n$-vertex graph $G$ containing two non-adjacent vertices $s$ and $t$. We consider several variants of the problem as we focus
Externí odkaz:
http://arxiv.org/abs/2307.07782
The Shapley value is the solution concept in cooperative game theory that is most used in both theoretical as practical settings. Unfortunately, computing the Shapley value is computationally intractable in general. This paper focuses on computing th
Externí odkaz:
http://arxiv.org/abs/2208.12868
Autor:
C.M. Gomes, Guilherme, Legrand-Duchesne, Clément, Mahmoud, Reem, Mouawad, Amer E., Okamoto, Yoshio, F. dos Santos, Vinicius, van der Zanden, Tom C.
Publikováno v:
In Journal of Computer and System Sciences December 2024 146
We propose a new kind of sliding-block puzzle, called Gourds, where the objective is to rearrange 1 x 2 pieces on a hexagonal grid board of 2n + 1 cells with n pieces, using sliding, turning and pivoting moves. This puzzle has a single empty cell on
Externí odkaz:
http://arxiv.org/abs/2011.00968
Autor:
Bodlaender, Hans L., Hanaka, Tesshu, Jaffke, Lars, Ono, Hirotaka, Otachi, Yota, van der Zanden, Tom C.
In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences to vertices in a graph. The utility of an agent depends on the neighbors assigned in the graph. Mor
Externí odkaz:
http://arxiv.org/abs/2002.10898
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent Set proble
Externí odkaz:
http://arxiv.org/abs/1909.12044
Autor:
Bodlaender, Hans L., Hanaka, Tesshu, Kobayashi, Yasuaki, Kobayashi, Yusuke, Okamoto, Yoshio, Otachi, Yota, van der Zanden, Tom C.
We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus on the minor relation since other well-known relations lead to either
Externí odkaz:
http://arxiv.org/abs/1905.10670
Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial gonality of
Externí odkaz:
http://arxiv.org/abs/1808.06921