Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Asahiro, Yuichi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of finding maximum regular induced subgraphs with prescribed degree
Yuichi Asahiro
,
Hiroshi Eto
,
Takehiro Ito
,
Eiji Miyano
Theoretical Computer Science
550
, 2014, pp. 21-35
Graph orientation to maximize the minimum weighted outdegree
Yuichi Asahiro
,
Jesper Jansson
,
Eiji Miyano
,
Hirotaka Ono
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 583-601
(1+\epsilon)
-competitive algorithm for online OVSF code assignment with resource augmentation
Yuichi Asahiro
,
Kenta Kanmera
,
Eiji Miyano
Lecture Notes in Computer Science
6842
, 2011, pp. 259-270
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Yuichi Asahiro
,
Eiji Miyano
,
Shuichi Miyazaki
,
Takuro Yoshimuta
Information Processing Letters
110
(3), 2010, pp. 93-98
Approximating maximum diameter-bounded subgraphs
Yuichi Asahiro
,
Eiji Miyano
,
Kazuaki Samizo
Lecture Notes in Computer Science
6034
, 2010, pp. 615-626
Grasp and delivery for moving objects on broken lines
Yuichi Asahiro
,
Eiji Miyano
,
Shinichi Shimoirisa
Theory of Computing Systems
42
(3), 2008, pp. 289-305
On approximation of bookmark assignments
Yuichi Asahiro
,
Eiji Miyano
,
Toshihide Murata
,
Hirotaka Ono
Lecture Notes in Computer Science
4708
, 2007, pp. 115-124
Graph orientation algorithms to minimize the maximum outdegree
Yuichi Asahiro
,
Eiji Miyano
,
Hirotaka Ono
,
Kouhei Zenmyo
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 197-215
How to pack directed acyclic graphs into small blocks
Yuichi Asahiro
,
Tetsuya Furukawa
,
Keiichi Ikegami
,
Eiji Miyano
Lecture Notes in Computer Science
3998
, 2006, pp. 272-283
Greedily finding a dense subgraph
Yuichi Asahiro
,
Kazuo Iwama
,
Hisao Tamaki
,
Takeshi Tokuyama
Journal of Algorithms
34
(2), 2000, pp. 203-221
Distributed algorithms for carrying a ladder by omnidirectional robots in near optimal time
Yuichi Asahiro
,
Hajime Asama
,
Satoshi Fujita
,
Ichiro Suzuki
,
Masafumi Yamashita
Lecture Notes in Computer Science
1724
, 1999, pp. 240-254
Greedily finding a dense subgraph
Yuichi Asahiro
,
Kazuo Iwama
,
Hisao Tamaki
,
Takeshi Tokuyama
Lecture Notes in Computer Science
1097
, 1996, pp. 136-148
Finding dense subgraphs
Yuichi Asahiro
,
Kazuo Iwama
Lecture Notes in Computer Science
1004
, 1995, pp. 102-111