- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j17 |      | Yota Otachi: The path-distance-width of hypercubes. Discussiones Mathematicae Graph Theory 33(2): 467-470 (2013) |
| c11 | | Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno: Base Location Problems for Base-Monotone Regions. WALCOM 2013: 53-64 |
| 2012 | ||
| j16 | | Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen: Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012) |
| j15 | | Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno: Subgraph isomorphism in graph classes. Discrete Mathematics 312(21): 3164-3173 (2012) |
| j14 | | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara: On bipartite powers of bigraphs. Discrete Mathematics & Theoretical Computer Science 14(2): 11-20 (2012) |
| j13 | | Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano: Enumerating All Rooted Trees Including k Leaves. IEICE Transactions 95-D(3): 763-768 (2012) |
| j12 | | Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara: Random generation and enumeration of bipartite permutation graphs. J. Discrete Algorithms 10: 84-97 (2012) |
| j11 | | Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano: Efficient enumeration of ordered trees with k leaves. Theor. Comput. Sci. 442: 22-27 (2012) |
| c10 | | Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC 2012: 372-381 |
| c9 | | Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh: Extending Partial Representations of Subclasses of Chordal Graphs. ISAAC 2012: 444-454 |
| c8 | | |
| c7 | | Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno: A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT 2012: 24-35 |
| i4 | | Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh: Extending Partial Representations of Subclasses of Chordal Graphs. CoRR abs/1207.0255 (2012) |
| i3 | | Pavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil: Extending Partial Representations of Proper and Unit Interval Graphs. CoRR abs/1207.6960 (2012) |
| 2011 | ||
| j10 | | Yota Otachi, Ryohei Suda: Bandwidth and pathwidth of three-dimensional grids. Discrete Mathematics 311(10-11): 881-887 (2011) |
| j9 | | Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi: Spanning tree congestion of k-outerplanar graphs. Discrete Mathematics 311(12): 1040-1045 (2011) |
| j8 | | Kyohei Kozawa, Yota Otachi: Spanning tree congestion of rook's graphs. Discussiones Mathematicae Graph Theory 31(4): 753-761 (2011) |
| j7 | | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. J. Graph Algorithms Appl. 15(6): 727-751 (2011) |
| c6 | | Meng Li, Yota Otachi, Takeshi Tokuyama: Efficient Algorithms for Network Localization Using Cores of Underlying Graphs. ALGOSENSORS 2011: 101-114 |
| c5 | | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. TAMC 2011: 452-462 |
| c4 | | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki: Approximability of the Path-Distance-Width for AT-free Graphs. WG 2011: 271-282 |
| i2 | | Yota Otachi, Ryohei Suda: Bandwidth and pathwidth of three-dimensional grids. CoRR abs/1101.0964 (2011) |
| i1 | | Kyohei Kozawa, Yota Otachi: On spanning tree congestion of Hamming graphs. CoRR abs/1110.1304 (2011) |
| 2010 | ||
| j6 | | Kyohei Kozawa, Yota Otachi, Koichi Yamazaki: The carving-width of generalized hypercubes. Discrete Mathematics 310(21): 2867-2876 (2010) |
| c3 | | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen: Complexity Results for the Spanning Tree Congestion Problem. WG 2010: 3-14 |
| 2009 | ||
| j5 | | Kyohei Kozawa, Yota Otachi, Koichi Yamazaki: Security number of grid-like graphs. Discrete Applied Mathematics 157(11): 2555-2561 (2009) |
| j4 | | Kyohei Kozawa, Yota Otachi, Koichi Yamazaki: On spanning tree congestion of graphs. Discrete Mathematics 309(13): 4215-4224 (2009) |
| c2 | | Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara: Random Generation and Enumeration of Bipartite Permutation Graphs. ISAAC 2009: 1104-1113 |
| c1 | | Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano: Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). WALCOM 2009: 141-150 |
| 2008 | ||
| j3 | | Tetsuya Ishizeki, Yota Otachi, Koichi Yamazaki: An improved algorithm for the longest induced path problem on k-chordal graphs. Discrete Applied Mathematics 156(15): 3057-3059 (2008) |
| j2 | | Yota Otachi, Koichi Yamazaki: A lower bound for the vertex boundary-width of complete k-ary trees. Discrete Mathematics 308(12): 2389-2395 (2008) |
| 2007 | ||
| j1 | | Yota Otachi, Yoshio Okamoto, Koichi Yamazaki: Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discrete Applied Mathematics 155(17): 2383-2390 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page