2008 |
21 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono:
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.
CATS 2008: 97-106 |
20 | | Yuichi Asahiro,
Kenichi Kawahara,
Eiji Miyano:
NP-Hardness of the Sorting Buffer Problem on the Uniform Metric.
FCS 2008: 137-143 |
19 | EE | Yuichi Asahiro,
Satoshi Fujita,
Ichiro Suzuki,
Masafumi Yamashita:
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots.
OPODIS 2008: 125-144 |
18 | EE | Yuichi Asahiro,
Eiji Miyano,
Shinichi Shimoirisa:
Grasp and Delivery for Moving Objects on Broken Lines.
Theory Comput. Syst. 42(3): 289-305 (2008) |
2007 |
17 | EE | Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.
AAIM 2007: 167-177 |
16 | EE | Yuichi Asahiro,
Eiji Miyano,
Toshihide Murata,
Hirotaka Ono:
On Approximation of Bookmark Assignments.
MFCS 2007: 115-124 |
15 | EE | Yuichi Asahiro,
Eiji Miyano,
Shuichi Miyazaki,
Takuro Yoshimuta:
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles.
SOFSEM (1) 2007: 164-175 |
14 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Graph Orientation Algorithms to minimize the Maximum Outdegree.
Int. J. Found. Comput. Sci. 18(2): 197-215 (2007) |
2006 |
13 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Graph Orientation Algorithms to Minimize the Maximum Outdegree.
CATS 2006: 11-20 |
12 | EE | Yuichi Asahiro,
Tetsuya Furukawa,
Keiichi Ikegami,
Eiji Miyano:
How to Pack Directed Acyclic Graphs into Small Blocks.
CIAC 2006: 272-283 |
11 | EE | Yuichi Asahiro,
Takashi Horiyama,
Kazuhisa Makino,
Hirotaka Ono,
Toshinori Sakuma,
Masafumi Yamashita:
How to collect balls moving in the Euclidean plane.
Discrete Applied Mathematics 154(16): 2247-2262 (2006) |
2005 |
10 | EE | Yuichi Asahiro,
Eiji Miyano,
Shinichi Shimoirisa:
Pickup and Delivery for Moving Objects on Broken Lines.
ICTCS 2005: 36-50 |
2004 |
9 | EE | Yuichi Asahiro,
Takashi Horiyama,
Kazuhisa Makino,
Hirotaka Ono,
Toshinori Sakuma,
Masafumi Yamashita:
How to Collect Balls Moving in the Euclidean Plane.
Electr. Notes Theor. Comput. Sci. 91: 229-245 (2004) |
2002 |
8 | EE | Limin Xiang,
Kazuo Ushijima,
Yuichi Asahiro:
Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order.
ITCC 2002: 396-403 |
7 | | Yuichi Asahiro,
Refael Hassin,
Kazuo Iwama:
Complexity of finding dense subgraphs.
Discrete Applied Mathematics 121(1-3): 15-26 (2002) |
2001 |
6 | | Yuichi Asahiro,
Eric Chung-Hui Chang,
Amol Dattatraya Mali,
Ichiro Suzuki,
Masafumi Yamashita:
A Distributed Ladder Transportation Algorithm for Two Robots in a Corridor.
ICRA 2001: 3016-3021 |
2000 |
5 | | Yuichi Asahiro,
Eric Chung-Hui Chang,
Amol Dattatraya Mali,
Syunsuke Nagafuji,
Ichiro Suzuki,
Masafumi Yamashita:
Distributed Motion Generation for Two Omni-Directional Robots Carrying Ladder.
DARS 2000: 427-436 |
4 | | Yuichi Asahiro,
Kazuo Iwama,
Hisao Tamaki,
Takeshi Tokuyama:
Greedily Finding a Dense Subgraph.
J. Algorithms 34(2): 203-221 (2000) |
1998 |
3 | | Yuichi Asahiro,
Hajime Asama,
Satoshi Fujita,
Ichiro Suzuki,
Masafumi Yamashita:
Distributed Algorithms for Carrying a Ladder by Omnidirectional Robots in Near Optimal Time.
Sensor Based Intelligent Robots 1998: 240-254 |
1996 |
2 | | Yuichi Asahiro,
Kazuo Iwama,
Hisao Tamaki,
Takeshi Tokuyama:
Greedily Finding a Dense Subgraph.
SWAT 1996: 136-148 |
1995 |
1 | | Yuichi Asahiro,
Kazuo Iwama:
Finding Dense Subgraphs.
ISAAC 1995: 102-111 |