Yuichi Asahiro

	2012
29		Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano: NP-hardness of the sorting buffer problem on the uniform metric. Discrete Applied Mathematics 160(10-11): 1453-1464 (2012)
	2011
28		Yuichi Asahiro, Kenta Kanmera, Eiji Miyano: (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. COCOON 2011: 259-270
27		Yuichi Asahiro, Eiji Miyano, Hirotaka Ono: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discrete Applied Mathematics 159(7): 498-508 (2011)
26		Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Graph Orientation to Maximize the Minimum Weighted Outdegree. Int. J. Found. Comput. Sci. 22(3): 583-601 (2011)
25		Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1): 78-96 (2011)
	2010
24		Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo: Approximating Maximum Diameter-Bounded Subgraphs. LATIN 2010: 615-626
23		Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta: Weighted nearest neighbor algorithms for the graph exploration problem on cycles. Inf. Process. Lett. 110(3): 93-98 (2010)
	2009
22		Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8
	2008
21		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		Yuichi Asahiro, Satoshi Fujita, Ichiro Suzuki, Masafumi Yamashita: A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots. OPODIS 2008: 125-144
18		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		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		Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono: On Approximation of Bookmark Assignments. MFCS 2007: 115-124
15		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		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		Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20
12		Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano: How to Pack Directed Acyclic Graphs into Small Blocks. CIAC 2006: 272-283
11		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		Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa: Pickup and Delivery for Moving Objects on Broken Lines. ICTCS 2005: 36-50
	2004
9		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		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

Coauthor Index

1	Hajime Asama	[3]
2	Eric Chung-Hui Chang	[5] [6]
3	Satoshi Fujita	[3] [19]
4	Tetsuya Furukawa	[12]
5	Refael Hassin	[7]
6	Takashi Horiyama	[9] [11]
7	Keiichi Ikegami	[12]
8	Kazuo Iwama	[1] [2] [4] [7]
9	Jesper Jansson	[17] [22] [25] [26]
10	Kenta Kanmera	[28]
11	Kenichi Kawahara	[20] [29]
12	Kazuhisa Makino	[9] [11]
13	Amol Dattatraya Mali	[5] [6]
14	Eiji Miyano	[10] [12] [13] [14] [15] [16] [17] [18] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29]
15	Shuichi Miyazaki	[15] [23]
16	Toshihide Murata	[16]
17	Syunsuke Nagafuji	[5]
18	Hirotaka Ono	[9] [11] [13] [14] [16] [17] [21] [22] [25] [26] [27]
19	Toshinori Sakuma	[9] [11]
20	Kazuaki Samizo	[24]
21	Shinichi Shimoirisa	[10] [18]
22	Ichiro Suzuki	[3] [5] [6] [19]
23	Hisao Tamaki	[2] [4]
24	Takeshi Tokuyama	[2] [4]
25	Kazuo Ushijima	[8]
26	Limin Xiang	[8]
27	Masafumi Yamashita	[3] [5] [6] [9] [11] [19]
28	Takuro Yoshimuta	[15] [23]
29	Kouhei Zenmyo	[13] [14] [17] [25]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page