#### Filter Results:

- Full text PDF available (37)

#### Publication Year

2007

2017

- This year (6)
- Last 5 years (38)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Pavel KlavÃk, Jan KratochvÃl, +4 authors TomÃ¡s Vyskocil
- Algorithmica
- 2014

The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can beâ€¦ (More)

- Tetsuo Asano, Taisuke Izumi, +6 authors Ryuhei Uehara
- ISAAC
- 2014

- Takehiro Ito, Shin-Ichi Nakano, +4 authors Yushi Uno
- SWAT
- 2012

We give a polynomial-time approximation scheme for the unique unit-square coverage problem: given a set of points and a set of axis-parallel unit squares, both in the plane, we wish to find a subsetâ€¦ (More)

- Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara
- J. Discrete Algorithms
- 2009

Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the number, a simpleâ€¦ (More)

- Yota Otachi, Ryohei Suda
- Discrete Mathematics
- 2011

We study the bandwidth and the pathwidth of multi-dimensional grids. It can be shown for grids, that these two parameters are equal to a more basic graph parameter, the vertex boundary width. Usingâ€¦ (More)

- Yota Otachi
- ISAAC
- 2012

- Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
- TJJCCGG
- 2012

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 one specified cellâ€¦ (More)

- Toru Araki, Masayoshi Matsushita, Yota Otachi
- Discussiones Mathematicae Graph Theory
- 2015

Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximumâ€¦ (More)

- Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen
- Algorithmica
- 2011

We study the problem of determining the spanning tree congestion of aÂ graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-freeâ€¦ (More)

- Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
- Discrete Applied Mathematics
- 2016

A pseudoforest is a graph where each connected component contains at most one cycle, or alternatively, a graph that can be turned into a forest by removing at most one edge from each connectedâ€¦ (More)