activity
20082023
most citedExact and fixed-parameter algorithms for metro-line crossing minimization problems

5 citations · 25 across the 22 of their papers we have counts for

collaborators
Showing cs.DMShow all

7 papers · 1 filter

cs.DM2021★ 2 cited

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama +7

A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit sq…

cs.DM2016★ 2 cited

Hanabi is NP-hard, Even for Cheaters who Look at Their Cards

Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez +5

In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among colors and a number…

cs.DM2013

Morpion Solitaire 5D: a new upper bound of 121 on the maximum score

Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu +2

Morpion Solitaire is a pencil-and-paper game for a single player. A move in this game consists of putting a cross at a lattice point and then drawing a line segment that passes thr…

cs.DM2012

On Complexity of Flooding Games on Graphs with Interval Representations

Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara +2

The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors o…

cs.DM2012

Solving Tantrix via Integer Programming

Fumika Kino, Yushi Uno

Tantrix is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we give a proble…

cs.DM2010★ 2 cited

The complexity of UNO

Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey +3

This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, includ…

cs.DM2009★ 1 cited

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono +1

A -total labeling of a graph is an assignment from the vertex set and the edge set to the set of nonnegative integers such that $|f(x)-…